./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version e19ca921 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-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 16:22:30,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 16:22:30,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 16:22:30,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 16:22:30,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 16:22:30,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 16:22:30,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 16:22:30,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 16:22:30,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 16:22:30,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 16:22:30,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 16:22:30,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 16:22:30,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 16:22:30,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 16:22:30,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 16:22:30,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 16:22:30,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 16:22:30,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 16:22:30,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 16:22:30,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 16:22:30,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 16:22:30,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 16:22:30,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 16:22:30,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 16:22:30,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 16:22:30,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 16:22:30,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 16:22:30,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 16:22:30,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 16:22:30,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 16:22:30,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 16:22:30,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 16:22:30,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 16:22:30,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 16:22:30,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 16:22:30,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 16:22:30,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 16:22:30,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 16:22:30,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 16:22:30,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 16:22:30,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 16:22:30,839 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-22 16:22:30,863 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 16:22:30,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 16:22:30,864 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 16:22:30,864 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 16:22:30,865 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 16:22:30,865 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 16:22:30,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 16:22:30,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 16:22:30,866 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 16:22:30,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 16:22:30,867 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 16:22:30,867 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 16:22:30,867 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 16:22:30,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 16:22:30,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 16:22:30,868 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 16:22:30,868 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 16:22:30,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 16:22:30,868 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 16:22:30,868 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 16:22:30,868 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 16:22:30,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 16:22:30,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 16:22:30,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 16:22:30,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:22:30,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 16:22:30,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 16:22:30,870 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 16:22:30,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 16:22:30,871 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 16:22:30,871 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> dd9f812dd0592e9d2894b2831060b27794691dcfdafe5c5494c28350656b71ee [2021-12-22 16:22:31,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 16:22:31,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 16:22:31,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 16:22:31,129 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 16:22:31,130 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 16:22:31,130 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-01-1.i [2021-12-22 16:22:31,173 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/385223179/3bdb23e98bbc455a85abcf540f05b139/FLAG5a166980f [2021-12-22 16:22:31,603 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 16:22:31,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i [2021-12-22 16:22:31,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/385223179/3bdb23e98bbc455a85abcf540f05b139/FLAG5a166980f [2021-12-22 16:22:31,634 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/385223179/3bdb23e98bbc455a85abcf540f05b139 [2021-12-22 16:22:31,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 16:22:31,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 16:22:31,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 16:22:31,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 16:22:31,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 16:22:31,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f932bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:31, skipping insertion in model container [2021-12-22 16:22:31,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:22:31" (1/1) ... [2021-12-22 16:22:31,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 16:22:31,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 16:22:31,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2021-12-22 16:22:31,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2021-12-22 16:22:31,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2021-12-22 16:22:31,916 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2021-12-22 16:22:31,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2021-12-22 16:22:31,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2021-12-22 16:22:31,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2021-12-22 16:22:31,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2021-12-22 16:22:31,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2021-12-22 16:22:31,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2021-12-22 16:22:31,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2021-12-22 16:22:31,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2021-12-22 16:22:31,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2021-12-22 16:22:31,929 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:22:31,948 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 16:22:31,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22080,22093] [2021-12-22 16:22:31,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22353,22366] [2021-12-22 16:22:31,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22587,22600] [2021-12-22 16:22:31,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22657,22670] [2021-12-22 16:22:31,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[22924,22937] [2021-12-22 16:22:31,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23032,23045] [2021-12-22 16:22:31,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23263,23276] [2021-12-22 16:22:31,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23343,23356] [2021-12-22 16:22:31,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23422,23435] [2021-12-22 16:22:31,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23512,23525] [2021-12-22 16:22:31,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23690,23703] [2021-12-22 16:22:31,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23768,23781] [2021-12-22 16:22:32,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-01-1.i[23845,23858] [2021-12-22 16:22:32,004 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 16:22:32,028 INFO L208 MainTranslator]: Completed translation [2021-12-22 16:22:32,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:32 WrapperNode [2021-12-22 16:22:32,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 16:22:32,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 16:22:32,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 16:22:32,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 16:22:32,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:32" (1/1) ... [2021-12-22 16:22:32,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:32" (1/1) ... [2021-12-22 16:22:32,077 INFO L137 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 231 [2021-12-22 16:22:32,079 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 16:22:32,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 16:22:32,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 16:22:32,080 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 16:22:32,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:32" (1/1) ... [2021-12-22 16:22:32,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:32" (1/1) ... [2021-12-22 16:22:32,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:32" (1/1) ... [2021-12-22 16:22:32,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:32" (1/1) ... [2021-12-22 16:22:32,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:32" (1/1) ... [2021-12-22 16:22:32,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:32" (1/1) ... [2021-12-22 16:22:32,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:32" (1/1) ... [2021-12-22 16:22:32,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 16:22:32,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 16:22:32,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 16:22:32,120 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 16:22:32,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:32" (1/1) ... [2021-12-22 16:22:32,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 16:22:32,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:22:32,156 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) [2021-12-22 16:22:32,173 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 [2021-12-22 16:22:32,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 16:22:32,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 16:22:32,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 16:22:32,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 16:22:32,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 16:22:32,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 16:22:32,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 16:22:32,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 16:22:32,253 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 16:22:32,255 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 16:22:32,604 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 16:22:32,612 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 16:22:32,615 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-12-22 16:22:32,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:22:32 BoogieIcfgContainer [2021-12-22 16:22:32,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 16:22:32,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 16:22:32,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 16:22:32,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 16:22:32,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:22:31" (1/3) ... [2021-12-22 16:22:32,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80fb854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:22:32, skipping insertion in model container [2021-12-22 16:22:32,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:22:32" (2/3) ... [2021-12-22 16:22:32,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80fb854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:22:32, skipping insertion in model container [2021-12-22 16:22:32,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:22:32" (3/3) ... [2021-12-22 16:22:32,627 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-01-1.i [2021-12-22 16:22:32,632 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 16:22:32,633 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 84 error locations. [2021-12-22 16:22:32,675 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 16:22:32,682 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 16:22:32,683 INFO L340 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2021-12-22 16:22:32,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 200 states, 115 states have (on average 2.1913043478260867) internal successors, (252), 199 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 16:22:32,719 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:32,720 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 16:22:32,720 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:32,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:32,726 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-22 16:22:32,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:32,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484253748] [2021-12-22 16:22:32,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:32,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:32,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:32,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484253748] [2021-12-22 16:22:32,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484253748] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:32,892 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:32,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:22:32,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386745555] [2021-12-22 16:22:32,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:32,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:22:32,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:32,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:22:32,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:22:32,925 INFO L87 Difference]: Start difference. First operand has 200 states, 115 states have (on average 2.1913043478260867) internal successors, (252), 199 states have internal predecessors, (252), 0 states have call successors, (0), 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) [2021-12-22 16:22:33,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:33,129 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2021-12-22 16:22:33,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:22:33,132 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 [2021-12-22 16:22:33,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:33,143 INFO L225 Difference]: With dead ends: 201 [2021-12-22 16:22:33,143 INFO L226 Difference]: Without dead ends: 197 [2021-12-22 16:22:33,145 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:33,149 INFO L933 BasicCegarLoop]: 120 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, 122 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.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:33,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 122 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-22 16:22:33,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2021-12-22 16:22:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 117 states have (on average 1.7435897435897436) internal successors, (204), 191 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) [2021-12-22 16:22:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 204 transitions. [2021-12-22 16:22:33,238 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 204 transitions. Word has length 3 [2021-12-22 16:22:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:33,238 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 204 transitions. [2021-12-22 16:22:33,239 INFO L471 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) [2021-12-22 16:22:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 204 transitions. [2021-12-22 16:22:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 16:22:33,239 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:33,239 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 16:22:33,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 16:22:33,240 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:33,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:33,241 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-22 16:22:33,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:33,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251964090] [2021-12-22 16:22:33,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:33,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:33,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:33,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251964090] [2021-12-22 16:22:33,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251964090] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:33,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:33,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:22:33,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131138140] [2021-12-22 16:22:33,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:33,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:22:33,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:33,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:22:33,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:22:33,298 INFO L87 Difference]: Start difference. First operand 192 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) [2021-12-22 16:22:33,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:33,441 INFO L93 Difference]: Finished difference Result 221 states and 232 transitions. [2021-12-22 16:22:33,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:22:33,442 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 [2021-12-22 16:22:33,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:33,443 INFO L225 Difference]: With dead ends: 221 [2021-12-22 16:22:33,445 INFO L226 Difference]: Without dead ends: 221 [2021-12-22 16:22:33,446 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:33,446 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 180 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:33,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 148 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:33,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-22 16:22:33,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 201. [2021-12-22 16:22:33,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 134 states have (on average 1.671641791044776) internal successors, (224), 200 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) [2021-12-22 16:22:33,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 224 transitions. [2021-12-22 16:22:33,455 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 224 transitions. Word has length 3 [2021-12-22 16:22:33,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:33,455 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 224 transitions. [2021-12-22 16:22:33,455 INFO L471 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) [2021-12-22 16:22:33,456 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 224 transitions. [2021-12-22 16:22:33,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-22 16:22:33,456 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:33,456 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-22 16:22:33,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 16:22:33,457 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:33,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:33,457 INFO L85 PathProgramCache]: Analyzing trace with hash 889446311, now seen corresponding path program 1 times [2021-12-22 16:22:33,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:33,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806270991] [2021-12-22 16:22:33,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:33,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:33,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:33,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806270991] [2021-12-22 16:22:33,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806270991] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:33,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:33,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:22:33,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443621669] [2021-12-22 16:22:33,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:33,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:22:33,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:33,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:22:33,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:22:33,498 INFO L87 Difference]: Start difference. First operand 201 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) [2021-12-22 16:22:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:33,523 INFO L93 Difference]: Finished difference Result 216 states and 227 transitions. [2021-12-22 16:22:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:22:33,524 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 [2021-12-22 16:22:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:33,525 INFO L225 Difference]: With dead ends: 216 [2021-12-22 16:22:33,525 INFO L226 Difference]: Without dead ends: 216 [2021-12-22 16:22:33,525 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:33,526 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 176 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:33,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 203 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:22:33,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-22 16:22:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2021-12-22 16:22:33,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 198 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) [2021-12-22 16:22:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 221 transitions. [2021-12-22 16:22:33,534 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 221 transitions. Word has length 6 [2021-12-22 16:22:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:33,534 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 221 transitions. [2021-12-22 16:22:33,535 INFO L471 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) [2021-12-22 16:22:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 221 transitions. [2021-12-22 16:22:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 16:22:33,535 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:33,535 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:33,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 16:22:33,536 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:33,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:33,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777177, now seen corresponding path program 1 times [2021-12-22 16:22:33,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:33,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125534691] [2021-12-22 16:22:33,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:33,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:33,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:33,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125534691] [2021-12-22 16:22:33,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125534691] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:33,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:33,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:22:33,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476739239] [2021-12-22 16:22:33,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:33,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:22:33,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:33,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:22:33,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:22:33,585 INFO L87 Difference]: Start difference. First operand 199 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) [2021-12-22 16:22:33,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:33,761 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2021-12-22 16:22:33,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:22:33,762 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 [2021-12-22 16:22:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:33,763 INFO L225 Difference]: With dead ends: 198 [2021-12-22 16:22:33,763 INFO L226 Difference]: Without dead ends: 198 [2021-12-22 16:22:33,763 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:33,764 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 4 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:33,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 535 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:33,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-22 16:22:33,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-12-22 16:22:33,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.6541353383458646) internal successors, (220), 197 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) [2021-12-22 16:22:33,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 220 transitions. [2021-12-22 16:22:33,771 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 220 transitions. Word has length 12 [2021-12-22 16:22:33,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:33,771 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 220 transitions. [2021-12-22 16:22:33,771 INFO L471 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) [2021-12-22 16:22:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2021-12-22 16:22:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 16:22:33,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:33,772 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:33,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 16:22:33,772 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:33,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:33,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2020777178, now seen corresponding path program 1 times [2021-12-22 16:22:33,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:33,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468915249] [2021-12-22 16:22:33,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:33,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:33,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:33,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468915249] [2021-12-22 16:22:33,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468915249] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:33,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:33,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:22:33,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694039739] [2021-12-22 16:22:33,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:33,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:22:33,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:33,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:22:33,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:22:33,836 INFO L87 Difference]: Start difference. First operand 198 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) [2021-12-22 16:22:34,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:34,061 INFO L93 Difference]: Finished difference Result 197 states and 219 transitions. [2021-12-22 16:22:34,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:22:34,061 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 [2021-12-22 16:22:34,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:34,062 INFO L225 Difference]: With dead ends: 197 [2021-12-22 16:22:34,062 INFO L226 Difference]: Without dead ends: 197 [2021-12-22 16:22:34,062 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:34,063 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 2 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:34,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 546 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:34,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-22 16:22:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-12-22 16:22:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 133 states have (on average 1.6466165413533835) internal successors, (219), 196 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) [2021-12-22 16:22:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 219 transitions. [2021-12-22 16:22:34,078 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 219 transitions. Word has length 12 [2021-12-22 16:22:34,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:34,078 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 219 transitions. [2021-12-22 16:22:34,078 INFO L471 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) [2021-12-22 16:22:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2021-12-22 16:22:34,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-22 16:22:34,079 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:34,079 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:34,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 16:22:34,079 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:34,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:34,080 INFO L85 PathProgramCache]: Analyzing trace with hash 373192235, now seen corresponding path program 1 times [2021-12-22 16:22:34,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:34,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981318748] [2021-12-22 16:22:34,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:34,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:34,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:34,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981318748] [2021-12-22 16:22:34,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981318748] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:34,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:34,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:22:34,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016540332] [2021-12-22 16:22:34,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:34,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:22:34,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:34,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:22:34,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:22:34,134 INFO L87 Difference]: Start difference. First operand 197 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) [2021-12-22 16:22:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:34,141 INFO L93 Difference]: Finished difference Result 198 states and 220 transitions. [2021-12-22 16:22:34,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:22:34,141 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 [2021-12-22 16:22:34,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:34,142 INFO L225 Difference]: With dead ends: 198 [2021-12-22 16:22:34,142 INFO L226 Difference]: Without dead ends: 198 [2021-12-22 16:22:34,143 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:34,143 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 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 [2021-12-22 16:22:34,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:22:34,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-22 16:22:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-12-22 16:22:34,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 197 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) [2021-12-22 16:22:34,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 220 transitions. [2021-12-22 16:22:34,148 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 220 transitions. Word has length 14 [2021-12-22 16:22:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:34,148 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 220 transitions. [2021-12-22 16:22:34,148 INFO L471 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) [2021-12-22 16:22:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 220 transitions. [2021-12-22 16:22:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 16:22:34,149 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:34,149 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:34,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 16:22:34,149 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:34,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:34,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692102, now seen corresponding path program 1 times [2021-12-22 16:22:34,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:34,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974007582] [2021-12-22 16:22:34,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:34,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:34,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:34,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974007582] [2021-12-22 16:22:34,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974007582] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:34,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:34,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 16:22:34,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83342145] [2021-12-22 16:22:34,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:34,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 16:22:34,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:34,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 16:22:34,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:22:34,236 INFO L87 Difference]: Start difference. First operand 198 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) [2021-12-22 16:22:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:34,580 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2021-12-22 16:22:34,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 16:22:34,581 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 [2021-12-22 16:22:34,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:34,581 INFO L225 Difference]: With dead ends: 198 [2021-12-22 16:22:34,581 INFO L226 Difference]: Without dead ends: 198 [2021-12-22 16:22:34,582 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:34,583 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 172 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:34,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 669 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:22:34,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-22 16:22:34,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2021-12-22 16:22:34,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.6343283582089552) internal successors, (219), 196 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) [2021-12-22 16:22:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 219 transitions. [2021-12-22 16:22:34,587 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 219 transitions. Word has length 15 [2021-12-22 16:22:34,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:34,588 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 219 transitions. [2021-12-22 16:22:34,588 INFO L471 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) [2021-12-22 16:22:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 219 transitions. [2021-12-22 16:22:34,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 16:22:34,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:34,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:34,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 16:22:34,589 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:34,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:34,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1583692101, now seen corresponding path program 1 times [2021-12-22 16:22:34,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:34,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922234545] [2021-12-22 16:22:34,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:34,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:34,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:34,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:34,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922234545] [2021-12-22 16:22:34,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922234545] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:34,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:34,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 16:22:34,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940262175] [2021-12-22 16:22:34,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:34,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 16:22:34,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:34,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 16:22:34,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-22 16:22:34,712 INFO L87 Difference]: Start difference. First operand 197 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) [2021-12-22 16:22:34,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:34,976 INFO L93 Difference]: Finished difference Result 197 states and 218 transitions. [2021-12-22 16:22:34,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 16:22:34,977 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 [2021-12-22 16:22:34,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:34,977 INFO L225 Difference]: With dead ends: 197 [2021-12-22 16:22:34,977 INFO L226 Difference]: Without dead ends: 197 [2021-12-22 16:22:34,978 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:34,978 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 171 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:34,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 397 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-22 16:22:34,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2021-12-22 16:22:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 134 states have (on average 1.626865671641791) internal successors, (218), 195 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) [2021-12-22 16:22:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 218 transitions. [2021-12-22 16:22:34,981 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 218 transitions. Word has length 15 [2021-12-22 16:22:34,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:34,981 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 218 transitions. [2021-12-22 16:22:34,982 INFO L471 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) [2021-12-22 16:22:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 218 transitions. [2021-12-22 16:22:34,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-22 16:22:34,982 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:34,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:34,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 16:22:34,982 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:34,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:34,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2137878992, now seen corresponding path program 1 times [2021-12-22 16:22:34,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:34,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811683490] [2021-12-22 16:22:34,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:34,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:35,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:35,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811683490] [2021-12-22 16:22:35,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811683490] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:35,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:35,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 16:22:35,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688078185] [2021-12-22 16:22:35,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:35,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:22:35,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:35,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:22:35,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:22:35,042 INFO L87 Difference]: Start difference. First operand 196 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) [2021-12-22 16:22:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:35,214 INFO L93 Difference]: Finished difference Result 283 states and 311 transitions. [2021-12-22 16:22:35,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 16:22:35,214 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 [2021-12-22 16:22:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:35,216 INFO L225 Difference]: With dead ends: 283 [2021-12-22 16:22:35,216 INFO L226 Difference]: Without dead ends: 283 [2021-12-22 16:22:35,216 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:35,219 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 195 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:35,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 649 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-12-22 16:22:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 193. [2021-12-22 16:22:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 132 states have (on average 1.628787878787879) internal successors, (215), 192 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 215 transitions. [2021-12-22 16:22:35,225 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 215 transitions. Word has length 16 [2021-12-22 16:22:35,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:35,225 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 215 transitions. [2021-12-22 16:22:35,225 INFO L471 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) [2021-12-22 16:22:35,226 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 215 transitions. [2021-12-22 16:22:35,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-22 16:22:35,227 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:35,228 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:35,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 16:22:35,228 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:35,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:35,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1339025717, now seen corresponding path program 1 times [2021-12-22 16:22:35,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:35,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924329407] [2021-12-22 16:22:35,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:35,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:35,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:35,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924329407] [2021-12-22 16:22:35,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924329407] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:35,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:35,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:22:35,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369077580] [2021-12-22 16:22:35,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:35,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:22:35,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:35,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:22:35,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:22:35,277 INFO L87 Difference]: Start difference. First operand 193 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) [2021-12-22 16:22:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:35,367 INFO L93 Difference]: Finished difference Result 284 states and 311 transitions. [2021-12-22 16:22:35,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:22:35,368 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 [2021-12-22 16:22:35,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:35,369 INFO L225 Difference]: With dead ends: 284 [2021-12-22 16:22:35,369 INFO L226 Difference]: Without dead ends: 284 [2021-12-22 16:22:35,369 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:35,370 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 100 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:35,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 611 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:35,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-12-22 16:22:35,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 196. [2021-12-22 16:22:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 135 states have (on average 1.614814814814815) internal successors, (218), 195 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) [2021-12-22 16:22:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 218 transitions. [2021-12-22 16:22:35,373 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 218 transitions. Word has length 18 [2021-12-22 16:22:35,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:35,373 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 218 transitions. [2021-12-22 16:22:35,373 INFO L471 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) [2021-12-22 16:22:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 218 transitions. [2021-12-22 16:22:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 16:22:35,374 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:35,374 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:35,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 16:22:35,374 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:35,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:35,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802310, now seen corresponding path program 1 times [2021-12-22 16:22:35,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:35,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049013597] [2021-12-22 16:22:35,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:35,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:35,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:35,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049013597] [2021-12-22 16:22:35,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049013597] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:35,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:35,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:22:35,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645384794] [2021-12-22 16:22:35,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:35,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:22:35,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:35,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:22:35,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:22:35,443 INFO L87 Difference]: Start difference. First operand 196 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) [2021-12-22 16:22:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:35,593 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2021-12-22 16:22:35,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:22:35,594 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 [2021-12-22 16:22:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:35,595 INFO L225 Difference]: With dead ends: 191 [2021-12-22 16:22:35,595 INFO L226 Difference]: Without dead ends: 191 [2021-12-22 16:22:35,595 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:35,596 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 257 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:35,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 115 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:35,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-22 16:22:35,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 186. [2021-12-22 16:22:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 185 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 16:22:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2021-12-22 16:22:35,600 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 20 [2021-12-22 16:22:35,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:35,600 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2021-12-22 16:22:35,600 INFO L471 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) [2021-12-22 16:22:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2021-12-22 16:22:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 16:22:35,601 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:35,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:35,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 16:22:35,602 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:35,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:35,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1029802309, now seen corresponding path program 1 times [2021-12-22 16:22:35,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:35,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414157550] [2021-12-22 16:22:35,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:35,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:35,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:35,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:35,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414157550] [2021-12-22 16:22:35,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414157550] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:35,720 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:35,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:22:35,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670163998] [2021-12-22 16:22:35,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:35,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:22:35,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:35,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:22:35,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:22:35,721 INFO L87 Difference]: Start difference. First operand 186 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) [2021-12-22 16:22:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:35,997 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2021-12-22 16:22:35,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 16:22:35,998 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 [2021-12-22 16:22:35,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:35,999 INFO L225 Difference]: With dead ends: 247 [2021-12-22 16:22:35,999 INFO L226 Difference]: Without dead ends: 247 [2021-12-22 16:22:35,999 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:36,000 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 449 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:36,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 254 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-12-22 16:22:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 210. [2021-12-22 16:22:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 161 states have (on average 1.5279503105590062) internal successors, (246), 209 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) [2021-12-22 16:22:36,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 246 transitions. [2021-12-22 16:22:36,003 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 246 transitions. Word has length 20 [2021-12-22 16:22:36,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:36,004 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 246 transitions. [2021-12-22 16:22:36,004 INFO L471 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) [2021-12-22 16:22:36,004 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 246 transitions. [2021-12-22 16:22:36,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-22 16:22:36,004 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:36,004 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 16:22:36,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 16:22:36,005 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:36,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:36,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1797484881, now seen corresponding path program 1 times [2021-12-22 16:22:36,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:36,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072975212] [2021-12-22 16:22:36,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:36,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:36,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:36,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:36,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072975212] [2021-12-22 16:22:36,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072975212] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:36,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:36,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:22:36,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872383702] [2021-12-22 16:22:36,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:36,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 16:22:36,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:36,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 16:22:36,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 16:22:36,076 INFO L87 Difference]: Start difference. First operand 210 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) [2021-12-22 16:22:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:36,185 INFO L93 Difference]: Finished difference Result 242 states and 256 transitions. [2021-12-22 16:22:36,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 16:22:36,186 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 [2021-12-22 16:22:36,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:36,187 INFO L225 Difference]: With dead ends: 242 [2021-12-22 16:22:36,187 INFO L226 Difference]: Without dead ends: 242 [2021-12-22 16:22:36,187 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:36,187 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 233 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:36,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 271 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:36,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-12-22 16:22:36,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 208. [2021-12-22 16:22:36,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 160 states have (on average 1.51875) internal successors, (243), 207 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) [2021-12-22 16:22:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 243 transitions. [2021-12-22 16:22:36,190 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 243 transitions. Word has length 22 [2021-12-22 16:22:36,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:36,190 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 243 transitions. [2021-12-22 16:22:36,191 INFO L471 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) [2021-12-22 16:22:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 243 transitions. [2021-12-22 16:22:36,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-22 16:22:36,191 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:36,191 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:36,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 16:22:36,191 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:36,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:36,192 INFO L85 PathProgramCache]: Analyzing trace with hash 110847663, now seen corresponding path program 1 times [2021-12-22 16:22:36,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:36,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101912777] [2021-12-22 16:22:36,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:36,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:36,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:36,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101912777] [2021-12-22 16:22:36,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101912777] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:36,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:36,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:22:36,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184062481] [2021-12-22 16:22:36,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:36,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:22:36,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:36,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:22:36,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:22:36,272 INFO L87 Difference]: Start difference. First operand 208 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) [2021-12-22 16:22:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:36,393 INFO L93 Difference]: Finished difference Result 207 states and 241 transitions. [2021-12-22 16:22:36,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:22:36,393 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 [2021-12-22 16:22:36,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:36,394 INFO L225 Difference]: With dead ends: 207 [2021-12-22 16:22:36,394 INFO L226 Difference]: Without dead ends: 207 [2021-12-22 16:22:36,395 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:36,395 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 9 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:36,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 464 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:36,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-12-22 16:22:36,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-12-22 16:22:36,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 160 states have (on average 1.50625) internal successors, (241), 206 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) [2021-12-22 16:22:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2021-12-22 16:22:36,400 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 23 [2021-12-22 16:22:36,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:36,400 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2021-12-22 16:22:36,400 INFO L471 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) [2021-12-22 16:22:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2021-12-22 16:22:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-22 16:22:36,401 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:36,401 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:36,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 16:22:36,401 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:36,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:36,402 INFO L85 PathProgramCache]: Analyzing trace with hash 110847664, now seen corresponding path program 1 times [2021-12-22 16:22:36,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:36,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948088308] [2021-12-22 16:22:36,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:36,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:36,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:36,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948088308] [2021-12-22 16:22:36,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948088308] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:36,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:36,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:22:36,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840370427] [2021-12-22 16:22:36,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:36,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:22:36,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:36,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:22:36,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:22:36,451 INFO L87 Difference]: Start difference. First operand 207 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) [2021-12-22 16:22:36,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:36,587 INFO L93 Difference]: Finished difference Result 206 states and 239 transitions. [2021-12-22 16:22:36,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:22:36,587 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 [2021-12-22 16:22:36,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:36,588 INFO L225 Difference]: With dead ends: 206 [2021-12-22 16:22:36,588 INFO L226 Difference]: Without dead ends: 206 [2021-12-22 16:22:36,589 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:36,589 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:36,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 456 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:36,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-22 16:22:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2021-12-22 16:22:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 160 states have (on average 1.49375) internal successors, (239), 205 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) [2021-12-22 16:22:36,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 239 transitions. [2021-12-22 16:22:36,594 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 239 transitions. Word has length 23 [2021-12-22 16:22:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:36,594 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 239 transitions. [2021-12-22 16:22:36,594 INFO L471 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) [2021-12-22 16:22:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 239 transitions. [2021-12-22 16:22:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 16:22:36,595 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:36,595 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:36,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 16:22:36,596 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:36,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:36,596 INFO L85 PathProgramCache]: Analyzing trace with hash -398547279, now seen corresponding path program 1 times [2021-12-22 16:22:36,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:36,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009172312] [2021-12-22 16:22:36,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:36,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:36,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:36,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009172312] [2021-12-22 16:22:36,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009172312] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:36,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:36,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 16:22:36,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914892847] [2021-12-22 16:22:36,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:36,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:22:36,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:36,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:22:36,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:22:36,685 INFO L87 Difference]: Start difference. First operand 206 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) [2021-12-22 16:22:36,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:36,941 INFO L93 Difference]: Finished difference Result 206 states and 238 transitions. [2021-12-22 16:22:36,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 16:22:36,941 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 [2021-12-22 16:22:36,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:36,942 INFO L225 Difference]: With dead ends: 206 [2021-12-22 16:22:36,942 INFO L226 Difference]: Without dead ends: 206 [2021-12-22 16:22:36,942 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:36,943 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 250 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:36,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 427 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:36,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-22 16:22:36,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2021-12-22 16:22:36,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 160 states have (on average 1.4875) internal successors, (238), 204 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) [2021-12-22 16:22:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 238 transitions. [2021-12-22 16:22:36,946 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 238 transitions. Word has length 27 [2021-12-22 16:22:36,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:36,946 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 238 transitions. [2021-12-22 16:22:36,946 INFO L471 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) [2021-12-22 16:22:36,946 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 238 transitions. [2021-12-22 16:22:36,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 16:22:36,947 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:36,947 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:36,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 16:22:36,947 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:36,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:36,948 INFO L85 PathProgramCache]: Analyzing trace with hash -398547278, now seen corresponding path program 1 times [2021-12-22 16:22:36,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:36,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879080195] [2021-12-22 16:22:36,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:36,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:37,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:37,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879080195] [2021-12-22 16:22:37,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879080195] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:37,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:37,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 16:22:37,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516676050] [2021-12-22 16:22:37,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:37,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 16:22:37,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:37,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 16:22:37,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-22 16:22:37,095 INFO L87 Difference]: Start difference. First operand 205 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) [2021-12-22 16:22:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:37,527 INFO L93 Difference]: Finished difference Result 198 states and 230 transitions. [2021-12-22 16:22:37,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 16:22:37,527 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 [2021-12-22 16:22:37,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:37,529 INFO L225 Difference]: With dead ends: 198 [2021-12-22 16:22:37,529 INFO L226 Difference]: Without dead ends: 198 [2021-12-22 16:22:37,529 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:37,530 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 263 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:37,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 556 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 16:22:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-22 16:22:37,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2021-12-22 16:22:37,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 186 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) [2021-12-22 16:22:37,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 219 transitions. [2021-12-22 16:22:37,534 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 219 transitions. Word has length 27 [2021-12-22 16:22:37,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:37,535 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 219 transitions. [2021-12-22 16:22:37,535 INFO L471 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) [2021-12-22 16:22:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 219 transitions. [2021-12-22 16:22:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-22 16:22:37,536 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:37,536 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:37,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-22 16:22:37,536 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:37,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:37,537 INFO L85 PathProgramCache]: Analyzing trace with hash 329779259, now seen corresponding path program 1 times [2021-12-22 16:22:37,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:37,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756706661] [2021-12-22 16:22:37,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:37,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:37,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:37,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:37,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756706661] [2021-12-22 16:22:37,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756706661] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:37,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:37,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:22:37,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740413075] [2021-12-22 16:22:37,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:37,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:22:37,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:37,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:22:37,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:22:37,570 INFO L87 Difference]: Start difference. First operand 187 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) [2021-12-22 16:22:37,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:37,578 INFO L93 Difference]: Finished difference Result 260 states and 307 transitions. [2021-12-22 16:22:37,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:22:37,579 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 [2021-12-22 16:22:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:37,581 INFO L225 Difference]: With dead ends: 260 [2021-12-22 16:22:37,581 INFO L226 Difference]: Without dead ends: 260 [2021-12-22 16:22:37,581 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:37,582 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 50 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 299 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 [2021-12-22 16:22:37,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 299 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:22:37,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-12-22 16:22:37,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 193. [2021-12-22 16:22:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 158 states have (on average 1.4367088607594938) internal successors, (227), 192 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) [2021-12-22 16:22:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 227 transitions. [2021-12-22 16:22:37,586 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 227 transitions. Word has length 28 [2021-12-22 16:22:37,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:37,586 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 227 transitions. [2021-12-22 16:22:37,587 INFO L471 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) [2021-12-22 16:22:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 227 transitions. [2021-12-22 16:22:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-22 16:22:37,587 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:37,587 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:37,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-22 16:22:37,588 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:37,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:37,588 INFO L85 PathProgramCache]: Analyzing trace with hash -751842895, now seen corresponding path program 1 times [2021-12-22 16:22:37,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:37,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519823328] [2021-12-22 16:22:37,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:37,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:37,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:37,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519823328] [2021-12-22 16:22:37,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519823328] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:37,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:37,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 16:22:37,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075299902] [2021-12-22 16:22:37,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:37,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 16:22:37,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:37,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 16:22:37,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-22 16:22:37,671 INFO L87 Difference]: Start difference. First operand 193 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) [2021-12-22 16:22:37,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:37,769 INFO L93 Difference]: Finished difference Result 193 states and 228 transitions. [2021-12-22 16:22:37,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 16:22:37,769 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 [2021-12-22 16:22:37,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:37,770 INFO L225 Difference]: With dead ends: 193 [2021-12-22 16:22:37,771 INFO L226 Difference]: Without dead ends: 193 [2021-12-22 16:22:37,771 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:37,771 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 347 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:37,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 226 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-12-22 16:22:37,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2021-12-22 16:22:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 156 states have (on average 1.4294871794871795) internal successors, (223), 188 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) [2021-12-22 16:22:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 223 transitions. [2021-12-22 16:22:37,776 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 223 transitions. Word has length 29 [2021-12-22 16:22:37,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:37,776 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 223 transitions. [2021-12-22 16:22:37,776 INFO L471 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) [2021-12-22 16:22:37,776 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 223 transitions. [2021-12-22 16:22:37,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-22 16:22:37,778 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:37,778 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:37,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-22 16:22:37,778 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:37,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:37,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1633211075, now seen corresponding path program 1 times [2021-12-22 16:22:37,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:37,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812653261] [2021-12-22 16:22:37,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:37,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:37,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:37,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812653261] [2021-12-22 16:22:37,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812653261] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:37,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:37,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:22:37,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244075296] [2021-12-22 16:22:37,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:37,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:22:37,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:37,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:22:37,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:22:37,816 INFO L87 Difference]: Start difference. First operand 189 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) [2021-12-22 16:22:37,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:37,829 INFO L93 Difference]: Finished difference Result 187 states and 220 transitions. [2021-12-22 16:22:37,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:22:37,830 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 [2021-12-22 16:22:37,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:37,830 INFO L225 Difference]: With dead ends: 187 [2021-12-22 16:22:37,831 INFO L226 Difference]: Without dead ends: 187 [2021-12-22 16:22:37,831 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:37,832 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 20 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 262 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 [2021-12-22 16:22:37,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 262 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:22:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-12-22 16:22:37,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2021-12-22 16:22:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 155 states have (on average 1.4193548387096775) internal successors, (220), 186 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) [2021-12-22 16:22:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 220 transitions. [2021-12-22 16:22:37,841 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 220 transitions. Word has length 29 [2021-12-22 16:22:37,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:37,841 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 220 transitions. [2021-12-22 16:22:37,841 INFO L471 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) [2021-12-22 16:22:37,842 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 220 transitions. [2021-12-22 16:22:37,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 16:22:37,843 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:37,843 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:37,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-22 16:22:37,844 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:37,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:37,844 INFO L85 PathProgramCache]: Analyzing trace with hash -910059888, now seen corresponding path program 1 times [2021-12-22 16:22:37,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:37,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579257442] [2021-12-22 16:22:37,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:37,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:37,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:37,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579257442] [2021-12-22 16:22:37,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579257442] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:37,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:37,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 16:22:37,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132930335] [2021-12-22 16:22:37,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:37,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 16:22:37,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:37,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 16:22:37,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-22 16:22:37,968 INFO L87 Difference]: Start difference. First operand 187 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) [2021-12-22 16:22:38,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:38,256 INFO L93 Difference]: Finished difference Result 290 states and 320 transitions. [2021-12-22 16:22:38,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 16:22:38,257 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 [2021-12-22 16:22:38,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:38,258 INFO L225 Difference]: With dead ends: 290 [2021-12-22 16:22:38,258 INFO L226 Difference]: Without dead ends: 290 [2021-12-22 16:22:38,259 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:38,259 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 377 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:38,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 804 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 16:22:38,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-12-22 16:22:38,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 199. [2021-12-22 16:22:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 167 states have (on average 1.3952095808383234) internal successors, (233), 198 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) [2021-12-22 16:22:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 233 transitions. [2021-12-22 16:22:38,264 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 233 transitions. Word has length 30 [2021-12-22 16:22:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:38,264 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 233 transitions. [2021-12-22 16:22:38,264 INFO L471 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) [2021-12-22 16:22:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2021-12-22 16:22:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-22 16:22:38,265 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:38,265 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:38,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-22 16:22:38,265 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:38,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:38,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2071508259, now seen corresponding path program 1 times [2021-12-22 16:22:38,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:38,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913716001] [2021-12-22 16:22:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:38,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:38,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:38,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913716001] [2021-12-22 16:22:38,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913716001] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 16:22:38,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314773886] [2021-12-22 16:22:38,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:38,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 16:22:38,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 16:22:38,339 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) [2021-12-22 16:22:38,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 16:22:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:38,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-22 16:22:38,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 16:22:38,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:22:38,563 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 16:22:38,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:22:38,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 16:22:38,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:22:38,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 16:22:38,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:22:38,673 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 16:22:38,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 16:22:38,681 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-22 16:22:38,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:22:38,883 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 16:22:38,894 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 16:22:38,895 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 16:22:38,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2021-12-22 16:22:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:38,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 16:22:39,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2021-12-22 16:22:39,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-22 16:22:39,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2021-12-22 16:22:39,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-22 16:22:39,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:39,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314773886] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 16:22:39,622 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 16:22:39,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-12-22 16:22:39,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079812530] [2021-12-22 16:22:39,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 16:22:39,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 16:22:39,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:39,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 16:22:39,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:22:39,624 INFO L87 Difference]: Start difference. First operand 199 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) [2021-12-22 16:22:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:39,871 INFO L93 Difference]: Finished difference Result 286 states and 316 transitions. [2021-12-22 16:22:39,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 16:22:39,872 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 [2021-12-22 16:22:39,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:39,873 INFO L225 Difference]: With dead ends: 286 [2021-12-22 16:22:39,873 INFO L226 Difference]: Without dead ends: 286 [2021-12-22 16:22:39,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-22 16:22:39,874 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 481 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:39,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [481 Valid, 739 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 305 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2021-12-22 16:22:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-12-22 16:22:39,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 227. [2021-12-22 16:22:39,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 195 states have (on average 1.405128205128205) internal successors, (274), 226 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) [2021-12-22 16:22:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 274 transitions. [2021-12-22 16:22:39,879 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 274 transitions. Word has length 32 [2021-12-22 16:22:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:39,879 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 274 transitions. [2021-12-22 16:22:39,879 INFO L471 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) [2021-12-22 16:22:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 274 transitions. [2021-12-22 16:22:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 16:22:39,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:39,880 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:39,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 16:22:40,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-22 16:22:40,084 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:40,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:40,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921825, now seen corresponding path program 1 times [2021-12-22 16:22:40,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:40,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864711013] [2021-12-22 16:22:40,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:40,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:40,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:40,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:40,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864711013] [2021-12-22 16:22:40,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864711013] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:40,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:40,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 16:22:40,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476402875] [2021-12-22 16:22:40,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:40,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 16:22:40,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:40,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 16:22:40,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-22 16:22:40,189 INFO L87 Difference]: Start difference. First operand 227 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) [2021-12-22 16:22:40,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:40,676 INFO L93 Difference]: Finished difference Result 334 states and 372 transitions. [2021-12-22 16:22:40,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 16:22:40,677 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 [2021-12-22 16:22:40,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:40,677 INFO L225 Difference]: With dead ends: 334 [2021-12-22 16:22:40,677 INFO L226 Difference]: Without dead ends: 334 [2021-12-22 16:22:40,678 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:40,678 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 387 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:40,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 919 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 16:22:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2021-12-22 16:22:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 228. [2021-12-22 16:22:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 198 states have (on average 1.3737373737373737) internal successors, (272), 227 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) [2021-12-22 16:22:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 272 transitions. [2021-12-22 16:22:40,682 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 272 transitions. Word has length 35 [2021-12-22 16:22:40,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:40,682 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 272 transitions. [2021-12-22 16:22:40,682 INFO L471 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) [2021-12-22 16:22:40,682 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 272 transitions. [2021-12-22 16:22:40,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 16:22:40,682 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:40,682 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:40,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-22 16:22:40,683 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:40,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:40,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1393921826, now seen corresponding path program 1 times [2021-12-22 16:22:40,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:40,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941294438] [2021-12-22 16:22:40,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:40,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:40,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:40,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941294438] [2021-12-22 16:22:40,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941294438] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:40,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:40,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 16:22:40,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773363863] [2021-12-22 16:22:40,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:40,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 16:22:40,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:40,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 16:22:40,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-12-22 16:22:40,947 INFO L87 Difference]: Start difference. First operand 228 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) [2021-12-22 16:22:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:41,793 INFO L93 Difference]: Finished difference Result 400 states and 432 transitions. [2021-12-22 16:22:41,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-22 16:22:41,794 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 [2021-12-22 16:22:41,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:41,795 INFO L225 Difference]: With dead ends: 400 [2021-12-22 16:22:41,795 INFO L226 Difference]: Without dead ends: 400 [2021-12-22 16:22:41,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2021-12-22 16:22:41,796 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 580 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:41,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [580 Valid, 990 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-22 16:22:41,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-12-22 16:22:41,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 234. [2021-12-22 16:22:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.3676470588235294) internal successors, (279), 233 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) [2021-12-22 16:22:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2021-12-22 16:22:41,800 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 35 [2021-12-22 16:22:41,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:41,800 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2021-12-22 16:22:41,800 INFO L471 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) [2021-12-22 16:22:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2021-12-22 16:22:41,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 16:22:41,801 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:41,801 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:41,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-22 16:22:41,801 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:41,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:41,802 INFO L85 PathProgramCache]: Analyzing trace with hash -470914463, now seen corresponding path program 1 times [2021-12-22 16:22:41,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:41,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359362839] [2021-12-22 16:22:41,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:41,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:42,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:42,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359362839] [2021-12-22 16:22:42,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359362839] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:42,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:42,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-22 16:22:42,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095615756] [2021-12-22 16:22:42,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:42,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 16:22:42,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:42,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 16:22:42,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-12-22 16:22:42,168 INFO L87 Difference]: Start difference. First operand 234 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) [2021-12-22 16:22:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:43,093 INFO L93 Difference]: Finished difference Result 331 states and 362 transitions. [2021-12-22 16:22:43,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-22 16:22:43,094 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 [2021-12-22 16:22:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:43,096 INFO L225 Difference]: With dead ends: 331 [2021-12-22 16:22:43,096 INFO L226 Difference]: Without dead ends: 331 [2021-12-22 16:22:43,096 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:43,097 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 565 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:43,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 1078 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 16:22:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-12-22 16:22:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 234. [2021-12-22 16:22:43,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 233 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) [2021-12-22 16:22:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 278 transitions. [2021-12-22 16:22:43,101 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 278 transitions. Word has length 37 [2021-12-22 16:22:43,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:43,101 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 278 transitions. [2021-12-22 16:22:43,101 INFO L471 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) [2021-12-22 16:22:43,101 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 278 transitions. [2021-12-22 16:22:43,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 16:22:43,102 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:43,102 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:43,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-22 16:22:43,102 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:43,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:43,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362969, now seen corresponding path program 1 times [2021-12-22 16:22:43,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:43,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567410801] [2021-12-22 16:22:43,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:43,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:43,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:43,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567410801] [2021-12-22 16:22:43,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567410801] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:43,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:43,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:22:43,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869122059] [2021-12-22 16:22:43,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:43,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:22:43,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:43,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:22:43,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:22:43,138 INFO L87 Difference]: Start difference. First operand 234 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) [2021-12-22 16:22:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:43,244 INFO L93 Difference]: Finished difference Result 233 states and 277 transitions. [2021-12-22 16:22:43,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:22:43,245 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 [2021-12-22 16:22:43,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:43,246 INFO L225 Difference]: With dead ends: 233 [2021-12-22 16:22:43,246 INFO L226 Difference]: Without dead ends: 233 [2021-12-22 16:22:43,246 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:43,246 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 4 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:43,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 413 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:43,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-12-22 16:22:43,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-12-22 16:22:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 204 states have (on average 1.357843137254902) internal successors, (277), 232 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) [2021-12-22 16:22:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 277 transitions. [2021-12-22 16:22:43,249 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 277 transitions. Word has length 37 [2021-12-22 16:22:43,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:43,249 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 277 transitions. [2021-12-22 16:22:43,249 INFO L471 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) [2021-12-22 16:22:43,249 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 277 transitions. [2021-12-22 16:22:43,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 16:22:43,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:43,250 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:43,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-22 16:22:43,250 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:43,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:43,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2012362968, now seen corresponding path program 1 times [2021-12-22 16:22:43,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:43,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905538073] [2021-12-22 16:22:43,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:43,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:43,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:43,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905538073] [2021-12-22 16:22:43,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905538073] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:43,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:43,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 16:22:43,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148151037] [2021-12-22 16:22:43,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:43,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 16:22:43,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:43,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 16:22:43,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 16:22:43,306 INFO L87 Difference]: Start difference. First operand 233 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) [2021-12-22 16:22:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:43,424 INFO L93 Difference]: Finished difference Result 232 states and 276 transitions. [2021-12-22 16:22:43,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 16:22:43,425 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 [2021-12-22 16:22:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:43,426 INFO L225 Difference]: With dead ends: 232 [2021-12-22 16:22:43,426 INFO L226 Difference]: Without dead ends: 232 [2021-12-22 16:22:43,426 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:43,426 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 2 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:43,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 410 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-22 16:22:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2021-12-22 16:22:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 204 states have (on average 1.3529411764705883) internal successors, (276), 231 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) [2021-12-22 16:22:43,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 276 transitions. [2021-12-22 16:22:43,433 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 276 transitions. Word has length 37 [2021-12-22 16:22:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:43,433 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 276 transitions. [2021-12-22 16:22:43,433 INFO L471 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) [2021-12-22 16:22:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 276 transitions. [2021-12-22 16:22:43,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 16:22:43,434 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:43,434 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:43,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-22 16:22:43,434 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:43,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:43,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1939172976, now seen corresponding path program 1 times [2021-12-22 16:22:43,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:43,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310502662] [2021-12-22 16:22:43,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:43,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 16:22:43,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:43,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310502662] [2021-12-22 16:22:43,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310502662] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:43,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:43,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 16:22:43,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485596248] [2021-12-22 16:22:43,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:43,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 16:22:43,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:43,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 16:22:43,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 16:22:43,494 INFO L87 Difference]: Start difference. First operand 232 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) [2021-12-22 16:22:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:43,676 INFO L93 Difference]: Finished difference Result 248 states and 292 transitions. [2021-12-22 16:22:43,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 16:22:43,677 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 [2021-12-22 16:22:43,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:43,677 INFO L225 Difference]: With dead ends: 248 [2021-12-22 16:22:43,678 INFO L226 Difference]: Without dead ends: 248 [2021-12-22 16:22:43,678 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:43,678 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 49 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:43,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 621 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 16:22:43,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-12-22 16:22:43,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 241. [2021-12-22 16:22:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 213 states have (on average 1.3380281690140845) internal successors, (285), 240 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) [2021-12-22 16:22:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 285 transitions. [2021-12-22 16:22:43,681 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 285 transitions. Word has length 37 [2021-12-22 16:22:43,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:43,682 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 285 transitions. [2021-12-22 16:22:43,682 INFO L471 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) [2021-12-22 16:22:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 285 transitions. [2021-12-22 16:22:43,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-22 16:22:43,682 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:43,682 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:43,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-22 16:22:43,683 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:43,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:43,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1413983143, now seen corresponding path program 1 times [2021-12-22 16:22:43,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:43,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109368154] [2021-12-22 16:22:43,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:43,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 16:22:43,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:43,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109368154] [2021-12-22 16:22:43,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109368154] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:43,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:43,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 16:22:43,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207301183] [2021-12-22 16:22:43,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:43,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:22:43,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:43,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:22:43,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:22:43,714 INFO L87 Difference]: Start difference. First operand 241 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) [2021-12-22 16:22:43,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:43,720 INFO L93 Difference]: Finished difference Result 242 states and 286 transitions. [2021-12-22 16:22:43,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:22:43,720 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 [2021-12-22 16:22:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:43,721 INFO L225 Difference]: With dead ends: 242 [2021-12-22 16:22:43,721 INFO L226 Difference]: Without dead ends: 242 [2021-12-22 16:22:43,721 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:43,722 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 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 [2021-12-22 16:22:43,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:22:43,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-12-22 16:22:43,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-12-22 16:22:43,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 214 states have (on average 1.3364485981308412) internal successors, (286), 241 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) [2021-12-22 16:22:43,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 286 transitions. [2021-12-22 16:22:43,725 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 286 transitions. Word has length 39 [2021-12-22 16:22:43,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:43,725 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 286 transitions. [2021-12-22 16:22:43,725 INFO L471 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) [2021-12-22 16:22:43,725 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 286 transitions. [2021-12-22 16:22:43,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-22 16:22:43,727 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:43,727 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:43,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-22 16:22:43,727 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:43,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:43,727 INFO L85 PathProgramCache]: Analyzing trace with hash -407701739, now seen corresponding path program 1 times [2021-12-22 16:22:43,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:43,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586565627] [2021-12-22 16:22:43,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:43,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 16:22:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 16:22:43,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 16:22:43,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586565627] [2021-12-22 16:22:43,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586565627] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 16:22:43,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 16:22:43,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 16:22:43,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635749254] [2021-12-22 16:22:43,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 16:22:43,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 16:22:43,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 16:22:43,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 16:22:43,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 16:22:43,761 INFO L87 Difference]: Start difference. First operand 242 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) [2021-12-22 16:22:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 16:22:43,788 INFO L93 Difference]: Finished difference Result 255 states and 290 transitions. [2021-12-22 16:22:43,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 16:22:43,789 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 [2021-12-22 16:22:43,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 16:22:43,789 INFO L225 Difference]: With dead ends: 255 [2021-12-22 16:22:43,790 INFO L226 Difference]: Without dead ends: 255 [2021-12-22 16:22:43,790 INFO L932 BasicCegarLoop]: 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 [2021-12-22 16:22:43,791 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 98 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 16:22:43,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 151 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 16:22:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-12-22 16:22:43,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 243. [2021-12-22 16:22:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 215 states have (on average 1.3348837209302327) internal successors, (287), 242 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) [2021-12-22 16:22:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 287 transitions. [2021-12-22 16:22:43,794 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 287 transitions. Word has length 39 [2021-12-22 16:22:43,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 16:22:43,795 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 287 transitions. [2021-12-22 16:22:43,795 INFO L471 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) [2021-12-22 16:22:43,795 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 287 transitions. [2021-12-22 16:22:43,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-22 16:22:43,795 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 16:22:43,795 INFO L514 BasicCegarLoop]: 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] [2021-12-22 16:22:43,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-22 16:22:43,796 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 80 more)] === [2021-12-22 16:22:43,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 16:22:43,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1645380794, now seen corresponding path program 1 times [2021-12-22 16:22:43,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 16:22:43,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563170183] [2021-12-22 16:22:43,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 16:22:43,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 16:22:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 16:22:43,812 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 16:22:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 16:22:43,841 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 16:22:43,841 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 16:22:43,842 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK (83 of 84 remaining) [2021-12-22 16:22:43,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (82 of 84 remaining) [2021-12-22 16:22:43,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (81 of 84 remaining) [2021-12-22 16:22:43,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (80 of 84 remaining) [2021-12-22 16:22:43,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (79 of 84 remaining) [2021-12-22 16:22:43,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (78 of 84 remaining) [2021-12-22 16:22:43,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (77 of 84 remaining) [2021-12-22 16:22:43,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (76 of 84 remaining) [2021-12-22 16:22:43,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (75 of 84 remaining) [2021-12-22 16:22:43,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (74 of 84 remaining) [2021-12-22 16:22:43,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (73 of 84 remaining) [2021-12-22 16:22:43,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (72 of 84 remaining) [2021-12-22 16:22:43,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (71 of 84 remaining) [2021-12-22 16:22:43,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (70 of 84 remaining) [2021-12-22 16:22:43,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (69 of 84 remaining) [2021-12-22 16:22:43,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (68 of 84 remaining) [2021-12-22 16:22:43,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (67 of 84 remaining) [2021-12-22 16:22:43,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (66 of 84 remaining) [2021-12-22 16:22:43,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (65 of 84 remaining) [2021-12-22 16:22:43,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (64 of 84 remaining) [2021-12-22 16:22:43,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (63 of 84 remaining) [2021-12-22 16:22:43,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (62 of 84 remaining) [2021-12-22 16:22:43,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (61 of 84 remaining) [2021-12-22 16:22:43,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (60 of 84 remaining) [2021-12-22 16:22:43,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (59 of 84 remaining) [2021-12-22 16:22:43,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (58 of 84 remaining) [2021-12-22 16:22:43,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (57 of 84 remaining) [2021-12-22 16:22:43,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (56 of 84 remaining) [2021-12-22 16:22:43,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (55 of 84 remaining) [2021-12-22 16:22:43,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (54 of 84 remaining) [2021-12-22 16:22:43,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (53 of 84 remaining) [2021-12-22 16:22:43,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (52 of 84 remaining) [2021-12-22 16:22:43,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (51 of 84 remaining) [2021-12-22 16:22:43,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK (50 of 84 remaining) [2021-12-22 16:22:43,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (49 of 84 remaining) [2021-12-22 16:22:43,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (48 of 84 remaining) [2021-12-22 16:22:43,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (47 of 84 remaining) [2021-12-22 16:22:43,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (46 of 84 remaining) [2021-12-22 16:22:43,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (45 of 84 remaining) [2021-12-22 16:22:43,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (44 of 84 remaining) [2021-12-22 16:22:43,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (43 of 84 remaining) [2021-12-22 16:22:43,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (42 of 84 remaining) [2021-12-22 16:22:43,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (41 of 84 remaining) [2021-12-22 16:22:43,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (40 of 84 remaining) [2021-12-22 16:22:43,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (39 of 84 remaining) [2021-12-22 16:22:43,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (38 of 84 remaining) [2021-12-22 16:22:43,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (37 of 84 remaining) [2021-12-22 16:22:43,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (36 of 84 remaining) [2021-12-22 16:22:43,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (35 of 84 remaining) [2021-12-22 16:22:43,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (34 of 84 remaining) [2021-12-22 16:22:43,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (33 of 84 remaining) [2021-12-22 16:22:43,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK (32 of 84 remaining) [2021-12-22 16:22:43,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK (31 of 84 remaining) [2021-12-22 16:22:43,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (30 of 84 remaining) [2021-12-22 16:22:43,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION (29 of 84 remaining) [2021-12-22 16:22:43,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (28 of 84 remaining) [2021-12-22 16:22:43,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (27 of 84 remaining) [2021-12-22 16:22:43,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (26 of 84 remaining) [2021-12-22 16:22:43,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_LEAK (25 of 84 remaining) [2021-12-22 16:22:43,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (24 of 84 remaining) [2021-12-22 16:22:43,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION (23 of 84 remaining) [2021-12-22 16:22:43,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION (22 of 84 remaining) [2021-12-22 16:22:43,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION (21 of 84 remaining) [2021-12-22 16:22:43,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK (20 of 84 remaining) [2021-12-22 16:22:43,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION (19 of 84 remaining) [2021-12-22 16:22:43,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION (18 of 84 remaining) [2021-12-22 16:22:43,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION (17 of 84 remaining) [2021-12-22 16:22:43,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION (16 of 84 remaining) [2021-12-22 16:22:43,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_LEAK (15 of 84 remaining) [2021-12-22 16:22:43,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION (14 of 84 remaining) [2021-12-22 16:22:43,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION (13 of 84 remaining) [2021-12-22 16:22:43,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK (12 of 84 remaining) [2021-12-22 16:22:43,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION (11 of 84 remaining) [2021-12-22 16:22:43,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION (10 of 84 remaining) [2021-12-22 16:22:43,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_LEAK (9 of 84 remaining) [2021-12-22 16:22:43,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE (8 of 84 remaining) [2021-12-22 16:22:43,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE (7 of 84 remaining) [2021-12-22 16:22:43,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE (6 of 84 remaining) [2021-12-22 16:22:43,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION (5 of 84 remaining) [2021-12-22 16:22:43,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION (4 of 84 remaining) [2021-12-22 16:22:43,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONMEMORY_FREE (3 of 84 remaining) [2021-12-22 16:22:43,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE (2 of 84 remaining) [2021-12-22 16:22:43,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE (1 of 84 remaining) [2021-12-22 16:22:43,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_LEAK (0 of 84 remaining) [2021-12-22 16:22:43,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-22 16:22:43,859 INFO L732 BasicCegarLoop]: Path program 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] [2021-12-22 16:22:43,861 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 16:22:43,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 04:22:43 BoogieIcfgContainer [2021-12-22 16:22:43,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 16:22:43,904 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 16:22:43,904 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 16:22:43,905 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 16:22:43,905 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:22:32" (3/4) ... [2021-12-22 16:22:43,906 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-22 16:22:43,938 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 16:22:43,938 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 16:22:43,938 INFO L158 Benchmark]: Toolchain (without parser) took 12301.24ms. Allocated memory was 94.4MB in the beginning and 174.1MB in the end (delta: 79.7MB). Free memory was 62.6MB in the beginning and 108.1MB in the end (delta: -45.5MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2021-12-22 16:22:43,941 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 94.4MB. Free memory was 52.3MB in the beginning and 52.3MB in the end (delta: 34.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 16:22:43,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.96ms. Allocated memory was 94.4MB in the beginning and 127.9MB in the end (delta: 33.6MB). Free memory was 62.3MB in the beginning and 95.2MB in the end (delta: -32.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2021-12-22 16:22:43,942 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.73ms. Allocated memory is still 127.9MB. Free memory was 95.2MB in the beginning and 92.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-22 16:22:43,942 INFO L158 Benchmark]: Boogie Preprocessor took 39.41ms. Allocated memory is still 127.9MB. Free memory was 92.6MB in the beginning and 90.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 16:22:43,942 INFO L158 Benchmark]: RCFGBuilder took 498.71ms. Allocated memory is still 127.9MB. Free memory was 90.5MB in the beginning and 64.8MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-12-22 16:22:43,945 INFO L158 Benchmark]: TraceAbstraction took 11284.58ms. Allocated memory was 127.9MB in the beginning and 174.1MB in the end (delta: 46.1MB). Free memory was 64.3MB in the beginning and 110.2MB in the end (delta: -45.9MB). Peak memory consumption was 733.0kB. Max. memory is 16.1GB. [2021-12-22 16:22:43,945 INFO L158 Benchmark]: Witness Printer took 33.81ms. Allocated memory is still 174.1MB. Free memory was 110.2MB in the beginning and 108.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 16:22:43,964 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 94.4MB. Free memory was 52.3MB in the beginning and 52.3MB in the end (delta: 34.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.96ms. Allocated memory was 94.4MB in the beginning and 127.9MB in the end (delta: 33.6MB). Free memory was 62.3MB in the beginning and 95.2MB in the end (delta: -32.9MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.73ms. Allocated memory is still 127.9MB. Free memory was 95.2MB in the beginning and 92.6MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.41ms. Allocated memory is still 127.9MB. Free memory was 92.6MB in the beginning and 90.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 498.71ms. Allocated memory is still 127.9MB. Free memory was 90.5MB in the beginning and 64.8MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11284.58ms. Allocated memory was 127.9MB in the beginning and 174.1MB in the end (delta: 46.1MB). Free memory was 64.3MB in the beginning and 110.2MB in the end (delta: -45.9MB). Peak memory consumption was 733.0kB. Max. memory is 16.1GB. * Witness Printer took 33.81ms. Allocated memory is still 174.1MB. Free memory was 110.2MB in the beginning and 108.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1040]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1003] SLL* list = malloc(sizeof(SLL)); [L1004] list->next = ((void*)0) VAL [list={-1:0}] [L1005] list->prev = ((void*)0) VAL [list={-1:0}] [L1006] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1006] list->inner = malloc(sizeof(SLL)) VAL [list={-1:0}, malloc(sizeof(SLL))={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] list->inner->next = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] list->inner->inner = ((void*)0) VAL [list={-1:0}, list->inner={-2:0}] [L1006] EXPR list->inner VAL [list={-1:0}, list->inner={-2:0}] [L1006] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1] [L1006] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1008] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1022] end = ((void*)0) [L1023] end = list VAL [end={-1:0}, list={-1:0}] [L1026] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1028] COND TRUE ((void*)0) != end [L1030] int len = 0; VAL [end={-1:0}, len=0, list={-1:0}] [L1031] EXPR end->inner VAL [end={-1:0}, end->inner={-2:0}, len=0, list={-1:0}] [L1031] SLL* inner = end->inner; [L1032] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}] [L1034] COND TRUE len == 0 [L1035] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] [L1039] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}] [L1039] COND FALSE !(!(((void*)0) == inner->inner)) [L1040] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}] [L1040] COND TRUE !(((void*)0) != inner->next) [L1040] reach_error() VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}] - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1051]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1055]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1057]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 200 locations, 84 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 31, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5616 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5616 mSDsluCounter, 13981 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 46 IncrementalHoareTripleChecker+Unchecked, 9940 mSDsCounter, 356 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7312 IncrementalHoareTripleChecker+Invalid, 7714 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 356 mSolverCounterUnsat, 4041 mSDtfsCounter, 7312 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=30, InterpolantAutomatonStates: 233, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 919 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 792 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 752 ConstructedInterpolants, 17 QuantifiedInterpolants, 6485 SizeOfPredicates, 9 NumberOfNonLiveVariables, 159 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 32 InterpolantComputations, 29 PerfectInterpolantSequences, 5/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-22 16:22:44,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)