/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:51:02,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:51:02,687 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:51:02,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:51:02,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:51:02,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:51:02,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:51:02,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:51:02,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:51:02,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:51:02,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:51:02,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:51:02,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:51:02,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:51:02,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:51:02,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:51:02,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:51:02,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:51:02,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:51:02,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:51:02,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:51:02,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:51:02,787 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:51:02,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:51:02,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:51:02,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:51:02,792 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:51:02,793 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:51:02,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:51:02,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:51:02,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:51:02,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:51:02,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:51:02,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:51:02,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:51:02,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:51:02,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:51:02,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:51:02,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:51:02,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:51:02,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:51:02,799 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:51:02,824 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:51:02,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:51:02,825 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:51:02,825 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:51:02,825 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:51:02,825 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:51:02,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:51:02,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:51:02,826 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:51:02,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:51:02,827 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:51:02,827 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:51:02,827 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:51:02,827 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:51:02,827 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:51:02,827 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:51:02,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:51:02,827 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:51:02,827 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:51:02,827 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:51:02,828 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:51:02,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:51:02,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:51:02,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:51:02,829 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:51:02,829 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:51:02,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:51:02,829 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:51:02,829 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:51:02,829 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:51:02,829 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 00:51:03,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:51:03,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:51:03,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:51:03,063 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:51:03,065 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:51:03,065 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-2.i [2022-01-10 00:51:03,127 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf4e8627/c11ffc1aef2b416cb7b78e7597578781/FLAG9aaecb946 [2022-01-10 00:51:03,489 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:51:03,490 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i [2022-01-10 00:51:03,500 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf4e8627/c11ffc1aef2b416cb7b78e7597578781/FLAG9aaecb946 [2022-01-10 00:51:03,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf4e8627/c11ffc1aef2b416cb7b78e7597578781 [2022-01-10 00:51:03,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:51:03,858 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:51:03,860 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:51:03,860 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:51:03,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:51:03,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:51:03" (1/1) ... [2022-01-10 00:51:03,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@db5d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:03, skipping insertion in model container [2022-01-10 00:51:03,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:51:03" (1/1) ... [2022-01-10 00:51:03,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:51:03,898 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:51:04,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[22080,22093] [2022-01-10 00:51:04,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[22353,22366] [2022-01-10 00:51:04,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[22587,22600] [2022-01-10 00:51:04,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[22657,22670] [2022-01-10 00:51:04,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[22924,22937] [2022-01-10 00:51:04,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[23032,23045] [2022-01-10 00:51:04,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[23263,23276] [2022-01-10 00:51:04,114 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[23343,23356] [2022-01-10 00:51:04,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[23422,23435] [2022-01-10 00:51:04,115 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[23512,23525] [2022-01-10 00:51:04,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[23690,23703] [2022-01-10 00:51:04,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[23768,23781] [2022-01-10 00:51:04,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[23845,23858] [2022-01-10 00:51:04,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:51:04,129 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:51:04,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[22080,22093] [2022-01-10 00:51:04,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[22353,22366] [2022-01-10 00:51:04,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[22587,22600] [2022-01-10 00:51:04,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[22657,22670] [2022-01-10 00:51:04,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[22924,22937] [2022-01-10 00:51:04,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[23032,23045] [2022-01-10 00:51:04,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[23263,23276] [2022-01-10 00:51:04,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[23343,23356] [2022-01-10 00:51:04,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[23422,23435] [2022-01-10 00:51:04,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[23512,23525] [2022-01-10 00:51:04,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[23690,23703] [2022-01-10 00:51:04,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[23768,23781] [2022-01-10 00:51:04,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i[23845,23858] [2022-01-10 00:51:04,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:51:04,199 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:51:04,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:04 WrapperNode [2022-01-10 00:51:04,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:51:04,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:51:04,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:51:04,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:51:04,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:04" (1/1) ... [2022-01-10 00:51:04,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:04" (1/1) ... [2022-01-10 00:51:04,232 INFO L137 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 225 [2022-01-10 00:51:04,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:51:04,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:51:04,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:51:04,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:51:04,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:04" (1/1) ... [2022-01-10 00:51:04,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:04" (1/1) ... [2022-01-10 00:51:04,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:04" (1/1) ... [2022-01-10 00:51:04,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:04" (1/1) ... [2022-01-10 00:51:04,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:04" (1/1) ... [2022-01-10 00:51:04,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:04" (1/1) ... [2022-01-10 00:51:04,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:04" (1/1) ... [2022-01-10 00:51:04,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:51:04,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:51:04,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:51:04,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:51:04,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:04" (1/1) ... [2022-01-10 00:51:04,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:51:04,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:51:04,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 00:51:04,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 00:51:04,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 00:51:04,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:51:04,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 00:51:04,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 00:51:04,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 00:51:04,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:51:04,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:51:04,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:51:04,420 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:51:04,421 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:51:04,694 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:51:04,699 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:51:04,699 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-01-10 00:51:04,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:04 BoogieIcfgContainer [2022-01-10 00:51:04,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:51:04,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:51:04,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:51:04,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:51:04,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:51:03" (1/3) ... [2022-01-10 00:51:04,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241fffc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:51:04, skipping insertion in model container [2022-01-10 00:51:04,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:51:04" (2/3) ... [2022-01-10 00:51:04,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@241fffc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:51:04, skipping insertion in model container [2022-01-10 00:51:04,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:51:04" (3/3) ... [2022-01-10 00:51:04,706 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2022-01-10 00:51:04,709 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:51:04,709 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-01-10 00:51:04,741 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:51:04,745 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 [2022-01-10 00:51:04,745 INFO L340 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-01-10 00:51:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:04,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-01-10 00:51:04,758 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:04,758 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-01-10 00:51:04,758 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:04,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:04,762 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2022-01-10 00:51:04,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:04,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885191481] [2022-01-10 00:51:04,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:04,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:04,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:04,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885191481] [2022-01-10 00:51:04,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885191481] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:04,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:04,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:51:04,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192237923] [2022-01-10 00:51:04,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:04,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:51:04,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:04,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:51:04,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:51:04,933 INFO L87 Difference]: Start difference. First operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 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, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:04,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:04,994 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2022-01-10 00:51:04,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:51:04,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-01-10 00:51:04,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:05,002 INFO L225 Difference]: With dead ends: 180 [2022-01-10 00:51:05,002 INFO L226 Difference]: Without dead ends: 95 [2022-01-10 00:51:05,005 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 [2022-01-10 00:51:05,008 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 83 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:05,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 100 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-01-10 00:51:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2022-01-10 00:51:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.323076923076923) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-01-10 00:51:05,044 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2022-01-10 00:51:05,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:05,047 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-01-10 00:51:05,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,048 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-01-10 00:51:05,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 00:51:05,048 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:05,048 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:05,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:51:05,050 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:05,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:05,052 INFO L85 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2022-01-10 00:51:05,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:05,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475751793] [2022-01-10 00:51:05,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:05,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:05,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:05,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475751793] [2022-01-10 00:51:05,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475751793] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:05,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:05,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:51:05,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787525093] [2022-01-10 00:51:05,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:05,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:51:05,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:05,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:51:05,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:51:05,113 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:05,138 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-01-10 00:51:05,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:51:05,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-01-10 00:51:05,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:05,141 INFO L225 Difference]: With dead ends: 80 [2022-01-10 00:51:05,141 INFO L226 Difference]: Without dead ends: 78 [2022-01-10 00:51:05,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 [2022-01-10 00:51:05,144 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:05,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-10 00:51:05,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-01-10 00:51:05,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 77 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2022-01-10 00:51:05,149 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2022-01-10 00:51:05,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:05,149 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2022-01-10 00:51:05,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,149 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2022-01-10 00:51:05,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 00:51:05,150 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:05,150 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:05,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:51:05,150 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:05,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:05,151 INFO L85 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2022-01-10 00:51:05,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:05,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322786132] [2022-01-10 00:51:05,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:05,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:05,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:05,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322786132] [2022-01-10 00:51:05,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322786132] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:05,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:05,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:51:05,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44303626] [2022-01-10 00:51:05,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:05,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:51:05,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:05,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:51:05,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:51:05,228 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:05,275 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-01-10 00:51:05,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:51:05,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-01-10 00:51:05,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:05,276 INFO L225 Difference]: With dead ends: 80 [2022-01-10 00:51:05,276 INFO L226 Difference]: Without dead ends: 78 [2022-01-10 00:51:05,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:51:05,277 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:05,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-10 00:51:05,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2022-01-10 00:51:05,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.3125) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-01-10 00:51:05,281 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2022-01-10 00:51:05,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:05,282 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-01-10 00:51:05,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,282 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-01-10 00:51:05,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 00:51:05,282 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:05,282 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:05,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:51:05,283 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:05,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:05,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2022-01-10 00:51:05,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:05,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685574175] [2022-01-10 00:51:05,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:05,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:05,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:05,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685574175] [2022-01-10 00:51:05,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685574175] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:05,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:05,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:51:05,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331355503] [2022-01-10 00:51:05,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:05,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:51:05,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:05,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:51:05,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:51:05,338 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:05,440 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2022-01-10 00:51:05,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:51:05,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 00:51:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:05,442 INFO L225 Difference]: With dead ends: 195 [2022-01-10 00:51:05,443 INFO L226 Difference]: Without dead ends: 128 [2022-01-10 00:51:05,443 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 [2022-01-10 00:51:05,446 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 54 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:05,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 196 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:05,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-01-10 00:51:05,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 77. [2022-01-10 00:51:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.303030303030303) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-01-10 00:51:05,459 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 15 [2022-01-10 00:51:05,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:05,459 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-01-10 00:51:05,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-01-10 00:51:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 00:51:05,460 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:05,460 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:05,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 00:51:05,460 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:05,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:05,461 INFO L85 PathProgramCache]: Analyzing trace with hash 903272487, now seen corresponding path program 1 times [2022-01-10 00:51:05,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:05,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334608440] [2022-01-10 00:51:05,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:05,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:05,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:05,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334608440] [2022-01-10 00:51:05,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334608440] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:05,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:05,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:51:05,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879836771] [2022-01-10 00:51:05,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:05,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:51:05,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:05,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:51:05,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:51:05,585 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:05,660 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2022-01-10 00:51:05,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:51:05,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 00:51:05,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:05,661 INFO L225 Difference]: With dead ends: 122 [2022-01-10 00:51:05,661 INFO L226 Difference]: Without dead ends: 118 [2022-01-10 00:51:05,661 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 [2022-01-10 00:51:05,662 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 147 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:05,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 157 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:05,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-01-10 00:51:05,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 73. [2022-01-10 00:51:05,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.28125) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2022-01-10 00:51:05,666 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 15 [2022-01-10 00:51:05,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:05,666 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2022-01-10 00:51:05,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2022-01-10 00:51:05,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 00:51:05,667 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:05,667 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:05,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 00:51:05,667 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:05,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:05,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2022-01-10 00:51:05,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:05,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998153652] [2022-01-10 00:51:05,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:05,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:05,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:05,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:05,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998153652] [2022-01-10 00:51:05,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998153652] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:05,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:05,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:51:05,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182965833] [2022-01-10 00:51:05,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:05,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:51:05,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:05,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:51:05,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:51:05,736 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) [2022-01-10 00:51:05,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:05,785 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2022-01-10 00:51:05,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:51:05,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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 [2022-01-10 00:51:05,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:05,786 INFO L225 Difference]: With dead ends: 132 [2022-01-10 00:51:05,786 INFO L226 Difference]: Without dead ends: 112 [2022-01-10 00:51:05,786 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 [2022-01-10 00:51:05,789 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 128 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:05,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 114 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-01-10 00:51:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2022-01-10 00:51:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.265625) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2022-01-10 00:51:05,794 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2022-01-10 00:51:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:05,794 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2022-01-10 00:51:05,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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) [2022-01-10 00:51:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-01-10 00:51:05,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 00:51:05,794 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:05,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] [2022-01-10 00:51:05,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 00:51:05,795 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:05,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:05,795 INFO L85 PathProgramCache]: Analyzing trace with hash -940628212, now seen corresponding path program 1 times [2022-01-10 00:51:05,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:05,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364199374] [2022-01-10 00:51:05,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:05,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:05,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:05,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364199374] [2022-01-10 00:51:05,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364199374] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:05,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:05,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:51:05,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377303378] [2022-01-10 00:51:05,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:05,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:51:05,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:05,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:51:05,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:51:05,831 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:05,843 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-01-10 00:51:05,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:51:05,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-01-10 00:51:05,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:05,844 INFO L225 Difference]: With dead ends: 137 [2022-01-10 00:51:05,844 INFO L226 Difference]: Without dead ends: 96 [2022-01-10 00:51:05,845 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 [2022-01-10 00:51:05,846 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 24 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 149 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 [2022-01-10 00:51:05,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-01-10 00:51:05,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2022-01-10 00:51:05,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-01-10 00:51:05,859 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2022-01-10 00:51:05,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:05,860 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-01-10 00:51:05,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-01-10 00:51:05,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 00:51:05,860 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:05,860 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] [2022-01-10 00:51:05,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 00:51:05,861 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:05,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:05,862 INFO L85 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2022-01-10 00:51:05,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:05,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786534488] [2022-01-10 00:51:05,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:05,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:05,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:05,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786534488] [2022-01-10 00:51:05,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786534488] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:05,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:05,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:51:05,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459019501] [2022-01-10 00:51:05,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:05,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:51:05,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:05,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:51:05,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:51:05,911 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:05,920 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2022-01-10 00:51:05,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:51:05,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-01-10 00:51:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:05,921 INFO L225 Difference]: With dead ends: 75 [2022-01-10 00:51:05,921 INFO L226 Difference]: Without dead ends: 73 [2022-01-10 00:51:05,922 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 [2022-01-10 00:51:05,922 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:05,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 129 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:05,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-10 00:51:05,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-01-10 00:51:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-01-10 00:51:05,925 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2022-01-10 00:51:05,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:05,925 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-01-10 00:51:05,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:05,926 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-01-10 00:51:05,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 00:51:05,926 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:05,926 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] [2022-01-10 00:51:05,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 00:51:05,926 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:05,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:05,927 INFO L85 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2022-01-10 00:51:05,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:05,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25838807] [2022-01-10 00:51:05,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:05,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:05,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:05,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25838807] [2022-01-10 00:51:05,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25838807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:05,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:05,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:51:05,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329403709] [2022-01-10 00:51:05,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:05,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:51:05,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:05,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:51:05,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:51:05,972 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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) [2022-01-10 00:51:06,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:06,009 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2022-01-10 00:51:06,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:51:06,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 [2022-01-10 00:51:06,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:06,010 INFO L225 Difference]: With dead ends: 74 [2022-01-10 00:51:06,010 INFO L226 Difference]: Without dead ends: 72 [2022-01-10 00:51:06,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:51:06,011 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:06,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:06,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-10 00:51:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-01-10 00:51:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-01-10 00:51:06,014 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2022-01-10 00:51:06,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:06,014 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-01-10 00:51:06,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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) [2022-01-10 00:51:06,014 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-01-10 00:51:06,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 00:51:06,015 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:06,015 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] [2022-01-10 00:51:06,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 00:51:06,015 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:06,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:06,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2022-01-10 00:51:06,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:06,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538060873] [2022-01-10 00:51:06,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:06,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:06,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:06,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538060873] [2022-01-10 00:51:06,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538060873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:06,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:06,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 00:51:06,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601222504] [2022-01-10 00:51:06,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:06,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 00:51:06,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:06,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 00:51:06,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:51:06,072 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:06,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:06,206 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2022-01-10 00:51:06,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 00:51:06,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-10 00:51:06,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:06,207 INFO L225 Difference]: With dead ends: 175 [2022-01-10 00:51:06,207 INFO L226 Difference]: Without dead ends: 133 [2022-01-10 00:51:06,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:51:06,208 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 113 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:06,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 278 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:06,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-01-10 00:51:06,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2022-01-10 00:51:06,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2022-01-10 00:51:06,211 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 24 [2022-01-10 00:51:06,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:06,211 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2022-01-10 00:51:06,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-01-10 00:51:06,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 00:51:06,212 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:06,212 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] [2022-01-10 00:51:06,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 00:51:06,212 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:06,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:06,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2022-01-10 00:51:06,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:06,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562221171] [2022-01-10 00:51:06,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:06,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:06,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:06,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562221171] [2022-01-10 00:51:06,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562221171] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:06,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:06,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 00:51:06,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257653635] [2022-01-10 00:51:06,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:06,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 00:51:06,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:06,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 00:51:06,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:51:06,434 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:06,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:06,732 INFO L93 Difference]: Finished difference Result 232 states and 257 transitions. [2022-01-10 00:51:06,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 00:51:06,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-10 00:51:06,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:06,735 INFO L225 Difference]: With dead ends: 232 [2022-01-10 00:51:06,735 INFO L226 Difference]: Without dead ends: 230 [2022-01-10 00:51:06,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-01-10 00:51:06,735 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 242 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:06,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 419 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 00:51:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-01-10 00:51:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 93. [2022-01-10 00:51:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 92 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:06,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2022-01-10 00:51:06,741 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 24 [2022-01-10 00:51:06,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:06,742 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2022-01-10 00:51:06,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:06,742 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2022-01-10 00:51:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 00:51:06,742 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:06,742 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] [2022-01-10 00:51:06,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 00:51:06,743 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:06,743 INFO L85 PathProgramCache]: Analyzing trace with hash 680714775, now seen corresponding path program 1 times [2022-01-10 00:51:06,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:06,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127171215] [2022-01-10 00:51:06,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:06,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:51:06,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:06,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127171215] [2022-01-10 00:51:06,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127171215] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:06,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:06,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:51:06,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956905942] [2022-01-10 00:51:06,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:06,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:51:06,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:06,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:51:06,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:51:06,784 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:06,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:06,854 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2022-01-10 00:51:06,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 00:51:06,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-10 00:51:06,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:06,855 INFO L225 Difference]: With dead ends: 140 [2022-01-10 00:51:06,855 INFO L226 Difference]: Without dead ends: 122 [2022-01-10 00:51:06,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:51:06,856 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 57 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:06,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 185 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:06,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-01-10 00:51:06,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2022-01-10 00:51:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 112 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2022-01-10 00:51:06,861 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 26 [2022-01-10 00:51:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:06,862 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2022-01-10 00:51:06,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2022-01-10 00:51:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 00:51:06,862 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:06,862 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] [2022-01-10 00:51:06,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 00:51:06,863 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:06,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:06,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1502606953, now seen corresponding path program 1 times [2022-01-10 00:51:06,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:06,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9801933] [2022-01-10 00:51:06,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:06,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:51:06,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:06,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9801933] [2022-01-10 00:51:06,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9801933] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:06,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:06,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:51:06,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669722858] [2022-01-10 00:51:06,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:06,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:51:06,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:06,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:51:06,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:51:06,918 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:06,946 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2022-01-10 00:51:06,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:51:06,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-10 00:51:06,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:06,947 INFO L225 Difference]: With dead ends: 114 [2022-01-10 00:51:06,947 INFO L226 Difference]: Without dead ends: 112 [2022-01-10 00:51:06,947 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 [2022-01-10 00:51:06,947 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 50 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:06,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 77 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-01-10 00:51:06,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2022-01-10 00:51:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 110 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2022-01-10 00:51:06,953 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 26 [2022-01-10 00:51:06,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:06,953 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2022-01-10 00:51:06,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:06,953 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2022-01-10 00:51:06,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 00:51:06,954 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:06,954 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] [2022-01-10 00:51:06,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 00:51:06,954 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:06,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:06,955 INFO L85 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2022-01-10 00:51:06,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:06,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690296375] [2022-01-10 00:51:06,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:06,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:07,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:07,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690296375] [2022-01-10 00:51:07,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690296375] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:07,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:07,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 00:51:07,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238844127] [2022-01-10 00:51:07,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:07,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 00:51:07,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:07,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 00:51:07,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:51:07,050 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:07,301 INFO L93 Difference]: Finished difference Result 266 states and 306 transitions. [2022-01-10 00:51:07,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 00:51:07,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 00:51:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:07,303 INFO L225 Difference]: With dead ends: 266 [2022-01-10 00:51:07,303 INFO L226 Difference]: Without dead ends: 264 [2022-01-10 00:51:07,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-01-10 00:51:07,303 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 247 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:07,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 381 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 00:51:07,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-01-10 00:51:07,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 114. [2022-01-10 00:51:07,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 113 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2022-01-10 00:51:07,311 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 27 [2022-01-10 00:51:07,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:07,311 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2022-01-10 00:51:07,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2022-01-10 00:51:07,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 00:51:07,311 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:07,312 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] [2022-01-10 00:51:07,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 00:51:07,312 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:07,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:07,312 INFO L85 PathProgramCache]: Analyzing trace with hash -937634650, now seen corresponding path program 1 times [2022-01-10 00:51:07,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:07,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18215751] [2022-01-10 00:51:07,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:07,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:07,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:07,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18215751] [2022-01-10 00:51:07,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18215751] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:51:07,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233883230] [2022-01-10 00:51:07,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:07,373 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:07,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:51:07,376 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) [2022-01-10 00:51:07,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 00:51:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:07,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-10 00:51:07,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:51:07,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:07,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-01-10 00:51:07,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:07,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-01-10 00:51:07,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:07,644 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 [2022-01-10 00:51:07,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:07,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 [2022-01-10 00:51:07,818 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 15 treesize of output 7 [2022-01-10 00:51:07,821 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 15 treesize of output 7 [2022-01-10 00:51:07,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:07,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:51:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:07,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233883230] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:51:07,950 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:51:07,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-01-10 00:51:07,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623554068] [2022-01-10 00:51:07,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:51:07,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 00:51:07,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:07,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 00:51:07,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:51:07,951 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:08,075 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2022-01-10 00:51:08,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 00:51:08,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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 [2022-01-10 00:51:08,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:08,076 INFO L225 Difference]: With dead ends: 201 [2022-01-10 00:51:08,076 INFO L226 Difference]: Without dead ends: 141 [2022-01-10 00:51:08,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:51:08,076 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 105 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:08,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 206 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-01-10 00:51:08,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2022-01-10 00:51:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 115 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2022-01-10 00:51:08,082 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 29 [2022-01-10 00:51:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:08,082 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2022-01-10 00:51:08,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2022-01-10 00:51:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 00:51:08,083 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:08,083 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] [2022-01-10 00:51:08,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 00:51:08,299 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,SelfDestructingSolverStorable14 [2022-01-10 00:51:08,300 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:08,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:08,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2010394174, now seen corresponding path program 1 times [2022-01-10 00:51:08,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:08,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079362857] [2022-01-10 00:51:08,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:08,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:51:08,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:08,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079362857] [2022-01-10 00:51:08,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079362857] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:08,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:08,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 00:51:08,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635941983] [2022-01-10 00:51:08,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:08,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 00:51:08,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:08,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 00:51:08,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:51:08,418 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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) [2022-01-10 00:51:08,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:08,600 INFO L93 Difference]: Finished difference Result 178 states and 198 transitions. [2022-01-10 00:51:08,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 00:51:08,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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 [2022-01-10 00:51:08,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:08,601 INFO L225 Difference]: With dead ends: 178 [2022-01-10 00:51:08,601 INFO L226 Difference]: Without dead ends: 176 [2022-01-10 00:51:08,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 00:51:08,602 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 141 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:08,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 259 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-01-10 00:51:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 122. [2022-01-10 00:51:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.205128205128205) internal successors, (141), 121 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2022-01-10 00:51:08,608 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 29 [2022-01-10 00:51:08,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:08,608 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2022-01-10 00:51:08,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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) [2022-01-10 00:51:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2022-01-10 00:51:08,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 00:51:08,608 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:08,608 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] [2022-01-10 00:51:08,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 00:51:08,609 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:08,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:08,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1521997910, now seen corresponding path program 1 times [2022-01-10 00:51:08,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:08,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306226798] [2022-01-10 00:51:08,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:08,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:08,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:08,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:08,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306226798] [2022-01-10 00:51:08,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306226798] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:08,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:08,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:51:08,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687812720] [2022-01-10 00:51:08,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:08,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:51:08,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:08,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:51:08,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:51:08,639 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:08,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:08,650 INFO L93 Difference]: Finished difference Result 239 states and 280 transitions. [2022-01-10 00:51:08,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:51:08,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-01-10 00:51:08,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:08,651 INFO L225 Difference]: With dead ends: 239 [2022-01-10 00:51:08,651 INFO L226 Difference]: Without dead ends: 178 [2022-01-10 00:51:08,652 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 [2022-01-10 00:51:08,652 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:08,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 164 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-01-10 00:51:08,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 144. [2022-01-10 00:51:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.2158273381294964) internal successors, (169), 143 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2022-01-10 00:51:08,658 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 31 [2022-01-10 00:51:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:08,659 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2022-01-10 00:51:08,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2022-01-10 00:51:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 00:51:08,659 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:08,659 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] [2022-01-10 00:51:08,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 00:51:08,659 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:08,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:08,660 INFO L85 PathProgramCache]: Analyzing trace with hash 914215427, now seen corresponding path program 1 times [2022-01-10 00:51:08,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:08,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198959114] [2022-01-10 00:51:08,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:08,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:08,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:08,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198959114] [2022-01-10 00:51:08,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198959114] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:51:08,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583957553] [2022-01-10 00:51:08,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:08,722 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:08,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:51:08,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:51:08,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 00:51:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:08,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-10 00:51:08,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:51:08,844 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-01-10 00:51:08,844 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 1 case distinctions, treesize of input 16 treesize of output 17 [2022-01-10 00:51:08,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:08,848 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-01-10 00:51:08,876 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-01-10 00:51:08,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-01-10 00:51:08,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:08,882 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 [2022-01-10 00:51:08,953 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 15 treesize of output 7 [2022-01-10 00:51:08,955 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 15 treesize of output 7 [2022-01-10 00:51:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:51:08,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:51:09,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:51:09,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583957553] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:51:09,082 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:51:09,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2022-01-10 00:51:09,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748200034] [2022-01-10 00:51:09,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:51:09,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 00:51:09,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:09,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 00:51:09,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:51:09,083 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:09,258 INFO L93 Difference]: Finished difference Result 254 states and 291 transitions. [2022-01-10 00:51:09,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 00:51:09,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-10 00:51:09,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:09,259 INFO L225 Difference]: With dead ends: 254 [2022-01-10 00:51:09,259 INFO L226 Difference]: Without dead ends: 222 [2022-01-10 00:51:09,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:51:09,260 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 94 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:09,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 283 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:09,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-01-10 00:51:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 171. [2022-01-10 00:51:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.2349397590361446) internal successors, (205), 170 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:09,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2022-01-10 00:51:09,267 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 32 [2022-01-10 00:51:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:09,267 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2022-01-10 00:51:09,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2022-01-10 00:51:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 00:51:09,268 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:09,268 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] [2022-01-10 00:51:09,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 00:51:09,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-10 00:51:09,485 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:09,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1670306697, now seen corresponding path program 1 times [2022-01-10 00:51:09,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:09,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643790375] [2022-01-10 00:51:09,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:09,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:51:09,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:09,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643790375] [2022-01-10 00:51:09,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643790375] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:09,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:09,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 00:51:09,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114013694] [2022-01-10 00:51:09,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:09,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 00:51:09,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:09,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 00:51:09,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:51:09,587 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:09,724 INFO L93 Difference]: Finished difference Result 203 states and 234 transitions. [2022-01-10 00:51:09,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 00:51:09,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-10 00:51:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:09,725 INFO L225 Difference]: With dead ends: 203 [2022-01-10 00:51:09,725 INFO L226 Difference]: Without dead ends: 188 [2022-01-10 00:51:09,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 00:51:09,726 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 136 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:09,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 199 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:09,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-01-10 00:51:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 161. [2022-01-10 00:51:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 156 states have (on average 1.2307692307692308) internal successors, (192), 160 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 192 transitions. [2022-01-10 00:51:09,732 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 192 transitions. Word has length 32 [2022-01-10 00:51:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:09,732 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 192 transitions. [2022-01-10 00:51:09,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 192 transitions. [2022-01-10 00:51:09,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 00:51:09,733 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:09,733 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:51:09,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 00:51:09,733 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:09,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:09,733 INFO L85 PathProgramCache]: Analyzing trace with hash 191981961, now seen corresponding path program 1 times [2022-01-10 00:51:09,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:09,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890902607] [2022-01-10 00:51:09,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:09,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:09,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:09,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890902607] [2022-01-10 00:51:09,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890902607] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:09,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:09,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 00:51:09,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093614486] [2022-01-10 00:51:09,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:09,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:51:09,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:09,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:51:09,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:51:09,775 INFO L87 Difference]: Start difference. First operand 161 states and 192 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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) [2022-01-10 00:51:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:09,830 INFO L93 Difference]: Finished difference Result 223 states and 263 transitions. [2022-01-10 00:51:09,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:51:09,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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 [2022-01-10 00:51:09,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:09,831 INFO L225 Difference]: With dead ends: 223 [2022-01-10 00:51:09,831 INFO L226 Difference]: Without dead ends: 97 [2022-01-10 00:51:09,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 00:51:09,831 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 23 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:09,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 187 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:51:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-01-10 00:51:09,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2022-01-10 00:51:09,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 91 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2022-01-10 00:51:09,835 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 35 [2022-01-10 00:51:09,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:09,835 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2022-01-10 00:51:09,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 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) [2022-01-10 00:51:09,836 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2022-01-10 00:51:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 00:51:09,836 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:09,836 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, 1, 1, 1, 1] [2022-01-10 00:51:09,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 00:51:09,836 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:09,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2022-01-10 00:51:09,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:09,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656570023] [2022-01-10 00:51:09,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:09,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:09,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:09,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656570023] [2022-01-10 00:51:09,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656570023] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:51:09,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329414505] [2022-01-10 00:51:09,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:09,939 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:09,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:51:09,940 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:51:09,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 00:51:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:10,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-10 00:51:10,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:51:10,066 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 00:51:10,084 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 13 treesize of output 9 [2022-01-10 00:51:10,088 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 13 treesize of output 9 [2022-01-10 00:51:10,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:10,183 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2022-01-10 00:51:10,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:10,190 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-01-10 00:51:10,203 INFO L353 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-01-10 00:51:10,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 65 [2022-01-10 00:51:10,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:10,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:10,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:10,223 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 30 treesize of output 27 [2022-01-10 00:51:10,227 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 30 treesize of output 28 [2022-01-10 00:51:10,234 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 00:51:10,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-01-10 00:51:10,383 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:51:10,383 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-01-10 00:51:10,389 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 27 treesize of output 27 [2022-01-10 00:51:10,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:10,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-10 00:51:10,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:10,587 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:10,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2022-01-10 00:51:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:10,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:51:10,654 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1357 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1357) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 16)) 0)) (forall ((v_ArrVal_1358 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1358) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 16)) 0))) is different from false [2022-01-10 00:51:10,868 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1356 Int) (|v_ULTIMATE.start_main_~end~0#1.offset_45| Int)) (or (and (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1343 (Array Int Int))) (= 0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_45| 0)) v_ArrVal_1356 v_ArrVal_1343) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_45| v_ArrVal_1356)) v_ArrVal_1356 v_ArrVal_1349) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_45|) v_ArrVal_1357) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 16)))) (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1358 (Array Int Int))) (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_45| v_ArrVal_1356)))) (store (store .cse0 v_ArrVal_1356 v_ArrVal_1348) (select (select (store .cse0 v_ArrVal_1356 v_ArrVal_1349) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_45|) v_ArrVal_1358)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 16))))) (not (= (select |c_#valid| v_ArrVal_1356) 0)) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_45| |c_ULTIMATE.start_main_~list~0#1.offset|)))) is different from false [2022-01-10 00:51:11,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:11,287 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:11,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 103 [2022-01-10 00:51:11,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:11,295 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:11,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 82 [2022-01-10 00:51:11,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:11,303 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:11,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 328 treesize of output 278 [2022-01-10 00:51:11,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:11,311 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:11,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 374 treesize of output 352 [2022-01-10 00:51:11,325 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 166 treesize of output 154 [2022-01-10 00:51:11,330 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 154 treesize of output 150 [2022-01-10 00:51:11,334 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 150 treesize of output 146 [2022-01-10 00:51:11,336 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 146 treesize of output 142 [2022-01-10 00:51:11,340 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 142 treesize of output 126 [2022-01-10 00:51:11,342 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 126 treesize of output 118 [2022-01-10 00:51:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:11,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329414505] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:51:11,411 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:51:11,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-01-10 00:51:11,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087521612] [2022-01-10 00:51:11,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:51:11,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 00:51:11,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:11,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 00:51:11,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=165, Unknown=3, NotChecked=54, Total=272 [2022-01-10 00:51:11,413 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:11,621 INFO L93 Difference]: Finished difference Result 176 states and 200 transitions. [2022-01-10 00:51:11,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 00:51:11,621 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-10 00:51:11,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:11,622 INFO L225 Difference]: With dead ends: 176 [2022-01-10 00:51:11,622 INFO L226 Difference]: Without dead ends: 116 [2022-01-10 00:51:11,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=266, Unknown=3, NotChecked=70, Total=420 [2022-01-10 00:51:11,623 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 45 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:11,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 528 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 158 Unchecked, 0.1s Time] [2022-01-10 00:51:11,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-01-10 00:51:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2022-01-10 00:51:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 109 states have (on average 1.18348623853211) internal successors, (129), 112 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2022-01-10 00:51:11,628 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 36 [2022-01-10 00:51:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:11,628 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2022-01-10 00:51:11,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2022-01-10 00:51:11,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 00:51:11,629 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:11,629 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, 1, 1, 1, 1] [2022-01-10 00:51:11,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-10 00:51:11,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:11,839 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:11,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:11,840 INFO L85 PathProgramCache]: Analyzing trace with hash -431498650, now seen corresponding path program 1 times [2022-01-10 00:51:11,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:11,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051800803] [2022-01-10 00:51:11,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:11,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:11,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:11,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051800803] [2022-01-10 00:51:11,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051800803] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:51:11,900 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:51:11,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 00:51:11,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945325321] [2022-01-10 00:51:11,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:51:11,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 00:51:11,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:51:11,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 00:51:11,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:51:11,901 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:51:12,012 INFO L93 Difference]: Finished difference Result 219 states and 247 transitions. [2022-01-10 00:51:12,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 00:51:12,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-10 00:51:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:51:12,013 INFO L225 Difference]: With dead ends: 219 [2022-01-10 00:51:12,013 INFO L226 Difference]: Without dead ends: 142 [2022-01-10 00:51:12,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-10 00:51:12,014 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 129 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:51:12,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 197 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:51:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-01-10 00:51:12,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 115. [2022-01-10 00:51:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 114 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2022-01-10 00:51:12,019 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 36 [2022-01-10 00:51:12,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:51:12,019 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2022-01-10 00:51:12,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 00:51:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2022-01-10 00:51:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 00:51:12,019 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:51:12,019 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, 1, 1, 1, 1] [2022-01-10 00:51:12,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 00:51:12,019 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 00:51:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:51:12,020 INFO L85 PathProgramCache]: Analyzing trace with hash 589569704, now seen corresponding path program 1 times [2022-01-10 00:51:12,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:51:12,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754650680] [2022-01-10 00:51:12,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:12,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:51:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:12,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:51:12,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754650680] [2022-01-10 00:51:12,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754650680] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:51:12,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255476029] [2022-01-10 00:51:12,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:51:12,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:12,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:51:12,173 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:51:12,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 00:51:12,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:51:12,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 81 conjunts are in the unsatisfiable core [2022-01-10 00:51:12,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:51:12,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 00:51:12,355 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 13 treesize of output 9 [2022-01-10 00:51:12,359 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 13 treesize of output 9 [2022-01-10 00:51:12,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:12,446 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2022-01-10 00:51:12,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:12,452 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-01-10 00:51:12,472 INFO L353 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-01-10 00:51:12,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 73 [2022-01-10 00:51:12,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:12,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:12,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:12,481 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 30 treesize of output 27 [2022-01-10 00:51:12,495 INFO L353 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-01-10 00:51:12,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2022-01-10 00:51:12,499 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 30 treesize of output 28 [2022-01-10 00:51:12,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:12,722 INFO L353 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-01-10 00:51:12,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 87 [2022-01-10 00:51:12,770 INFO L353 Elim1Store]: treesize reduction 118, result has 29.8 percent of original size [2022-01-10 00:51:12,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 210 [2022-01-10 00:51:12,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:12,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 113 [2022-01-10 00:51:12,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:12,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:12,814 INFO L353 Elim1Store]: treesize reduction 70, result has 49.3 percent of original size [2022-01-10 00:51:12,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 169 [2022-01-10 00:51:12,822 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 97 treesize of output 81 [2022-01-10 00:51:12,830 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 97 treesize of output 81 [2022-01-10 00:51:12,851 INFO L353 Elim1Store]: treesize reduction 8, result has 80.5 percent of original size [2022-01-10 00:51:12,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 42 [2022-01-10 00:51:12,940 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:12,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 62 [2022-01-10 00:51:13,041 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:13,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 62 [2022-01-10 00:51:13,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:13,417 INFO L353 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-01-10 00:51:13,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 31 [2022-01-10 00:51:13,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:51:13,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-01-10 00:51:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:51:13,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:51:13,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1883 Int)) (or (not (= (select |c_#valid| v_ArrVal_1883) 0)) (and (forall ((|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1870 (Array Int Int))) (= (select (select (let ((.cse1 (+ 16 |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse1 v_ArrVal_1883)))) (store (store .cse0 v_ArrVal_1883 v_ArrVal_1870) (select (select (store .cse0 v_ArrVal_1883 v_ArrVal_1876) |c_ULTIMATE.start_main_~end~0#1.base|) .cse1) v_ArrVal_1882))) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 16)) 0)) (forall ((v_ArrVal_1889 (Array Int Int)) (|ULTIMATE.start_main_~end~0#1.offset| Int) (v_ArrVal_1874 (Array Int Int)) (v_ArrVal_1871 (Array Int Int))) (= (select (select (let ((.cse2 (+ 16 |ULTIMATE.start_main_~end~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) .cse2 0)) v_ArrVal_1883 v_ArrVal_1889) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse2 v_ArrVal_1883)) v_ArrVal_1883 v_ArrVal_1871) |c_ULTIMATE.start_main_~end~0#1.base|) .cse2) v_ArrVal_1874)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 16)) 0))))) is different from false [2022-01-10 00:51:13,659 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:13,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 219 [2022-01-10 00:51:13,672 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:13,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 219 treesize of output 220 [2022-01-10 00:51:13,698 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 8 treesize of output 4 [2022-01-10 00:51:13,711 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 12 treesize of output 8 [2022-01-10 00:51:13,741 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 8 treesize of output 4 [2022-01-10 00:51:13,756 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 12 treesize of output 8 [2022-01-10 00:51:13,778 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 12 treesize of output 8 [2022-01-10 00:51:13,825 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 12 treesize of output 8 [2022-01-10 00:51:13,849 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 12 treesize of output 8 [2022-01-10 00:51:13,861 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 131 treesize of output 115 [2022-01-10 00:51:13,921 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 8 treesize of output 4 [2022-01-10 00:51:13,937 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 12 treesize of output 8 [2022-01-10 00:51:13,972 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 8 treesize of output 4 [2022-01-10 00:51:13,987 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 12 treesize of output 8 [2022-01-10 00:51:14,013 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 12 treesize of output 8 [2022-01-10 00:51:14,066 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 12 treesize of output 8 [2022-01-10 00:51:14,096 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 12 treesize of output 8 [2022-01-10 00:51:14,111 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 131 treesize of output 115 [2022-01-10 00:51:14,175 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 12 treesize of output 8 [2022-01-10 00:51:14,201 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 131 treesize of output 115 [2022-01-10 00:51:14,386 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 8 treesize of output 4 [2022-01-10 00:51:14,402 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 12 treesize of output 8 [2022-01-10 00:51:14,437 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 8 treesize of output 4 [2022-01-10 00:51:14,453 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 12 treesize of output 8 [2022-01-10 00:51:14,478 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 12 treesize of output 8 [2022-01-10 00:51:14,529 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 12 treesize of output 8 [2022-01-10 00:51:14,555 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 12 treesize of output 8 [2022-01-10 00:51:14,568 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 131 treesize of output 115 [2022-01-10 00:51:14,622 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 12 treesize of output 8 [2022-01-10 00:51:14,645 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 131 treesize of output 115 [2022-01-10 00:51:14,764 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 8 treesize of output 4 [2022-01-10 00:51:14,782 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 12 treesize of output 8 [2022-01-10 00:51:14,853 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 8 treesize of output 4 [2022-01-10 00:51:14,874 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 12 treesize of output 8 [2022-01-10 00:51:14,934 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 12 treesize of output 8 [2022-01-10 00:51:14,957 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 12 treesize of output 8 [2022-01-10 00:51:14,986 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 12 treesize of output 8 [2022-01-10 00:51:15,003 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 131 treesize of output 115 [2022-01-10 00:51:15,072 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 12 treesize of output 8 [2022-01-10 00:51:15,129 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 131 treesize of output 115 [2022-01-10 00:51:15,330 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 8 treesize of output 4 [2022-01-10 00:51:15,349 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 12 treesize of output 8 [2022-01-10 00:51:15,406 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 8 treesize of output 4 [2022-01-10 00:51:15,424 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 12 treesize of output 8 [2022-01-10 00:51:15,477 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 12 treesize of output 8 [2022-01-10 00:51:15,505 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 12 treesize of output 8 [2022-01-10 00:51:15,532 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 12 treesize of output 8 [2022-01-10 00:51:15,544 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 131 treesize of output 115 [2022-01-10 00:51:15,601 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 12 treesize of output 8 [2022-01-10 00:51:15,661 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 131 treesize of output 115 [2022-01-10 00:51:15,820 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 8 treesize of output 4 [2022-01-10 00:51:15,842 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 12 treesize of output 8 [2022-01-10 00:51:15,931 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 8 treesize of output 4 [2022-01-10 00:51:15,956 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 12 treesize of output 8 [2022-01-10 00:51:16,026 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 12 treesize of output 8 [2022-01-10 00:51:16,055 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 12 treesize of output 8 [2022-01-10 00:51:16,088 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 12 treesize of output 8 [2022-01-10 00:51:16,104 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 131 treesize of output 115 [2022-01-10 00:51:16,197 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 12 treesize of output 8 [2022-01-10 00:51:16,275 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 131 treesize of output 115 [2022-01-10 00:51:16,404 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 8 treesize of output 4 [2022-01-10 00:51:16,436 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 12 treesize of output 8 [2022-01-10 00:51:16,492 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 8 treesize of output 4 [2022-01-10 00:51:16,510 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 12 treesize of output 8 [2022-01-10 00:51:16,574 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 12 treesize of output 8 [2022-01-10 00:51:16,596 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 12 treesize of output 8 [2022-01-10 00:51:16,625 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 12 treesize of output 8 [2022-01-10 00:51:16,637 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 131 treesize of output 115 [2022-01-10 00:51:16,698 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 12 treesize of output 8 [2022-01-10 00:51:16,756 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 131 treesize of output 115 [2022-01-10 00:51:16,912 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 8 treesize of output 4 [2022-01-10 00:51:16,933 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 12 treesize of output 8 [2022-01-10 00:51:17,000 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 8 treesize of output 4 [2022-01-10 00:51:17,036 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 12 treesize of output 8 [2022-01-10 00:51:17,098 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 12 treesize of output 8 [2022-01-10 00:51:17,125 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 12 treesize of output 8 [2022-01-10 00:51:17,156 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 12 treesize of output 8 [2022-01-10 00:51:17,169 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 131 treesize of output 115 [2022-01-10 00:51:17,268 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 12 treesize of output 8 [2022-01-10 00:51:17,316 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 131 treesize of output 115 [2022-01-10 00:51:17,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:17,454 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:17,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 261 treesize of output 267 [2022-01-10 00:51:17,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:17,466 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:17,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 267 treesize of output 168 [2022-01-10 00:51:17,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:17,481 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:17,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18164 treesize of output 16154 [2022-01-10 00:51:17,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:51:17,598 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:17,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135770 treesize of output 133600 [2022-01-10 00:51:18,029 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:18,030 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133625 treesize of output 118165 [2022-01-10 00:51:18,423 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:51:18,424 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118173 treesize of output 115301 [2022-01-10 00:51:18,811 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 115301 treesize of output 113793 [2022-01-10 00:51:23,203 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 108327 treesize of output 96807 [2022-01-10 00:51:23,516 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 96807 treesize of output 95367 [2022-01-10 00:51:23,830 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 95367 treesize of output 89607 [2022-01-10 00:51:24,153 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 89607 treesize of output 88695 [2022-01-10 00:51:24,467 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 88695 treesize of output 82975 [2022-01-10 00:51:24,790 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 82975 treesize of output 82719 [2022-01-10 00:51:25,095 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 82719 treesize of output 82655 [2022-01-10 00:51:25,401 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 82655 treesize of output 82143 [2022-01-10 00:51:25,708 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 82143 treesize of output 80811 [2022-01-10 00:51:26,300 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 80811 treesize of output 80379 [2022-01-10 00:51:26,595 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-10 00:51:26,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 00:51:26,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:51:26,812 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-10 00:51:26,816 INFO L158 Benchmark]: Toolchain (without parser) took 22957.83ms. Allocated memory was 194.0MB in the beginning and 701.5MB in the end (delta: 507.5MB). Free memory was 141.7MB in the beginning and 345.1MB in the end (delta: -203.4MB). Peak memory consumption was 410.0MB. Max. memory is 8.0GB. [2022-01-10 00:51:26,816 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 00:51:26,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.60ms. Allocated memory is still 194.0MB. Free memory was 141.5MB in the beginning and 160.9MB in the end (delta: -19.4MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. [2022-01-10 00:51:26,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.46ms. Allocated memory is still 194.0MB. Free memory was 160.9MB in the beginning and 158.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 00:51:26,816 INFO L158 Benchmark]: Boogie Preprocessor took 20.86ms. Allocated memory is still 194.0MB. Free memory was 158.3MB in the beginning and 156.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 00:51:26,816 INFO L158 Benchmark]: RCFGBuilder took 446.67ms. Allocated memory is still 194.0MB. Free memory was 156.2MB in the beginning and 136.2MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-01-10 00:51:26,816 INFO L158 Benchmark]: TraceAbstraction took 22113.71ms. Allocated memory was 194.0MB in the beginning and 701.5MB in the end (delta: 507.5MB). Free memory was 135.7MB in the beginning and 345.1MB in the end (delta: -209.4MB). Peak memory consumption was 403.0MB. Max. memory is 8.0GB. [2022-01-10 00:51:26,817 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.09ms. Allocated memory is still 194.0MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 339.60ms. Allocated memory is still 194.0MB. Free memory was 141.5MB in the beginning and 160.9MB in the end (delta: -19.4MB). Peak memory consumption was 12.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.46ms. Allocated memory is still 194.0MB. Free memory was 160.9MB in the beginning and 158.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.86ms. Allocated memory is still 194.0MB. Free memory was 158.3MB in the beginning and 156.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 446.67ms. Allocated memory is still 194.0MB. Free memory was 156.2MB in the beginning and 136.2MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 22113.71ms. Allocated memory was 194.0MB in the beginning and 701.5MB in the end (delta: 507.5MB). Free memory was 135.7MB in the beginning and 345.1MB in the end (delta: -209.4MB). Peak memory consumption was 403.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-10 00:51:26,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...