/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/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 11:54:04,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 11:54:04,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 11:54:04,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 11:54:04,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 11:54:04,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 11:54:04,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 11:54:04,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 11:54:04,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 11:54:04,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 11:54:04,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 11:54:04,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 11:54:04,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 11:54:04,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 11:54:04,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 11:54:04,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 11:54:04,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 11:54:04,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 11:54:04,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 11:54:04,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 11:54:04,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 11:54:04,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 11:54:04,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 11:54:04,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 11:54:04,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 11:54:04,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 11:54:04,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 11:54:04,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 11:54:04,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 11:54:04,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 11:54:04,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 11:54:04,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 11:54:04,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 11:54:04,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 11:54:04,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 11:54:04,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 11:54:04,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 11:54:04,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 11:54:04,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 11:54:04,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 11:54:04,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 11:54:04,854 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 11:54:04,874 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 11:54:04,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 11:54:04,875 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 11:54:04,875 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 11:54:04,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 11:54:04,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 11:54:04,878 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 11:54:04,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 11:54:04,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 11:54:04,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 11:54:04,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 11:54:04,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 11:54:04,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 11:54:04,879 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 11:54:04,879 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 11:54:04,879 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 11:54:04,880 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 11:54:04,880 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 11:54:04,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 11:54:04,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 11:54:04,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 11:54:04,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:54:04,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 11:54:04,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 11:54:04,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 11:54:04,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 11:54:04,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 11:54:04,882 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 11:54:04,882 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 11:54:04,882 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 11:54:04,882 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 11:54:04,882 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 11:54:04,884 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 11:54:04,884 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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 11:54:05,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 11:54:05,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 11:54:05,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 11:54:05,158 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 11:54:05,171 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 11:54:05,172 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 11:54:05,247 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a1f1663/57ab43c5ea9e41b6984559166a9f0b71/FLAG53dc76505 [2022-01-10 11:54:05,701 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 11:54:05,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i [2022-01-10 11:54:05,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a1f1663/57ab43c5ea9e41b6984559166a9f0b71/FLAG53dc76505 [2022-01-10 11:54:06,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3a1f1663/57ab43c5ea9e41b6984559166a9f0b71 [2022-01-10 11:54:06,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 11:54:06,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 11:54:06,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 11:54:06,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 11:54:06,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 11:54:06,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:54:06" (1/1) ... [2022-01-10 11:54:06,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd10ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:06, skipping insertion in model container [2022-01-10 11:54:06,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:54:06" (1/1) ... [2022-01-10 11:54:06,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 11:54:06,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 11:54:06,307 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 11:54:06,312 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 11:54:06,314 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 11:54:06,314 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 11:54:06,316 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 11:54:06,317 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 11:54:06,318 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 11:54:06,319 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 11:54:06,319 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 11:54:06,320 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 11:54:06,321 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 11:54:06,321 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 11:54:06,322 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 11:54:06,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:54:06,331 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 11:54:06,353 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 11:54:06,355 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 11:54:06,357 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 11:54:06,357 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 11:54:06,359 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 11:54:06,360 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 11:54:06,361 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 11:54:06,362 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 11:54:06,362 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 11:54:06,363 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 11:54:06,364 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 11:54:06,365 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 11:54:06,365 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 11:54:06,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:54:06,385 INFO L208 MainTranslator]: Completed translation [2022-01-10 11:54:06,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:06 WrapperNode [2022-01-10 11:54:06,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 11:54:06,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 11:54:06,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 11:54:06,386 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 11:54:06,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:06" (1/1) ... [2022-01-10 11:54:06,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:06" (1/1) ... [2022-01-10 11:54:06,427 INFO L137 Inliner]: procedures = 120, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 223 [2022-01-10 11:54:06,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 11:54:06,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 11:54:06,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 11:54:06,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 11:54:06,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:06" (1/1) ... [2022-01-10 11:54:06,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:06" (1/1) ... [2022-01-10 11:54:06,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:06" (1/1) ... [2022-01-10 11:54:06,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:06" (1/1) ... [2022-01-10 11:54:06,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:06" (1/1) ... [2022-01-10 11:54:06,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:06" (1/1) ... [2022-01-10 11:54:06,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:06" (1/1) ... [2022-01-10 11:54:06,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 11:54:06,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 11:54:06,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 11:54:06,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 11:54:06,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:06" (1/1) ... [2022-01-10 11:54:06,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:54:06,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:54:06,494 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 11:54:06,552 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 11:54:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 11:54:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 11:54:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 11:54:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 11:54:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 11:54:06,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 11:54:06,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 11:54:06,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 11:54:06,637 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 11:54:06,638 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 11:54:07,060 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 11:54:07,065 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 11:54:07,065 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-01-10 11:54:07,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:54:07 BoogieIcfgContainer [2022-01-10 11:54:07,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 11:54:07,067 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 11:54:07,067 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 11:54:07,068 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 11:54:07,070 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:54:07" (1/1) ... [2022-01-10 11:54:07,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:54:07 BasicIcfg [2022-01-10 11:54:07,134 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 11:54:07,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 11:54:07,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 11:54:07,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 11:54:07,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:54:06" (1/4) ... [2022-01-10 11:54:07,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d53e024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:54:07, skipping insertion in model container [2022-01-10 11:54:07,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:06" (2/4) ... [2022-01-10 11:54:07,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d53e024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:54:07, skipping insertion in model container [2022-01-10 11:54:07,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:54:07" (3/4) ... [2022-01-10 11:54:07,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d53e024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:54:07, skipping insertion in model container [2022-01-10 11:54:07,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:54:07" (4/4) ... [2022-01-10 11:54:07,139 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-01-2.iTransformedIcfg [2022-01-10 11:54:07,142 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 11:54:07,142 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-01-10 11:54:07,171 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 11:54:07,175 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 11:54:07,175 INFO L340 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-01-10 11:54:07,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 states have internal predecessors, (132), 0 states have call successors, (0), 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 11:54:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-01-10 11:54:07,187 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:07,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-01-10 11:54:07,188 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 11:54:07,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:07,191 INFO L85 PathProgramCache]: Analyzing trace with hash 10960166, now seen corresponding path program 1 times [2022-01-10 11:54:07,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:07,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953041490] [2022-01-10 11:54:07,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:07,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:07,333 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 11:54:07,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:07,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953041490] [2022-01-10 11:54:07,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953041490] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:07,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:07,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:07,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866287802] [2022-01-10 11:54:07,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:07,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:07,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:07,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:07,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:07,365 INFO L87 Difference]: Start difference. First operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 states have internal predecessors, (132), 0 states have call successors, (0), 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 11:54:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:07,425 INFO L93 Difference]: Finished difference Result 174 states and 290 transitions. [2022-01-10 11:54:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:07,427 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 11:54:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:07,434 INFO L225 Difference]: With dead ends: 174 [2022-01-10 11:54:07,434 INFO L226 Difference]: Without dead ends: 92 [2022-01-10 11:54:07,437 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 11:54:07,441 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 80 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 97 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 11:54:07,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 97 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:07,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-01-10 11:54:07,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2022-01-10 11:54:07,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 73 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 11:54:07,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-01-10 11:54:07,471 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 4 [2022-01-10 11:54:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:07,472 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-01-10 11:54:07,473 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 11:54:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-01-10 11:54:07,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 11:54:07,473 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:07,473 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:07,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 11:54:07,474 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 11:54:07,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:07,476 INFO L85 PathProgramCache]: Analyzing trace with hash -212488373, now seen corresponding path program 1 times [2022-01-10 11:54:07,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:07,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421244648] [2022-01-10 11:54:07,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:07,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:07,560 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 11:54:07,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:07,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421244648] [2022-01-10 11:54:07,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421244648] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:07,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:07,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:07,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279122548] [2022-01-10 11:54:07,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:07,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:07,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:07,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:07,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:07,569 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 11:54:07,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:07,590 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2022-01-10 11:54:07,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:07,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-01-10 11:54:07,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:07,594 INFO L225 Difference]: With dead ends: 77 [2022-01-10 11:54:07,594 INFO L226 Difference]: Without dead ends: 75 [2022-01-10 11:54:07,594 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 11:54:07,595 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 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 11:54:07,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:07,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-10 11:54:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-01-10 11:54:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.3333333333333333) 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 11:54:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-01-10 11:54:07,607 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 9 [2022-01-10 11:54:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:07,607 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-01-10 11:54:07,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 11:54:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-01-10 11:54:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 11:54:07,608 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:07,608 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:07,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 11:54:07,608 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 11:54:07,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:07,609 INFO L85 PathProgramCache]: Analyzing trace with hash -212487412, now seen corresponding path program 1 times [2022-01-10 11:54:07,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:07,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180441659] [2022-01-10 11:54:07,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:07,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:07,728 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 11:54:07,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:07,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180441659] [2022-01-10 11:54:07,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180441659] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:07,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:07,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:54:07,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388268348] [2022-01-10 11:54:07,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:07,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:54:07,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:07,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:54:07,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:54:07,730 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 11:54:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:07,874 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2022-01-10 11:54:07,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 11:54:07,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-01-10 11:54:07,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:07,877 INFO L225 Difference]: With dead ends: 130 [2022-01-10 11:54:07,877 INFO L226 Difference]: Without dead ends: 128 [2022-01-10 11:54:07,878 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 11:54:07,880 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 53 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:07,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 190 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-01-10 11:54:07,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 77. [2022-01-10 11:54:07,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 76 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 11:54:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2022-01-10 11:54:07,889 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 9 [2022-01-10 11:54:07,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:07,890 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2022-01-10 11:54:07,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 11:54:07,890 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-01-10 11:54:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 11:54:07,890 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:07,890 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:07,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 11:54:07,891 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:07,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:07,891 INFO L85 PathProgramCache]: Analyzing trace with hash -211563891, now seen corresponding path program 1 times [2022-01-10 11:54:07,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:07,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083941189] [2022-01-10 11:54:07,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:07,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:08,042 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 11:54:08,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:08,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083941189] [2022-01-10 11:54:08,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083941189] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:08,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:08,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 11:54:08,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525354527] [2022-01-10 11:54:08,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:08,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 11:54:08,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:08,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 11:54:08,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 11:54:08,050 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 11:54:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:08,208 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-01-10 11:54:08,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 11:54:08,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-01-10 11:54:08,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:08,209 INFO L225 Difference]: With dead ends: 96 [2022-01-10 11:54:08,209 INFO L226 Difference]: Without dead ends: 94 [2022-01-10 11:54:08,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-10 11:54:08,210 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 138 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:08,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 199 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:08,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-01-10 11:54:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 72. [2022-01-10 11:54:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.3278688524590163) 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 11:54:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2022-01-10 11:54:08,214 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 9 [2022-01-10 11:54:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:08,214 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2022-01-10 11:54:08,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 11:54:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-01-10 11:54:08,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 11:54:08,215 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:08,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:08,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 11:54:08,215 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 11:54:08,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:08,215 INFO L85 PathProgramCache]: Analyzing trace with hash -377988359, now seen corresponding path program 1 times [2022-01-10 11:54:08,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:08,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671510866] [2022-01-10 11:54:08,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:08,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:08,309 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 11:54:08,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:08,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671510866] [2022-01-10 11:54:08,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671510866] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:08,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:08,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:54:08,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334685035] [2022-01-10 11:54:08,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:08,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:54:08,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:08,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:54:08,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:54:08,315 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:08,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:08,445 INFO L93 Difference]: Finished difference Result 189 states and 211 transitions. [2022-01-10 11:54:08,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 11:54:08,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 11:54:08,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:08,446 INFO L225 Difference]: With dead ends: 189 [2022-01-10 11:54:08,446 INFO L226 Difference]: Without dead ends: 124 [2022-01-10 11:54:08,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:54:08,447 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 53 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:08,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 180 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-01-10 11:54:08,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 74. [2022-01-10 11:54:08,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 73 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 11:54:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-01-10 11:54:08,455 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 13 [2022-01-10 11:54:08,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:08,455 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-01-10 11:54:08,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-01-10 11:54:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 11:54:08,456 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:08,456 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:08,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 11:54:08,456 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:08,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:08,457 INFO L85 PathProgramCache]: Analyzing trace with hash 509515322, now seen corresponding path program 1 times [2022-01-10 11:54:08,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:08,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254105604] [2022-01-10 11:54:08,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:08,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:08,550 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 11:54:08,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:08,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254105604] [2022-01-10 11:54:08,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254105604] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:08,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:08,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 11:54:08,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242977071] [2022-01-10 11:54:08,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:08,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 11:54:08,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:08,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 11:54:08,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:54:08,552 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:08,661 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2022-01-10 11:54:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 11:54:08,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 11:54:08,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:08,662 INFO L225 Difference]: With dead ends: 118 [2022-01-10 11:54:08,662 INFO L226 Difference]: Without dead ends: 114 [2022-01-10 11:54:08,662 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 11:54:08,663 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 142 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 150 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 11:54:08,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 150 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:08,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-01-10 11:54:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 70. [2022-01-10 11:54:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 69 states have internal predecessors, (79), 0 states have call successors, (0), 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 11:54:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2022-01-10 11:54:08,667 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 13 [2022-01-10 11:54:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:08,667 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2022-01-10 11:54:08,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-01-10 11:54:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 11:54:08,667 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:08,667 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:08,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 11:54:08,668 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:08,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:08,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1384925702, now seen corresponding path program 1 times [2022-01-10 11:54:08,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:08,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053850687] [2022-01-10 11:54:08,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:08,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:08,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 11:54:08,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:08,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053850687] [2022-01-10 11:54:08,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053850687] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:08,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:08,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:54:08,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290659269] [2022-01-10 11:54:08,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:08,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:54:08,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:08,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:54:08,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:54:08,712 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:08,779 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2022-01-10 11:54:08,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 11:54:08,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-10 11:54:08,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:08,780 INFO L225 Difference]: With dead ends: 129 [2022-01-10 11:54:08,780 INFO L226 Difference]: Without dead ends: 109 [2022-01-10 11:54:08,780 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 11:54:08,781 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 125 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 110 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.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:08,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 110 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:08,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-10 11:54:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 69. [2022-01-10 11:54:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.278688524590164) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 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 11:54:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2022-01-10 11:54:08,795 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 14 [2022-01-10 11:54:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:08,795 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2022-01-10 11:54:08,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:08,796 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2022-01-10 11:54:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 11:54:08,796 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:08,796 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:08,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 11:54:08,797 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:08,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:08,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1026437226, now seen corresponding path program 1 times [2022-01-10 11:54:08,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:08,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883377714] [2022-01-10 11:54:08,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:08,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:08,853 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 11:54:08,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:08,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883377714] [2022-01-10 11:54:08,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883377714] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:08,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:08,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:08,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106584066] [2022-01-10 11:54:08,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:08,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:08,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:08,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:08,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:08,856 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:08,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:08,867 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2022-01-10 11:54:08,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:08,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 11:54:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:08,869 INFO L225 Difference]: With dead ends: 134 [2022-01-10 11:54:08,869 INFO L226 Difference]: Without dead ends: 93 [2022-01-10 11:54:08,869 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 11:54:08,870 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 24 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 143 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 11:54:08,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 143 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-01-10 11:54:08,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2022-01-10 11:54:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.28125) internal successors, (82), 71 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 11:54:08,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2022-01-10 11:54:08,880 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 18 [2022-01-10 11:54:08,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:08,881 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2022-01-10 11:54:08,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2022-01-10 11:54:08,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 11:54:08,881 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:08,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:08,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 11:54:08,882 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:08,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:08,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1754750646, now seen corresponding path program 1 times [2022-01-10 11:54:08,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:08,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296730981] [2022-01-10 11:54:08,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:08,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:08,926 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 11:54:08,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:08,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296730981] [2022-01-10 11:54:08,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296730981] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:08,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:08,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:08,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408266100] [2022-01-10 11:54:08,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:08,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:08,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:08,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:08,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:08,928 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 11:54:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:08,945 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2022-01-10 11:54:08,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:08,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-01-10 11:54:08,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:08,946 INFO L225 Difference]: With dead ends: 72 [2022-01-10 11:54:08,946 INFO L226 Difference]: Without dead ends: 70 [2022-01-10 11:54:08,946 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 11:54:08,949 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 13 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 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 11:54:08,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-10 11:54:08,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-01-10 11:54:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 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 11:54:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-01-10 11:54:08,957 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 19 [2022-01-10 11:54:08,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:08,958 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-01-10 11:54:08,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 11:54:08,958 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-01-10 11:54:08,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 11:54:08,958 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:08,958 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 11:54:08,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 11:54:08,959 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:08,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1942473314, now seen corresponding path program 1 times [2022-01-10 11:54:08,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:08,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739601985] [2022-01-10 11:54:08,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:08,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:09,011 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 11:54:09,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:09,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739601985] [2022-01-10 11:54:09,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739601985] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:09,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:09,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:09,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133486699] [2022-01-10 11:54:09,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:09,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:09,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:09,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:09,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:09,013 INFO L87 Difference]: Start difference. First operand 70 states and 80 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 11:54:09,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:09,024 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-01-10 11:54:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:09,024 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 11:54:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:09,025 INFO L225 Difference]: With dead ends: 73 [2022-01-10 11:54:09,025 INFO L226 Difference]: Without dead ends: 71 [2022-01-10 11:54:09,025 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 11:54:09,026 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 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 11:54:09,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-10 11:54:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-01-10 11:54:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.265625) 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 11:54:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-01-10 11:54:09,029 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 20 [2022-01-10 11:54:09,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:09,029 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-01-10 11:54:09,029 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 11:54:09,030 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-01-10 11:54:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 11:54:09,031 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:09,031 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 11:54:09,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 11:54:09,031 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:09,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1942474275, now seen corresponding path program 1 times [2022-01-10 11:54:09,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:09,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676172905] [2022-01-10 11:54:09,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:09,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:09,108 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 11:54:09,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:09,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676172905] [2022-01-10 11:54:09,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676172905] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:09,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:09,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:54:09,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032362346] [2022-01-10 11:54:09,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:09,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:54:09,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:09,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:54:09,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:54:09,109 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:09,203 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2022-01-10 11:54:09,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 11:54:09,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-01-10 11:54:09,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:09,203 INFO L225 Difference]: With dead ends: 80 [2022-01-10 11:54:09,203 INFO L226 Difference]: Without dead ends: 78 [2022-01-10 11:54:09,204 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 11:54:09,204 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 4 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:09,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 183 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-10 11:54:09,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-01-10 11:54:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 72 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 11:54:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2022-01-10 11:54:09,207 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 20 [2022-01-10 11:54:09,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:09,207 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2022-01-10 11:54:09,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-01-10 11:54:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 11:54:09,208 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:09,208 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 11:54:09,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 11:54:09,208 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:09,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:09,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1943397796, now seen corresponding path program 1 times [2022-01-10 11:54:09,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:09,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90775721] [2022-01-10 11:54:09,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:09,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:09,294 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 11:54:09,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:09,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90775721] [2022-01-10 11:54:09,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90775721] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:09,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:09,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:54:09,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570771303] [2022-01-10 11:54:09,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:09,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:54:09,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:09,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:54:09,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:54:09,295 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:09,374 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-01-10 11:54:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 11:54:09,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-01-10 11:54:09,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:09,375 INFO L225 Difference]: With dead ends: 73 [2022-01-10 11:54:09,375 INFO L226 Difference]: Without dead ends: 71 [2022-01-10 11:54:09,376 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 11:54:09,376 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:09,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-01-10 11:54:09,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2022-01-10 11:54:09,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 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 11:54:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-01-10 11:54:09,380 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 20 [2022-01-10 11:54:09,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:09,381 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-01-10 11:54:09,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-01-10 11:54:09,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 11:54:09,381 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:09,381 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] [2022-01-10 11:54:09,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 11:54:09,382 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:09,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:09,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1728136734, now seen corresponding path program 1 times [2022-01-10 11:54:09,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:09,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111301045] [2022-01-10 11:54:09,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:09,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:09,527 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 11:54:09,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:09,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111301045] [2022-01-10 11:54:09,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111301045] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:09,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:09,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 11:54:09,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484351063] [2022-01-10 11:54:09,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:09,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 11:54:09,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:09,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 11:54:09,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 11:54:09,529 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:09,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:09,792 INFO L93 Difference]: Finished difference Result 193 states and 219 transitions. [2022-01-10 11:54:09,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 11:54:09,793 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-10 11:54:09,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:09,793 INFO L225 Difference]: With dead ends: 193 [2022-01-10 11:54:09,793 INFO L226 Difference]: Without dead ends: 151 [2022-01-10 11:54:09,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-10 11:54:09,794 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 196 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:09,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 225 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 11:54:09,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-01-10 11:54:09,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 87. [2022-01-10 11:54:09,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 86 states have internal predecessors, (101), 0 states have call successors, (0), 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 11:54:09,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2022-01-10 11:54:09,799 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 22 [2022-01-10 11:54:09,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:09,799 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2022-01-10 11:54:09,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2022-01-10 11:54:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 11:54:09,800 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:09,800 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] [2022-01-10 11:54:09,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 11:54:09,800 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:09,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:09,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2080292386, now seen corresponding path program 1 times [2022-01-10 11:54:09,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:09,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923852252] [2022-01-10 11:54:09,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:09,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:10,142 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 11:54:10,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:10,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923852252] [2022-01-10 11:54:10,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923852252] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:10,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:10,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 11:54:10,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479214489] [2022-01-10 11:54:10,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:10,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 11:54:10,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:10,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 11:54:10,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 11:54:10,143 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:10,593 INFO L93 Difference]: Finished difference Result 232 states and 260 transitions. [2022-01-10 11:54:10,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 11:54:10,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-10 11:54:10,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:10,595 INFO L225 Difference]: With dead ends: 232 [2022-01-10 11:54:10,595 INFO L226 Difference]: Without dead ends: 230 [2022-01-10 11:54:10,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-01-10 11:54:10,596 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 243 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:10,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 415 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 11:54:10,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-01-10 11:54:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 98. [2022-01-10 11:54:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 97 states have internal predecessors, (114), 0 states have call successors, (0), 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 11:54:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2022-01-10 11:54:10,616 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 22 [2022-01-10 11:54:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:10,617 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2022-01-10 11:54:10,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2022-01-10 11:54:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 11:54:10,618 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:10,618 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 11:54:10,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 11:54:10,619 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:10,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:10,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1571713419, now seen corresponding path program 1 times [2022-01-10 11:54:10,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:10,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802028558] [2022-01-10 11:54:10,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:10,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:10,660 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 11:54:10,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:10,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802028558] [2022-01-10 11:54:10,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802028558] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:10,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:10,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 11:54:10,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978097636] [2022-01-10 11:54:10,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:10,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 11:54:10,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:10,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 11:54:10,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:54:10,662 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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 11:54:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:10,782 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2022-01-10 11:54:10,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 11:54:10,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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 11:54:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:10,783 INFO L225 Difference]: With dead ends: 148 [2022-01-10 11:54:10,783 INFO L226 Difference]: Without dead ends: 146 [2022-01-10 11:54:10,783 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 11:54:10,784 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 72 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:10,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 174 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-01-10 11:54:10,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 124. [2022-01-10 11:54:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 118 states have (on average 1.2542372881355932) internal successors, (148), 123 states have internal predecessors, (148), 0 states have call successors, (0), 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 11:54:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 148 transitions. [2022-01-10 11:54:10,790 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 148 transitions. Word has length 24 [2022-01-10 11:54:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:10,790 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 148 transitions. [2022-01-10 11:54:10,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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 11:54:10,791 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 148 transitions. [2022-01-10 11:54:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 11:54:10,791 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:10,791 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] [2022-01-10 11:54:10,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 11:54:10,791 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:10,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:10,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1908771830, now seen corresponding path program 1 times [2022-01-10 11:54:10,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:10,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651898405] [2022-01-10 11:54:10,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:10,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:11,000 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 11:54:11,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:11,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651898405] [2022-01-10 11:54:11,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651898405] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:11,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:11,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 11:54:11,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571318309] [2022-01-10 11:54:11,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:11,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 11:54:11,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:11,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 11:54:11,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 11:54:11,001 INFO L87 Difference]: Start difference. First operand 124 states and 148 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 11:54:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:11,386 INFO L93 Difference]: Finished difference Result 247 states and 282 transitions. [2022-01-10 11:54:11,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 11:54:11,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-01-10 11:54:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:11,387 INFO L225 Difference]: With dead ends: 247 [2022-01-10 11:54:11,387 INFO L226 Difference]: Without dead ends: 245 [2022-01-10 11:54:11,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-01-10 11:54:11,388 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 222 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:11,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 416 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 11:54:11,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-01-10 11:54:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 127. [2022-01-10 11:54:11,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 121 states have (on average 1.2479338842975207) internal successors, (151), 126 states have internal predecessors, (151), 0 states have call successors, (0), 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 11:54:11,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2022-01-10 11:54:11,395 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 25 [2022-01-10 11:54:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:11,395 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2022-01-10 11:54:11,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 11:54:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2022-01-10 11:54:11,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 11:54:11,396 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:11,396 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 11:54:11,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 11:54:11,396 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:11,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:11,396 INFO L85 PathProgramCache]: Analyzing trace with hash -817602824, now seen corresponding path program 1 times [2022-01-10 11:54:11,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:11,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094832014] [2022-01-10 11:54:11,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:11,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:11,462 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 11:54:11,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:11,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094832014] [2022-01-10 11:54:11,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094832014] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:11,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:11,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:54:11,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242681636] [2022-01-10 11:54:11,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:11,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:54:11,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:11,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:54:11,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:54:11,464 INFO L87 Difference]: Start difference. First operand 127 states and 151 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:11,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:11,593 INFO L93 Difference]: Finished difference Result 175 states and 205 transitions. [2022-01-10 11:54:11,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 11:54:11,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-10 11:54:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:11,616 INFO L225 Difference]: With dead ends: 175 [2022-01-10 11:54:11,616 INFO L226 Difference]: Without dead ends: 156 [2022-01-10 11:54:11,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:54:11,617 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 21 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:11,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 176 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:11,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-01-10 11:54:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 147. [2022-01-10 11:54:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 146 states have internal predecessors, (178), 0 states have call successors, (0), 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 11:54:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 178 transitions. [2022-01-10 11:54:11,627 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 178 transitions. Word has length 27 [2022-01-10 11:54:11,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:11,628 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 178 transitions. [2022-01-10 11:54:11,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 178 transitions. [2022-01-10 11:54:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 11:54:11,628 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:11,628 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] [2022-01-10 11:54:11,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 11:54:11,628 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:11,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:11,629 INFO L85 PathProgramCache]: Analyzing trace with hash -789147605, now seen corresponding path program 1 times [2022-01-10 11:54:11,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:11,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941346946] [2022-01-10 11:54:11,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:11,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 11:54:11,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:11,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941346946] [2022-01-10 11:54:11,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941346946] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:11,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:11,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:11,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036557564] [2022-01-10 11:54:11,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:11,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:11,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:11,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:11,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:11,681 INFO L87 Difference]: Start difference. First operand 147 states and 178 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 11:54:11,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:11,737 INFO L93 Difference]: Finished difference Result 148 states and 179 transitions. [2022-01-10 11:54:11,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:11,738 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 27 [2022-01-10 11:54:11,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:11,738 INFO L225 Difference]: With dead ends: 148 [2022-01-10 11:54:11,738 INFO L226 Difference]: Without dead ends: 146 [2022-01-10 11:54:11,738 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 11:54:11,739 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 48 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 71 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 11:54:11,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 71 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-01-10 11:54:11,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 124. [2022-01-10 11:54:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.2352941176470589) internal successors, (147), 123 states have internal predecessors, (147), 0 states have call successors, (0), 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 11:54:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2022-01-10 11:54:11,747 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 27 [2022-01-10 11:54:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:11,747 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2022-01-10 11:54:11,747 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 11:54:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2022-01-10 11:54:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 11:54:11,748 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:11,748 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] [2022-01-10 11:54:11,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 11:54:11,748 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:11,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:11,749 INFO L85 PathProgramCache]: Analyzing trace with hash -555606655, now seen corresponding path program 1 times [2022-01-10 11:54:11,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:11,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514108861] [2022-01-10 11:54:11,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:11,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:11,825 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 11:54:11,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:11,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514108861] [2022-01-10 11:54:11,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514108861] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:54:11,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179810112] [2022-01-10 11:54:11,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:11,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:54:11,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:54:11,839 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 11:54:11,840 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 11:54:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:11,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjunts are in the unsatisfiable core [2022-01-10 11:54:11,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:54:12,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:12,058 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 18 treesize of output 19 [2022-01-10 11:54:12,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:12,066 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 18 treesize of output 19 [2022-01-10 11:54:12,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:12,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:12,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:12,122 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:12,122 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2022-01-10 11:54:12,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:12,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:12,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:12,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-01-10 11:54:12,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:12,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:12,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:12,463 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-01-10 11:54:12,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:12,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:12,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:12,473 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:12,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 16 [2022-01-10 11:54:12,496 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 11:54:12,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:54:13,921 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 11:54:13,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179810112] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:54:13,922 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:54:13,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-01-10 11:54:13,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931474025] [2022-01-10 11:54:13,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:54:13,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 11:54:13,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:13,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 11:54:13,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=77, Unknown=1, NotChecked=0, Total=110 [2022-01-10 11:54:13,923 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 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 11:54:14,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:14,127 INFO L93 Difference]: Finished difference Result 165 states and 190 transitions. [2022-01-10 11:54:14,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 11:54:14,127 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 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 11:54:14,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:14,128 INFO L225 Difference]: With dead ends: 165 [2022-01-10 11:54:14,128 INFO L226 Difference]: Without dead ends: 123 [2022-01-10 11:54:14,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=89, Unknown=1, NotChecked=0, Total=132 [2022-01-10 11:54:14,129 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 37 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:14,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 262 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 107 Invalid, 0 Unknown, 74 Unchecked, 0.1s Time] [2022-01-10 11:54:14,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-01-10 11:54:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 110. [2022-01-10 11:54:14,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.2) internal successors, (126), 109 states have internal predecessors, (126), 0 states have call successors, (0), 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 11:54:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2022-01-10 11:54:14,134 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 27 [2022-01-10 11:54:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:14,135 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2022-01-10 11:54:14,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 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 11:54:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2022-01-10 11:54:14,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 11:54:14,136 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:14,136 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 11:54:14,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 11:54:14,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:54:14,347 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:14,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:14,348 INFO L85 PathProgramCache]: Analyzing trace with hash 215810744, now seen corresponding path program 1 times [2022-01-10 11:54:14,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:14,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535516331] [2022-01-10 11:54:14,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:14,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:14,623 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 11:54:14,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:14,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535516331] [2022-01-10 11:54:14,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535516331] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:14,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:14,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 11:54:14,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081621747] [2022-01-10 11:54:14,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:14,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 11:54:14,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:14,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 11:54:14,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 11:54:14,625 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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 11:54:14,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:14,889 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2022-01-10 11:54:14,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 11:54:14,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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 11:54:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:14,890 INFO L225 Difference]: With dead ends: 233 [2022-01-10 11:54:14,890 INFO L226 Difference]: Without dead ends: 193 [2022-01-10 11:54:14,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-10 11:54:14,891 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 194 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:14,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 260 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 11:54:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-01-10 11:54:14,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 110. [2022-01-10 11:54:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.1904761904761905) internal successors, (125), 109 states have internal predecessors, (125), 0 states have call successors, (0), 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 11:54:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2022-01-10 11:54:14,897 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 27 [2022-01-10 11:54:14,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:14,897 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2022-01-10 11:54:14,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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 11:54:14,897 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2022-01-10 11:54:14,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 11:54:14,898 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:14,898 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 11:54:14,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 11:54:14,900 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:14,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:14,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1103786496, now seen corresponding path program 1 times [2022-01-10 11:54:14,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:14,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747575350] [2022-01-10 11:54:14,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:14,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:14,962 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 11:54:14,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:14,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747575350] [2022-01-10 11:54:14,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747575350] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:14,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:14,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:14,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127137915] [2022-01-10 11:54:14,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:14,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:14,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:14,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:14,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:14,965 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:14,980 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2022-01-10 11:54:14,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:14,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-10 11:54:14,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:14,980 INFO L225 Difference]: With dead ends: 147 [2022-01-10 11:54:14,980 INFO L226 Difference]: Without dead ends: 145 [2022-01-10 11:54:14,981 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 11:54:14,981 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 26 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 130 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 11:54:14,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 130 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-01-10 11:54:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 120. [2022-01-10 11:54:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.2) internal successors, (138), 119 states have internal predecessors, (138), 0 states have call successors, (0), 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 11:54:14,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2022-01-10 11:54:14,988 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 29 [2022-01-10 11:54:14,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:14,989 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2022-01-10 11:54:14,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:14,989 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2022-01-10 11:54:14,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 11:54:14,989 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:14,989 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] [2022-01-10 11:54:14,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 11:54:14,989 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:14,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:14,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1156070488, now seen corresponding path program 1 times [2022-01-10 11:54:14,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:14,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214845243] [2022-01-10 11:54:14,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:14,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:15,052 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 11:54:15,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:15,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214845243] [2022-01-10 11:54:15,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214845243] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:54:15,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241687086] [2022-01-10 11:54:15,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:15,053 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:54:15,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:54:15,054 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 11:54:15,055 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 11:54:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:15,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-10 11:54:15,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:54:15,233 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 6 treesize of output 5 [2022-01-10 11:54:15,237 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 6 treesize of output 5 [2022-01-10 11:54:15,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:15,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-10 11:54:15,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:15,440 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:15,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 13 [2022-01-10 11:54:15,463 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 11:54:15,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:54:15,825 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-10 11:54:15,825 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 24 treesize of output 21 [2022-01-10 11:54:15,828 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 [2022-01-10 11:54:15,857 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 11:54:15,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241687086] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:54:15,857 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:54:15,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 8] total 12 [2022-01-10 11:54:15,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887791272] [2022-01-10 11:54:15,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:54:15,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 11:54:15,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:15,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 11:54:15,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-01-10 11:54:15,858 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 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 11:54:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:16,070 INFO L93 Difference]: Finished difference Result 230 states and 268 transitions. [2022-01-10 11:54:16,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 11:54:16,071 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-01-10 11:54:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:16,072 INFO L225 Difference]: With dead ends: 230 [2022-01-10 11:54:16,072 INFO L226 Difference]: Without dead ends: 201 [2022-01-10 11:54:16,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2022-01-10 11:54:16,072 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 184 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:16,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 452 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 100 Invalid, 0 Unknown, 100 Unchecked, 0.1s Time] [2022-01-10 11:54:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-01-10 11:54:16,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 153. [2022-01-10 11:54:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.2364864864864864) internal successors, (183), 152 states have internal predecessors, (183), 0 states have call successors, (0), 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 11:54:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 183 transitions. [2022-01-10 11:54:16,080 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 183 transitions. Word has length 30 [2022-01-10 11:54:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:16,080 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 183 transitions. [2022-01-10 11:54:16,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 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 11:54:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 183 transitions. [2022-01-10 11:54:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 11:54:16,081 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:16,081 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 11:54:16,101 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 11:54:16,298 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,SelfDestructingSolverStorable21 [2022-01-10 11:54:16,299 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 11:54:16,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:16,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2855394, now seen corresponding path program 1 times [2022-01-10 11:54:16,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:16,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803531920] [2022-01-10 11:54:16,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:16,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:54:16,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:16,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803531920] [2022-01-10 11:54:16,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803531920] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:54:16,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980102329] [2022-01-10 11:54:16,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:16,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:54:16,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:54:16,964 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 11:54:16,994 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 11:54:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:17,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 68 conjunts are in the unsatisfiable core [2022-01-10 11:54:17,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:54:17,449 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 11:54:17,473 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 15 treesize of output 11 [2022-01-10 11:54:17,480 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 15 treesize of output 11 [2022-01-10 11:54:17,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:17,580 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 34 treesize of output 36 [2022-01-10 11:54:17,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:17,589 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 52 treesize of output 46 [2022-01-10 11:54:17,607 INFO L353 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-01-10 11:54:17,608 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 92 treesize of output 80 [2022-01-10 11:54:17,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:17,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:17,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:17,616 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 37 treesize of output 34 [2022-01-10 11:54:17,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 30 treesize of output 28 [2022-01-10 11:54:17,636 INFO L353 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-01-10 11:54:17,636 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 11:54:17,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:17,812 INFO L353 Elim1Store]: treesize reduction 108, result has 12.9 percent of original size [2022-01-10 11:54:17,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 108 [2022-01-10 11:54:17,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:17,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:17,838 INFO L353 Elim1Store]: treesize reduction 149, result has 9.1 percent of original size [2022-01-10 11:54:17,839 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 54 [2022-01-10 11:54:17,844 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 16 treesize of output 15 [2022-01-10 11:54:17,849 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 42 treesize of output 28 [2022-01-10 11:54:17,854 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-01-10 11:54:17,865 INFO L353 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-01-10 11:54:17,865 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 25 treesize of output 25 [2022-01-10 11:54:18,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:18,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:18,082 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 10 [2022-01-10 11:54:18,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:18,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:18,089 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:18,089 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 3 case distinctions, treesize of input 36 treesize of output 14 [2022-01-10 11:54:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:54:18,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:54:20,016 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:20,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 327 treesize of output 337 [2022-01-10 11:54:20,058 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 16 treesize of output 10 [2022-01-10 11:54:20,068 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 16 treesize of output 10 [2022-01-10 11:54:20,117 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 16 treesize of output 10 [2022-01-10 11:54:20,126 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 16 treesize of output 10 [2022-01-10 11:54:20,298 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 16 treesize of output 10 [2022-01-10 11:54:20,311 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 16 treesize of output 10 [2022-01-10 11:54:20,369 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 16 treesize of output 10 [2022-01-10 11:54:20,380 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 16 treesize of output 10 [2022-01-10 11:54:20,407 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 176 treesize of output 140 [2022-01-10 11:54:20,411 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 160 treesize of output 130 [2022-01-10 11:54:20,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 16 treesize of output 10 [2022-01-10 11:54:20,446 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 16 treesize of output 10 [2022-01-10 11:54:20,468 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 176 treesize of output 140 [2022-01-10 11:54:20,473 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 160 treesize of output 130 [2022-01-10 11:54:20,527 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 16 treesize of output 10 [2022-01-10 11:54:20,539 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 16 treesize of output 10 [2022-01-10 11:54:20,599 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 16 treesize of output 10 [2022-01-10 11:54:20,610 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 16 treesize of output 10 [2022-01-10 11:54:20,838 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 16 treesize of output 10 [2022-01-10 11:54:20,862 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 16 treesize of output 10 [2022-01-10 11:54:20,913 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 16 treesize of output 10 [2022-01-10 11:54:20,923 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 16 treesize of output 10 [2022-01-10 11:54:20,947 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 176 treesize of output 140 [2022-01-10 11:54:20,954 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 16 treesize of output 10 [2022-01-10 11:54:20,978 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 16 treesize of output 10 [2022-01-10 11:54:20,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 16 treesize of output 10 [2022-01-10 11:54:21,006 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 176 treesize of output 140 [2022-01-10 11:54:21,010 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 160 treesize of output 130 [2022-01-10 11:54:21,059 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 176 treesize of output 140 [2022-01-10 11:54:21,067 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 16 treesize of output 10 [2022-01-10 11:54:21,170 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 16 treesize of output 10 [2022-01-10 11:54:21,181 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 16 treesize of output 10 [2022-01-10 11:54:21,288 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 176 treesize of output 140 [2022-01-10 11:54:21,294 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 160 treesize of output 130 [2022-01-10 11:54:21,614 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 16 treesize of output 10 [2022-01-10 11:54:21,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 16 treesize of output 10 [2022-01-10 11:54:21,665 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 16 treesize of output 10 [2022-01-10 11:54:21,684 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 16 treesize of output 10 [2022-01-10 11:54:21,898 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 16 treesize of output 10 [2022-01-10 11:54:21,924 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 16 treesize of output 10 [2022-01-10 11:54:21,977 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 16 treesize of output 10 [2022-01-10 11:54:21,995 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 16 treesize of output 10 [2022-01-10 11:54:22,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 16 treesize of output 10 [2022-01-10 11:54:22,034 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 16 treesize of output 10 [2022-01-10 11:54:22,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 176 treesize of output 140 [2022-01-10 11:54:22,062 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 16 treesize of output 10 [2022-01-10 11:54:22,080 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 176 treesize of output 140 [2022-01-10 11:54:22,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 16 treesize of output 10 [2022-01-10 11:54:22,137 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 176 treesize of output 140 [2022-01-10 11:54:22,141 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 160 treesize of output 130 [2022-01-10 11:54:22,226 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 176 treesize of output 140 [2022-01-10 11:54:22,231 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 160 treesize of output 130 [2022-01-10 11:54:22,369 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 16 treesize of output 10 [2022-01-10 11:54:22,378 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 16 treesize of output 10 [2022-01-10 11:54:26,717 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 16 treesize of output 10 [2022-01-10 11:54:26,744 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 16 treesize of output 10 [2022-01-10 11:54:26,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 16 treesize of output 10 [2022-01-10 11:54:26,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 16 treesize of output 10 [2022-01-10 11:54:27,023 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 16 treesize of output 10 [2022-01-10 11:54:27,048 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 16 treesize of output 10 [2022-01-10 11:54:27,081 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 16 treesize of output 10 [2022-01-10 11:54:27,107 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 16 treesize of output 10 [2022-01-10 11:54:27,168 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 16 treesize of output 10 [2022-01-10 11:54:27,176 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 16 treesize of output 10 [2022-01-10 11:54:27,196 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 176 treesize of output 140 [2022-01-10 11:54:27,202 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 16 treesize of output 10 [2022-01-10 11:54:27,219 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 176 treesize of output 140 [2022-01-10 11:54:27,226 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 16 treesize of output 10 [2022-01-10 11:54:27,269 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 176 treesize of output 140 [2022-01-10 11:54:27,273 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 160 treesize of output 130 [2022-01-10 11:54:27,358 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 176 treesize of output 140 [2022-01-10 11:54:27,364 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 160 treesize of output 130 [2022-01-10 11:54:27,465 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 16 treesize of output 10 [2022-01-10 11:54:27,474 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 16 treesize of output 10 [2022-01-10 11:54:27,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 16 treesize of output 10 [2022-01-10 11:54:27,664 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 16 treesize of output 10 [2022-01-10 11:54:27,696 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 16 treesize of output 10 [2022-01-10 11:54:27,718 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 16 treesize of output 10 [2022-01-10 11:54:27,927 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 16 treesize of output 10 [2022-01-10 11:54:27,948 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 16 treesize of output 10 [2022-01-10 11:54:27,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 16 treesize of output 10 [2022-01-10 11:54:28,008 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 16 treesize of output 10 [2022-01-10 11:54:28,056 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 16 treesize of output 10 [2022-01-10 11:54:28,065 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 16 treesize of output 10 [2022-01-10 11:54:28,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 176 treesize of output 140 [2022-01-10 11:54:28,092 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 160 treesize of output 130 [2022-01-10 11:54:28,113 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 176 treesize of output 140 [2022-01-10 11:54:28,117 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 160 treesize of output 130 [2022-01-10 11:54:28,196 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 176 treesize of output 140 [2022-01-10 11:54:28,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 160 treesize of output 130 [2022-01-10 11:54:28,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 176 treesize of output 140 [2022-01-10 11:54:28,282 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 16 treesize of output 10 [2022-01-10 11:54:28,374 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 16 treesize of output 10 [2022-01-10 11:54:28,382 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 16 treesize of output 10 [2022-01-10 11:54:28,533 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 16 treesize of output 10 [2022-01-10 11:54:28,556 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 16 treesize of output 10 [2022-01-10 11:54:28,584 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 16 treesize of output 10 [2022-01-10 11:54:28,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 11:54:28,788 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 16 treesize of output 10 [2022-01-10 11:54:28,812 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 16 treesize of output 10 [2022-01-10 11:54:28,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 16 treesize of output 10 [2022-01-10 11:54:28,859 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 16 treesize of output 10 [2022-01-10 11:54:28,888 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 16 treesize of output 10 [2022-01-10 11:54:28,896 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 16 treesize of output 10 [2022-01-10 11:54:28,914 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 176 treesize of output 140 [2022-01-10 11:54:28,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 16 treesize of output 10 [2022-01-10 11:54:28,938 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 176 treesize of output 140 [2022-01-10 11:54:28,945 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 16 treesize of output 10 [2022-01-10 11:54:28,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 176 treesize of output 140 [2022-01-10 11:54:28,995 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 16 treesize of output 10 [2022-01-10 11:54:29,069 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 176 treesize of output 140 [2022-01-10 11:54:29,074 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 160 treesize of output 130 [2022-01-10 11:54:29,199 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 16 treesize of output 10 [2022-01-10 11:54:29,207 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 16 treesize of output 10 [2022-01-10 11:54:29,358 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 16 treesize of output 10 [2022-01-10 11:54:29,377 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 16 treesize of output 10 [2022-01-10 11:54:29,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 16 treesize of output 10 [2022-01-10 11:54:29,422 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 16 treesize of output 10 [2022-01-10 11:54:29,571 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 16 treesize of output 10 [2022-01-10 11:54:29,590 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 16 treesize of output 10 [2022-01-10 11:54:29,615 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 16 treesize of output 10 [2022-01-10 11:54:29,632 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 16 treesize of output 10 [2022-01-10 11:54:29,672 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 16 treesize of output 10 [2022-01-10 11:54:29,679 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 16 treesize of output 10 [2022-01-10 11:54:29,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 176 treesize of output 140 [2022-01-10 11:54:29,703 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 16 treesize of output 10 [2022-01-10 11:54:29,721 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 176 treesize of output 140 [2022-01-10 11:54:29,725 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 160 treesize of output 130 [2022-01-10 11:54:29,775 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 176 treesize of output 140 [2022-01-10 11:54:29,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 16 treesize of output 10 [2022-01-10 11:54:29,876 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 176 treesize of output 140 [2022-01-10 11:54:29,881 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 160 treesize of output 130 [2022-01-10 11:54:29,980 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 16 treesize of output 10 [2022-01-10 11:54:29,990 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 16 treesize of output 10 [2022-01-10 11:54:30,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:30,195 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:30,195 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 447 treesize of output 438 [2022-01-10 11:54:30,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:30,213 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:30,214 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 438 treesize of output 263 [2022-01-10 11:54:30,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:30,244 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:30,245 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 3 case distinctions, treesize of input 3206 treesize of output 2982 [2022-01-10 11:54:30,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:30,341 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:30,343 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 3 case distinctions, treesize of input 113712 treesize of output 111264 [2022-01-10 11:54:30,680 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 111280 treesize of output 108658 [2022-01-10 11:54:31,004 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 108704 treesize of output 99464 [2022-01-10 11:54:31,317 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 99464 treesize of output 99338 [2022-01-10 11:54:31,925 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 99167 treesize of output 98783 [2022-01-10 11:54:32,233 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 98783 treesize of output 98687 [2022-01-10 11:54:32,565 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 98687 treesize of output 93143 [2022-01-10 11:54:32,884 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 93143 treesize of output 93023 [2022-01-10 11:54:33,186 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 93023 treesize of output 92735 [2022-01-10 11:54:33,474 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 92735 treesize of output 78335 [2022-01-10 11:54:33,767 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 78335 treesize of output 76535 [2022-01-10 11:54:34,091 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 76535 treesize of output 69335 [2022-01-10 11:54:34,381 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 69335 treesize of output 65735 [2022-01-10 11:54:34,669 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 65735 treesize of output 65687 [2022-01-10 11:54:34,954 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 65687 treesize of output 65591 [2022-01-10 11:54:35,269 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 65591 treesize of output 65495 [2022-01-10 11:54:35,592 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 65495 treesize of output 65427 [2022-01-10 11:54:35,889 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 65427 treesize of output 65271 [2022-01-10 11:54:36,189 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 65271 treesize of output 65223 [2022-01-10 11:54:36,484 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 65223 treesize of output 65127 [2022-01-10 11:54:36,768 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 65127 treesize of output 65103 [2022-01-10 11:54:37,057 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 65103 treesize of output 65091 [2022-01-10 11:54:37,330 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2022-01-10 11:54:37,330 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-10 11:54:37,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-01-10 11:54:37,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83070612] [2022-01-10 11:54:37,331 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-10 11:54:37,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 11:54:37,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:37,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 11:54:37,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=209, Unknown=4, NotChecked=0, Total=272 [2022-01-10 11:54:37,331 INFO L87 Difference]: Start difference. First operand 153 states and 183 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 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 11:54:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:37,806 INFO L93 Difference]: Finished difference Result 282 states and 332 transitions. [2022-01-10 11:54:37,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 11:54:37,806 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 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 11:54:37,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:37,807 INFO L225 Difference]: With dead ends: 282 [2022-01-10 11:54:37,807 INFO L226 Difference]: Without dead ends: 203 [2022-01-10 11:54:37,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=125, Invalid=423, Unknown=4, NotChecked=0, Total=552 [2022-01-10 11:54:37,808 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 223 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:37,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 352 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 11:54:37,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-01-10 11:54:37,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 115. [2022-01-10 11:54:37,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.209090909090909) internal successors, (133), 114 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 11:54:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2022-01-10 11:54:37,814 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 32 [2022-01-10 11:54:37,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:37,814 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2022-01-10 11:54:37,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 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 11:54:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2022-01-10 11:54:37,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 11:54:37,815 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:37,815 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 11:54:37,832 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 11:54:38,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:54:38,023 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:38,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:38,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1641921443, now seen corresponding path program 1 times [2022-01-10 11:54:38,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:38,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134375832] [2022-01-10 11:54:38,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:38,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:38,117 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 11:54:38,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:38,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134375832] [2022-01-10 11:54:38,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134375832] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:38,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:38,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:54:38,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472613652] [2022-01-10 11:54:38,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:38,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:54:38,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:38,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:54:38,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:54:38,119 INFO L87 Difference]: Start difference. First operand 115 states and 133 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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 11:54:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:38,236 INFO L93 Difference]: Finished difference Result 212 states and 249 transitions. [2022-01-10 11:54:38,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 11:54:38,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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 11:54:38,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:38,237 INFO L225 Difference]: With dead ends: 212 [2022-01-10 11:54:38,237 INFO L226 Difference]: Without dead ends: 127 [2022-01-10 11:54:38,238 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 11:54:38,239 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 4 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:38,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 175 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:38,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-01-10 11:54:38,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2022-01-10 11:54:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.2017543859649122) internal successors, (137), 118 states have internal predecessors, (137), 0 states have call successors, (0), 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 11:54:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2022-01-10 11:54:38,245 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 32 [2022-01-10 11:54:38,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:38,246 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2022-01-10 11:54:38,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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 11:54:38,246 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2022-01-10 11:54:38,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 11:54:38,246 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:38,246 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 11:54:38,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 11:54:38,246 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-01-10 11:54:38,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:38,247 INFO L85 PathProgramCache]: Analyzing trace with hash -134369634, now seen corresponding path program 1 times [2022-01-10 11:54:38,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:38,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102956849] [2022-01-10 11:54:38,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:38,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:38,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:54:38,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:38,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102956849] [2022-01-10 11:54:38,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102956849] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:54:38,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780920762] [2022-01-10 11:54:38,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:38,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:54:38,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:54:38,821 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 11:54:38,823 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 11:54:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:40,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 84 conjunts are in the unsatisfiable core [2022-01-10 11:54:40,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:54:40,315 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 11:54:40,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:40,415 INFO L353 Elim1Store]: treesize reduction 29, result has 55.4 percent of original size [2022-01-10 11:54:40,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 459 treesize of output 390 [2022-01-10 11:54:40,502 INFO L353 Elim1Store]: treesize reduction 29, result has 55.4 percent of original size [2022-01-10 11:54:40,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 933 treesize of output 724 [2022-01-10 11:54:40,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:40,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:40,594 INFO L353 Elim1Store]: treesize reduction 614, result has 15.4 percent of original size [2022-01-10 11:54:40,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 674 treesize of output 598 [2022-01-10 11:54:40,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:40,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:40,715 INFO L353 Elim1Store]: treesize reduction 434, result has 15.4 percent of original size [2022-01-10 11:54:40,715 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 399 treesize of output 408 [2022-01-10 11:54:40,725 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 269 treesize of output 137 [2022-01-10 11:54:40,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:40,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 104 [2022-01-10 11:54:40,747 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 20 treesize of output 19 [2022-01-10 11:54:40,772 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 11:54:40,772 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 17 treesize of output 21 [2022-01-10 11:54:40,788 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 20 treesize of output 19 [2022-01-10 11:54:40,800 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 20 treesize of output 19 [2022-01-10 11:54:41,671 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 32 treesize of output 28 [2022-01-10 11:54:41,681 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 17 treesize of output 3 [2022-01-10 11:54:41,721 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-10 11:54:41,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:41,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2022-01-10 11:54:41,752 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 17 treesize of output 3 [2022-01-10 11:54:41,863 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2022-01-10 11:54:41,871 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 17 treesize of output 3 [2022-01-10 11:54:41,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:41,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2022-01-10 11:54:41,914 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 17 treesize of output 3 [2022-01-10 11:54:41,995 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 33 treesize of output 29 [2022-01-10 11:54:42,028 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-01-10 11:54:43,452 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 12 treesize of output 11 [2022-01-10 11:54:43,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-01-10 11:54:43,581 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-01-10 11:54:43,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:43,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-01-10 11:54:43,661 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2022-01-10 11:54:43,718 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2022-01-10 11:54:44,743 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 11:54:44,744 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 1 case distinctions, treesize of input 34 treesize of output 28 [2022-01-10 11:54:44,755 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 17 treesize of output 3 [2022-01-10 11:54:45,199 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 27 treesize of output 23 [2022-01-10 11:54:45,204 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 17 treesize of output 3 [2022-01-10 11:54:45,210 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 76 treesize of output 64 [2022-01-10 11:54:45,215 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 17 treesize of output 3 [2022-01-10 11:54:45,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:45,414 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 63 treesize of output 68 [2022-01-10 11:54:45,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:45,434 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 11:54:45,434 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 1 case distinctions, treesize of input 129 treesize of output 90 [2022-01-10 11:54:45,459 INFO L353 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-01-10 11:54:45,459 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 168 treesize of output 156 [2022-01-10 11:54:45,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:45,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:45,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:45,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:45,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:45,469 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66 [2022-01-10 11:54:45,480 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 11:54:45,495 INFO L353 Elim1Store]: treesize reduction 8, result has 78.9 percent of original size [2022-01-10 11:54:45,495 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 42 treesize of output 42 [2022-01-10 11:54:45,658 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-10 11:54:45,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 122 [2022-01-10 11:54:45,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2022-01-10 11:54:46,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:46,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:46,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:46,481 INFO L353 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-01-10 11:54:46,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 159 treesize of output 63 [2022-01-10 11:54:46,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:46,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:46,492 INFO L353 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-01-10 11:54:46,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 23 [2022-01-10 11:54:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:54:46,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:54:46,910 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2269 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_19| Int)) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_19|)) (not (<= 0 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| v_ArrVal_2269) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) (mod (+ 16 |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_19|) 18446744073709551616)))) (and (forall ((v_ArrVal_2268 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| v_ArrVal_2269)) (.cse1 (mod (+ 16 |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_19|) 18446744073709551616))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| v_ArrVal_2268) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse1)) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse1))) (+ .cse2 16 (* (div (+ .cse2 16) 18446744073709551616) (- 18446744073709551616)))))) 0)) (forall ((v_ArrVal_2268 (Array Int Int))) (= (let ((.cse4 (mod (+ 16 |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_19|) 18446744073709551616))) (select (let ((.cse3 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| v_ArrVal_2268))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse4))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.baseInt| v_ArrVal_2269) |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.baseInt|) .cse4))) (+ .cse5 16 (* (div (+ .cse5 16) 18446744073709551616) (- 18446744073709551616)))))) 0))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~end~0#1.offsetInt_19| |c_ULTIMATE.start_ULTIMATE.start_main_~list~0#1.offsetInt|)))) is different from false [2022-01-10 11:54:53,244 INFO L353 Elim1Store]: treesize reduction 78, result has 53.0 percent of original size [2022-01-10 11:54:53,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 32260 treesize of output 24379 [2022-01-10 11:54:57,063 INFO L353 Elim1Store]: treesize reduction 78, result has 53.0 percent of original size [2022-01-10 11:54:57,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 182469 treesize of output 134556