/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 14:34:27,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 14:34:27,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 14:34:27,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 14:34:27,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 14:34:27,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 14:34:27,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 14:34:27,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 14:34:27,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 14:34:27,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 14:34:27,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 14:34:27,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 14:34:27,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 14:34:27,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 14:34:27,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 14:34:27,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 14:34:27,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 14:34:27,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 14:34:27,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 14:34:27,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 14:34:27,583 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 14:34:27,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 14:34:27,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 14:34:27,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 14:34:27,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 14:34:27,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 14:34:27,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 14:34:27,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 14:34:27,593 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 14:34:27,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 14:34:27,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 14:34:27,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 14:34:27,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 14:34:27,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 14:34:27,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 14:34:27,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 14:34:27,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 14:34:27,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 14:34:27,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 14:34:27,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 14:34:27,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 14:34:27,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 14:34:27,607 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-06 14:34:27,616 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 14:34:27,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 14:34:27,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 14:34:27,618 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-06 14:34:27,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 14:34:27,619 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-06 14:34:27,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 14:34:27,619 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 14:34:27,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 14:34:27,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 14:34:27,620 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-06 14:34:27,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 14:34:27,620 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 14:34:27,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 14:34:27,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 14:34:27,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 14:34:27,621 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-06 14:34:27,621 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 14:34:27,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 14:34:27,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 14:34:27,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-06 14:34:27,622 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-06 14:34:27,622 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-06 14:34:27,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 14:34:27,622 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-06 14:34:27,622 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-04-06 14:34:27,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 14:34:27,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 14:34:27,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 14:34:27,886 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 14:34:27,886 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 14:34:27,887 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-04-06 14:34:27,938 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b13ea9303/747fa14c079e41cc94f35ab788736acc/FLAG5c863e60c [2022-04-06 14:34:28,351 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 14:34:28,351 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-04-06 14:34:28,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b13ea9303/747fa14c079e41cc94f35ab788736acc/FLAG5c863e60c [2022-04-06 14:34:28,371 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b13ea9303/747fa14c079e41cc94f35ab788736acc [2022-04-06 14:34:28,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 14:34:28,374 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-06 14:34:28,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 14:34:28,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 14:34:28,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 14:34:28,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 02:34:28" (1/1) ... [2022-04-06 14:34:28,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c5537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:28, skipping insertion in model container [2022-04-06 14:34:28,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 02:34:28" (1/1) ... [2022-04-06 14:34:28,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 14:34:28,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 14:34:28,632 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-04-06 14:34:28,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-04-06 14:34:28,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-04-06 14:34:28,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-04-06 14:34:28,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-04-06 14:34:28,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-04-06 14:34:28,654 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-04-06 14:34:28,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-04-06 14:34:28,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-04-06 14:34:28,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-04-06 14:34:28,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-04-06 14:34:28,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-04-06 14:34:28,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-04-06 14:34:28,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-04-06 14:34:28,679 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-04-06 14:34:28,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-04-06 14:34:28,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-04-06 14:34:28,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-04-06 14:34:28,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 14:34:28,702 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 14:34:28,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-04-06 14:34:28,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-04-06 14:34:28,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-04-06 14:34:28,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-04-06 14:34:28,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-04-06 14:34:28,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-04-06 14:34:28,745 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-04-06 14:34:28,746 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-04-06 14:34:28,747 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-04-06 14:34:28,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-04-06 14:34:28,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-04-06 14:34:28,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-04-06 14:34:28,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-04-06 14:34:28,753 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-04-06 14:34:28,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-04-06 14:34:28,755 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-04-06 14:34:28,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-04-06 14:34:28,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-04-06 14:34:28,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 14:34:28,780 INFO L208 MainTranslator]: Completed translation [2022-04-06 14:34:28,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:28 WrapperNode [2022-04-06 14:34:28,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 14:34:28,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 14:34:28,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 14:34:28,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 14:34:28,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:28" (1/1) ... [2022-04-06 14:34:28,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:28" (1/1) ... [2022-04-06 14:34:28,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:28" (1/1) ... [2022-04-06 14:34:28,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:28" (1/1) ... [2022-04-06 14:34:28,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:28" (1/1) ... [2022-04-06 14:34:28,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:28" (1/1) ... [2022-04-06 14:34:28,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:28" (1/1) ... [2022-04-06 14:34:28,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 14:34:28,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 14:34:28,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 14:34:28,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 14:34:28,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:28" (1/1) ... [2022-04-06 14:34:28,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 14:34:28,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 14:34:28,859 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-04-06 14:34:28,868 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-04-06 14:34:28,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 14:34:28,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 14:34:28,893 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 14:34:28,893 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-06 14:34:28,893 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 14:34:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 14:34:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 14:34:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 14:34:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 14:34:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-06 14:34:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 14:34:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 14:34:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 14:34:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 14:34:28,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 14:34:28,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 14:34:28,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 14:34:28,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 14:34:28,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 14:34:28,977 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 14:34:28,978 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 14:34:29,220 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 14:34:29,226 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 14:34:29,226 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-06 14:34:29,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 02:34:29 BoogieIcfgContainer [2022-04-06 14:34:29,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 14:34:29,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 14:34:29,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 14:34:29,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 14:34:29,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 02:34:28" (1/3) ... [2022-04-06 14:34:29,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1843bc1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 02:34:29, skipping insertion in model container [2022-04-06 14:34:29,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:28" (2/3) ... [2022-04-06 14:34:29,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1843bc1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 02:34:29, skipping insertion in model container [2022-04-06 14:34:29,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 02:34:29" (3/3) ... [2022-04-06 14:34:29,234 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2022-04-06 14:34:29,238 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-06 14:34:29,238 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-04-06 14:34:29,273 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 14:34:29,281 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-06 14:34:29,282 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-04-06 14:34:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 14:34:29,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-06 14:34:29,306 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:29,307 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:29,307 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:29,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:29,314 INFO L85 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 1 times [2022-04-06 14:34:29,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:29,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [43328700] [2022-04-06 14:34:29,331 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:29,332 INFO L85 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 2 times [2022-04-06 14:34:29,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:29,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498617471] [2022-04-06 14:34:29,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:29,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:29,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:29,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:29,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498617471] [2022-04-06 14:34:29,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498617471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:29,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:29,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 14:34:29,583 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:29,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [43328700] [2022-04-06 14:34:29,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [43328700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:29,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:29,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 14:34:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676705050] [2022-04-06 14:34:29,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:29,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 14:34:29,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:29,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 14:34:29,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 14:34:29,615 INFO L87 Difference]: Start difference. First operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:29,752 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2022-04-06 14:34:29,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 14:34:29,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-06 14:34:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:29,763 INFO L225 Difference]: With dead ends: 93 [2022-04-06 14:34:29,763 INFO L226 Difference]: Without dead ends: 80 [2022-04-06 14:34:29,766 INFO L912 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-04-06 14:34:29,774 INFO L913 BasicCegarLoop]: 94 mSDtfsCounter, 170 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:29,776 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 105 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:29,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-06 14:34:29,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-04-06 14:34:29,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-04-06 14:34:29,829 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2022-04-06 14:34:29,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:29,830 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-04-06 14:34:29,830 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-06 14:34:29,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-06 14:34:29,831 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:29,831 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:29,831 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 14:34:29,831 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:29,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:29,832 INFO L85 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 1 times [2022-04-06 14:34:29,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:29,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [888537694] [2022-04-06 14:34:29,833 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:29,833 INFO L85 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 2 times [2022-04-06 14:34:29,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:29,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686553073] [2022-04-06 14:34:29,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:29,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:29,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:29,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:29,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:29,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686553073] [2022-04-06 14:34:29,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686553073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:29,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:29,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:29,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:29,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [888537694] [2022-04-06 14:34:29,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [888537694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:29,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:29,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:29,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849744171] [2022-04-06 14:34:29,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:29,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 14:34:29,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:29,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 14:34:29,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-06 14:34:29,941 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:30,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:30,114 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-06 14:34:30,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 14:34:30,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-06 14:34:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:30,118 INFO L225 Difference]: With dead ends: 80 [2022-04-06 14:34:30,118 INFO L226 Difference]: Without dead ends: 78 [2022-04-06 14:34:30,120 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-06 14:34:30,128 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 319 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:30,128 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 74 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:30,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-06 14:34:30,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-06 14:34:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-06 14:34:30,165 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2022-04-06 14:34:30,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:30,165 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-06 14:34:30,165 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:30,165 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-06 14:34:30,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-06 14:34:30,166 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:30,166 INFO L499 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-04-06 14:34:30,166 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 14:34:30,166 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:30,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:30,167 INFO L85 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 1 times [2022-04-06 14:34:30,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:30,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [936156953] [2022-04-06 14:34:30,167 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:30,168 INFO L85 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 2 times [2022-04-06 14:34:30,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:30,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105478165] [2022-04-06 14:34:30,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:30,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:30,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:30,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:30,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105478165] [2022-04-06 14:34:30,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105478165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:30,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:30,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 14:34:30,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:30,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [936156953] [2022-04-06 14:34:30,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [936156953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:30,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:30,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 14:34:30,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603978613] [2022-04-06 14:34:30,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:30,264 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 14:34:30,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:30,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 14:34:30,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 14:34:30,265 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:30,437 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-04-06 14:34:30,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 14:34:30,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-06 14:34:30,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:30,439 INFO L225 Difference]: With dead ends: 101 [2022-04-06 14:34:30,439 INFO L226 Difference]: Without dead ends: 99 [2022-04-06 14:34:30,440 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-06 14:34:30,441 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 207 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:30,441 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 78 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:30,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-06 14:34:30,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2022-04-06 14:34:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-04-06 14:34:30,462 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2022-04-06 14:34:30,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:30,462 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-04-06 14:34:30,463 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:30,463 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-06 14:34:30,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-06 14:34:30,463 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:30,463 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:30,464 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-06 14:34:30,464 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:30,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:30,464 INFO L85 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 1 times [2022-04-06 14:34:30,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:30,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1161072662] [2022-04-06 14:34:30,465 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:30,465 INFO L85 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 2 times [2022-04-06 14:34:30,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:30,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159381194] [2022-04-06 14:34:30,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:30,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:30,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:30,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:30,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159381194] [2022-04-06 14:34:30,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159381194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:30,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:30,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:30,533 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:30,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1161072662] [2022-04-06 14:34:30,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1161072662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:30,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:30,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:30,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302780108] [2022-04-06 14:34:30,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:30,536 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:30,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:30,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:30,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:30,537 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:30,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:30,632 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-06 14:34:30,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 14:34:30,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-06 14:34:30,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:30,633 INFO L225 Difference]: With dead ends: 76 [2022-04-06 14:34:30,633 INFO L226 Difference]: Without dead ends: 74 [2022-04-06 14:34:30,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-06 14:34:30,634 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 234 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:30,635 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 70 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 14:34:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-06 14:34:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-06 14:34:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-04-06 14:34:30,650 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2022-04-06 14:34:30,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:30,651 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-04-06 14:34:30,651 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-06 14:34:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-06 14:34:30,652 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:30,652 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:30,652 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-06 14:34:30,652 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:30,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:30,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 1 times [2022-04-06 14:34:30,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:30,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [179817967] [2022-04-06 14:34:30,653 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:30,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 2 times [2022-04-06 14:34:30,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:30,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320995902] [2022-04-06 14:34:30,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:30,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:30,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:30,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:30,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320995902] [2022-04-06 14:34:30,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320995902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:30,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:30,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:30,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:30,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [179817967] [2022-04-06 14:34:30,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [179817967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:30,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:30,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:30,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937508324] [2022-04-06 14:34:30,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:30,760 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:30,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:30,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:30,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:30,761 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:31,071 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-04-06 14:34:31,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 14:34:31,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-06 14:34:31,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:31,073 INFO L225 Difference]: With dead ends: 141 [2022-04-06 14:34:31,073 INFO L226 Difference]: Without dead ends: 139 [2022-04-06 14:34:31,074 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-06 14:34:31,075 INFO L913 BasicCegarLoop]: 108 mSDtfsCounter, 235 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:31,076 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 125 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 14:34:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-06 14:34:31,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2022-04-06 14:34:31,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-06 14:34:31,110 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2022-04-06 14:34:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:31,110 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-06 14:34:31,110 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:31,111 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-06 14:34:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-06 14:34:31,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:31,112 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:31,112 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-06 14:34:31,112 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:31,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:31,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 1 times [2022-04-06 14:34:31,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:31,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [264331118] [2022-04-06 14:34:31,113 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:31,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 2 times [2022-04-06 14:34:31,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:31,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886395969] [2022-04-06 14:34:31,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:31,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:31,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:31,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:31,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886395969] [2022-04-06 14:34:31,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886395969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:31,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:31,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:31,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:31,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [264331118] [2022-04-06 14:34:31,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [264331118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:31,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:31,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:31,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177241626] [2022-04-06 14:34:31,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:31,208 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:31,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:31,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:31,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:31,209 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:31,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:31,453 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2022-04-06 14:34:31,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 14:34:31,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-06 14:34:31,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:31,455 INFO L225 Difference]: With dead ends: 108 [2022-04-06 14:34:31,456 INFO L226 Difference]: Without dead ends: 106 [2022-04-06 14:34:31,456 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-06 14:34:31,457 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 220 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:31,459 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 81 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:31,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-06 14:34:31,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2022-04-06 14:34:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-04-06 14:34:31,484 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2022-04-06 14:34:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:31,484 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-04-06 14:34:31,484 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-04-06 14:34:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-06 14:34:31,485 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:31,485 INFO L499 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-04-06 14:34:31,485 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-06 14:34:31,486 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:31,486 INFO L85 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 1 times [2022-04-06 14:34:31,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:31,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [893657369] [2022-04-06 14:34:31,487 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:31,487 INFO L85 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 2 times [2022-04-06 14:34:31,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:31,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948139390] [2022-04-06 14:34:31,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:31,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:31,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:31,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:31,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:31,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948139390] [2022-04-06 14:34:31,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948139390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:31,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:31,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:31,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:31,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [893657369] [2022-04-06 14:34:31,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [893657369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:31,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:31,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:31,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430597939] [2022-04-06 14:34:31,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:31,556 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:31,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:31,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:31,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:31,557 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:31,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:31,750 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2022-04-06 14:34:31,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 14:34:31,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-06 14:34:31,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:31,752 INFO L225 Difference]: With dead ends: 121 [2022-04-06 14:34:31,752 INFO L226 Difference]: Without dead ends: 119 [2022-04-06 14:34:31,752 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-06 14:34:31,753 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 215 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:31,753 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 104 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:31,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-06 14:34:31,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2022-04-06 14:34:31,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-06 14:34:31,770 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2022-04-06 14:34:31,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:31,771 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-06 14:34:31,771 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-06 14:34:31,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-06 14:34:31,772 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:31,772 INFO L499 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-04-06 14:34:31,772 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-06 14:34:31,772 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:31,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:31,772 INFO L85 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 1 times [2022-04-06 14:34:31,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:31,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [623079261] [2022-04-06 14:34:31,773 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 2 times [2022-04-06 14:34:31,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:31,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876988166] [2022-04-06 14:34:31,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:31,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:31,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:31,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:31,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876988166] [2022-04-06 14:34:31,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876988166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:31,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:31,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:31,831 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:31,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [623079261] [2022-04-06 14:34:31,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [623079261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:31,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:31,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:31,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847840034] [2022-04-06 14:34:31,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:31,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:31,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:31,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:31,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:31,833 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:31,961 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-04-06 14:34:31,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 14:34:31,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-06 14:34:31,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:31,962 INFO L225 Difference]: With dead ends: 77 [2022-04-06 14:34:31,963 INFO L226 Difference]: Without dead ends: 75 [2022-04-06 14:34:31,963 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-06 14:34:31,964 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 197 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:31,964 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 70 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:31,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-06 14:34:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-06 14:34:31,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-04-06 14:34:31,981 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2022-04-06 14:34:31,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:31,981 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-04-06 14:34:31,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:31,981 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-06 14:34:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-06 14:34:31,986 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:31,986 INFO L499 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-04-06 14:34:31,986 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-06 14:34:31,987 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:31,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 1 times [2022-04-06 14:34:31,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:31,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [324189688] [2022-04-06 14:34:31,990 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:31,990 INFO L85 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 2 times [2022-04-06 14:34:31,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:31,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724906114] [2022-04-06 14:34:31,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:31,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:32,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:32,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:32,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:32,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724906114] [2022-04-06 14:34:32,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724906114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:32,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:32,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 14:34:32,030 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:32,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [324189688] [2022-04-06 14:34:32,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [324189688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:32,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:32,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 14:34:32,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132503594] [2022-04-06 14:34:32,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:32,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 14:34:32,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:32,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 14:34:32,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 14:34:32,032 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:32,121 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-04-06 14:34:32,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 14:34:32,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-06 14:34:32,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:32,123 INFO L225 Difference]: With dead ends: 115 [2022-04-06 14:34:32,123 INFO L226 Difference]: Without dead ends: 75 [2022-04-06 14:34:32,124 INFO L912 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-04-06 14:34:32,126 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:32,126 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 78 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:32,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-06 14:34:32,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-06 14:34:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:32,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-04-06 14:34:32,141 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2022-04-06 14:34:32,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:32,142 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-04-06 14:34:32,142 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:32,142 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-06 14:34:32,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-06 14:34:32,143 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:32,143 INFO L499 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] [2022-04-06 14:34:32,144 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-06 14:34:32,144 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:32,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 1 times [2022-04-06 14:34:32,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:32,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [912741880] [2022-04-06 14:34:32,145 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 2 times [2022-04-06 14:34:32,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:32,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478825614] [2022-04-06 14:34:32,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:32,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:32,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:32,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:32,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478825614] [2022-04-06 14:34:32,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478825614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:32,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:32,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:32,236 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:32,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [912741880] [2022-04-06 14:34:32,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [912741880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:32,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:32,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:32,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440098384] [2022-04-06 14:34:32,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:32,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:32,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:32,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:32,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:32,237 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:32,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:32,345 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-06 14:34:32,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 14:34:32,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-06 14:34:32,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:32,346 INFO L225 Difference]: With dead ends: 76 [2022-04-06 14:34:32,346 INFO L226 Difference]: Without dead ends: 74 [2022-04-06 14:34:32,346 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-06 14:34:32,347 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 183 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:32,347 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 62 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:32,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-06 14:34:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-04-06 14:34:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-04-06 14:34:32,364 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2022-04-06 14:34:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:32,364 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-04-06 14:34:32,364 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-06 14:34:32,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-06 14:34:32,365 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:32,365 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:32,365 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-06 14:34:32,365 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:32,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:32,366 INFO L85 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 1 times [2022-04-06 14:34:32,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:32,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [557928161] [2022-04-06 14:34:32,367 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:32,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 2 times [2022-04-06 14:34:32,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:32,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025121746] [2022-04-06 14:34:32,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:32,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:32,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:32,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 14:34:32,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:32,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025121746] [2022-04-06 14:34:32,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025121746] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 14:34:32,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030937038] [2022-04-06 14:34:32,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 14:34:32,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 14:34:32,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 14:34:32,419 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-04-06 14:34:32,439 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-04-06 14:34:32,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 14:34:32,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 14:34:32,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 14:34:32,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 14:34:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 14:34:32,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 14:34:32,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 14:34:32,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030937038] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 14:34:32,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 14:34:32,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-06 14:34:32,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:32,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [557928161] [2022-04-06 14:34:32,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [557928161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:32,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:32,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:32,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234698154] [2022-04-06 14:34:32,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:32,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:32,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:32,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:32,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 14:34:32,770 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:32,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:32,938 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-04-06 14:34:32,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 14:34:32,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-06 14:34:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:32,940 INFO L225 Difference]: With dead ends: 111 [2022-04-06 14:34:32,940 INFO L226 Difference]: Without dead ends: 109 [2022-04-06 14:34:32,941 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-06 14:34:32,941 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 146 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:32,941 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 92 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:32,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-06 14:34:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2022-04-06 14:34:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-06 14:34:32,967 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2022-04-06 14:34:32,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:32,967 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-06 14:34:32,968 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-06 14:34:32,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-06 14:34:32,969 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:32,969 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:32,995 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-04-06 14:34:33,192 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-06 14:34:33,193 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:33,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:33,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 1 times [2022-04-06 14:34:33,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:33,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [710850113] [2022-04-06 14:34:33,194 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:33,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 2 times [2022-04-06 14:34:33,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:33,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170490257] [2022-04-06 14:34:33,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:33,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:33,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:33,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:33,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170490257] [2022-04-06 14:34:33,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170490257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:33,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:33,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:33,253 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:33,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [710850113] [2022-04-06 14:34:33,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [710850113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:33,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:33,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:33,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198247254] [2022-04-06 14:34:33,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:33,254 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:33,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:33,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:33,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:33,254 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:33,359 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-06 14:34:33,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 14:34:33,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-06 14:34:33,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:33,360 INFO L225 Difference]: With dead ends: 70 [2022-04-06 14:34:33,360 INFO L226 Difference]: Without dead ends: 68 [2022-04-06 14:34:33,360 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-06 14:34:33,361 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 170 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:33,361 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 60 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-06 14:34:33,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-06 14:34:33,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-04-06 14:34:33,378 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2022-04-06 14:34:33,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:33,378 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-04-06 14:34:33,378 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-06 14:34:33,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-06 14:34:33,379 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:33,379 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:33,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-06 14:34:33,379 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:33,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:33,380 INFO L85 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 1 times [2022-04-06 14:34:33,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:33,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1658353604] [2022-04-06 14:34:33,380 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:33,380 INFO L85 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 2 times [2022-04-06 14:34:33,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:33,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090199025] [2022-04-06 14:34:33,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:33,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:33,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 14:34:33,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:33,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090199025] [2022-04-06 14:34:33,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090199025] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 14:34:33,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464100719] [2022-04-06 14:34:33,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 14:34:33,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 14:34:33,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 14:34:33,425 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-04-06 14:34:33,454 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-04-06 14:34:33,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 14:34:33,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 14:34:33,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 14:34:33,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 14:34:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 14:34:33,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 14:34:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 14:34:33,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464100719] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 14:34:33,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 14:34:33,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-06 14:34:33,623 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:33,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1658353604] [2022-04-06 14:34:33,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1658353604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:33,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:33,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026742086] [2022-04-06 14:34:33,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:33,624 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:33,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:33,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:33,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 14:34:33,625 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:33,724 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-06 14:34:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 14:34:33,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-06 14:34:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:33,725 INFO L225 Difference]: With dead ends: 69 [2022-04-06 14:34:33,725 INFO L226 Difference]: Without dead ends: 67 [2022-04-06 14:34:33,726 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-06 14:34:33,726 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 130 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:33,726 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 61 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 14:34:33,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-06 14:34:33,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-04-06 14:34:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-04-06 14:34:33,742 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2022-04-06 14:34:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:33,743 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-04-06 14:34:33,743 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-04-06 14:34:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-06 14:34:33,743 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:33,743 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:33,769 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-04-06 14:34:33,957 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-06 14:34:33,958 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:33,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:33,958 INFO L85 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 1 times [2022-04-06 14:34:33,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:33,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1817792195] [2022-04-06 14:34:33,959 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:33,959 INFO L85 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 2 times [2022-04-06 14:34:33,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:33,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663911024] [2022-04-06 14:34:33,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:33,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:34,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:34,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:34,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663911024] [2022-04-06 14:34:34,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663911024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:34,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:34,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:34,007 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:34,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1817792195] [2022-04-06 14:34:34,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1817792195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:34,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:34,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:34,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603324766] [2022-04-06 14:34:34,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:34,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:34,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:34,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:34,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:34,009 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:34,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:34,113 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-06 14:34:34,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 14:34:34,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-06 14:34:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:34,114 INFO L225 Difference]: With dead ends: 63 [2022-04-06 14:34:34,115 INFO L226 Difference]: Without dead ends: 61 [2022-04-06 14:34:34,115 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-06 14:34:34,116 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 119 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:34,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 59 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 14:34:34,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-06 14:34:34,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-04-06 14:34:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-06 14:34:34,130 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2022-04-06 14:34:34,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:34,131 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-06 14:34:34,131 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-06 14:34:34,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-06 14:34:34,132 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:34,132 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:34,132 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-06 14:34:34,132 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:34,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:34,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 1 times [2022-04-06 14:34:34,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:34,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1138962603] [2022-04-06 14:34:34,133 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:34,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 2 times [2022-04-06 14:34:34,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:34,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825581644] [2022-04-06 14:34:34,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:34,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:34,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:34,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:34,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825581644] [2022-04-06 14:34:34,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825581644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:34,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:34,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:34,194 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:34,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1138962603] [2022-04-06 14:34:34,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1138962603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:34,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:34,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:34,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847423853] [2022-04-06 14:34:34,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:34,195 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 14:34:34,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:34,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 14:34:34,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-06 14:34:34,196 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:34,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:34,322 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-06 14:34:34,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 14:34:34,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-06 14:34:34,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:34,323 INFO L225 Difference]: With dead ends: 71 [2022-04-06 14:34:34,323 INFO L226 Difference]: Without dead ends: 69 [2022-04-06 14:34:34,325 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-06 14:34:34,326 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 153 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:34,326 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 62 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-06 14:34:34,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-04-06 14:34:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-04-06 14:34:34,340 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2022-04-06 14:34:34,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:34,340 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-04-06 14:34:34,340 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-04-06 14:34:34,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-06 14:34:34,341 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:34,341 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:34,341 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-06 14:34:34,341 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:34,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:34,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 1 times [2022-04-06 14:34:34,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:34,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [729054047] [2022-04-06 14:34:34,344 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:34,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 2 times [2022-04-06 14:34:34,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:34,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781434748] [2022-04-06 14:34:34,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:34,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:34,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:34,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:34,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:34,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781434748] [2022-04-06 14:34:34,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781434748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:34,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:34,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:34,400 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:34,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [729054047] [2022-04-06 14:34:34,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [729054047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:34,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:34,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:34,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062629192] [2022-04-06 14:34:34,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:34,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:34,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:34,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:34,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:34,402 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:34,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:34,599 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-04-06 14:34:34,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 14:34:34,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-06 14:34:34,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:34,600 INFO L225 Difference]: With dead ends: 91 [2022-04-06 14:34:34,601 INFO L226 Difference]: Without dead ends: 89 [2022-04-06 14:34:34,601 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-06 14:34:34,601 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 178 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:34,602 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 60 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:34,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-06 14:34:34,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2022-04-06 14:34:34,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-04-06 14:34:34,620 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2022-04-06 14:34:34,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:34,620 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-04-06 14:34:34,621 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:34,621 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-06 14:34:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-06 14:34:34,621 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:34,621 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:34,621 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-06 14:34:34,622 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:34,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:34,622 INFO L85 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 1 times [2022-04-06 14:34:34,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:34,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [131997078] [2022-04-06 14:34:34,623 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:34,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 2 times [2022-04-06 14:34:34,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:34,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756959374] [2022-04-06 14:34:34,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:34,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:34,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:34,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:34,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756959374] [2022-04-06 14:34:34,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756959374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:34,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:34,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:34,700 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:34,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [131997078] [2022-04-06 14:34:34,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [131997078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:34,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:34,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:34,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754486794] [2022-04-06 14:34:34,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:34,701 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:34,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:34,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:34,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:34,702 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:34,834 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-06 14:34:34,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 14:34:34,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-06 14:34:34,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:34,835 INFO L225 Difference]: With dead ends: 61 [2022-04-06 14:34:34,835 INFO L226 Difference]: Without dead ends: 59 [2022-04-06 14:34:34,835 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-06 14:34:34,836 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 110 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:34,836 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 67 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-06 14:34:34,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-06 14:34:34,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:34,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-04-06 14:34:34,851 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2022-04-06 14:34:34,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:34,852 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-04-06 14:34:34,852 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:34,852 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-06 14:34:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-06 14:34:34,852 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:34,852 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:34,853 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-06 14:34:34,853 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:34,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:34,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 1 times [2022-04-06 14:34:34,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:34,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [931824616] [2022-04-06 14:34:34,854 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:34,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 2 times [2022-04-06 14:34:34,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:34,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917468141] [2022-04-06 14:34:34,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:34,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:34,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:34,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:34,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917468141] [2022-04-06 14:34:34,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917468141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:34,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:34,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 14:34:34,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:34,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [931824616] [2022-04-06 14:34:34,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [931824616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:34,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:34,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 14:34:34,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816861647] [2022-04-06 14:34:34,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:34,910 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 14:34:34,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:34,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 14:34:34,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 14:34:34,911 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:35,031 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-06 14:34:35,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 14:34:35,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-06 14:34:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:35,033 INFO L225 Difference]: With dead ends: 70 [2022-04-06 14:34:35,033 INFO L226 Difference]: Without dead ends: 68 [2022-04-06 14:34:35,033 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-06 14:34:35,035 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:35,035 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 77 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:35,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-06 14:34:35,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2022-04-06 14:34:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:35,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-04-06 14:34:35,050 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2022-04-06 14:34:35,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:35,050 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-04-06 14:34:35,051 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-06 14:34:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-06 14:34:35,051 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:35,051 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:35,051 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-06 14:34:35,053 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:35,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:35,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 1 times [2022-04-06 14:34:35,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:35,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1904295757] [2022-04-06 14:34:35,054 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:35,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 2 times [2022-04-06 14:34:35,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:35,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543587020] [2022-04-06 14:34:35,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:35,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:35,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:35,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:35,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:35,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543587020] [2022-04-06 14:34:35,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543587020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:35,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:35,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:35,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:35,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1904295757] [2022-04-06 14:34:35,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1904295757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:35,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:35,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:35,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375891373] [2022-04-06 14:34:35,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:35,096 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:35,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:35,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:35,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:35,097 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:35,216 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-04-06 14:34:35,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 14:34:35,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-06 14:34:35,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:35,217 INFO L225 Difference]: With dead ends: 66 [2022-04-06 14:34:35,217 INFO L226 Difference]: Without dead ends: 64 [2022-04-06 14:34:35,218 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-06 14:34:35,218 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 91 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:35,218 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 74 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-06 14:34:35,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-04-06 14:34:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-06 14:34:35,232 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2022-04-06 14:34:35,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:35,233 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-06 14:34:35,233 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:35,233 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-06 14:34:35,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-06 14:34:35,233 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:35,233 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:35,233 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-06 14:34:35,234 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:35,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:35,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 1 times [2022-04-06 14:34:35,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:35,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [483827572] [2022-04-06 14:34:35,235 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:35,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 2 times [2022-04-06 14:34:35,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:35,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850612895] [2022-04-06 14:34:35,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:35,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:35,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:35,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:35,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850612895] [2022-04-06 14:34:35,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850612895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:35,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:35,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:35,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:35,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [483827572] [2022-04-06 14:34:35,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [483827572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:35,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:35,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:35,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687109464] [2022-04-06 14:34:35,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:35,287 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:35,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:35,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:35,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:35,288 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:35,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:35,521 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-04-06 14:34:35,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 14:34:35,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-06 14:34:35,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:35,522 INFO L225 Difference]: With dead ends: 88 [2022-04-06 14:34:35,522 INFO L226 Difference]: Without dead ends: 86 [2022-04-06 14:34:35,522 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-06 14:34:35,523 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 123 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:35,523 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 62 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:35,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-06 14:34:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2022-04-06 14:34:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-04-06 14:34:35,539 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2022-04-06 14:34:35,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:35,539 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-04-06 14:34:35,539 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-04-06 14:34:35,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-06 14:34:35,540 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:35,540 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:35,540 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-06 14:34:35,540 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:35,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:35,541 INFO L85 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 1 times [2022-04-06 14:34:35,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:35,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [80379311] [2022-04-06 14:34:35,541 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:35,541 INFO L85 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 2 times [2022-04-06 14:34:35,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:35,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900089913] [2022-04-06 14:34:35,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:35,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:35,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:35,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:35,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900089913] [2022-04-06 14:34:35,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900089913] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 14:34:35,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65331508] [2022-04-06 14:34:35,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 14:34:35,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 14:34:35,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 14:34:35,593 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-04-06 14:34:35,600 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-04-06 14:34:35,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 14:34:35,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 14:34:35,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-06 14:34:35,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 14:34:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:35,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 14:34:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:35,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65331508] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 14:34:35,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 14:34:35,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-06 14:34:35,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:35,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [80379311] [2022-04-06 14:34:35,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [80379311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:35,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:35,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:35,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585059432] [2022-04-06 14:34:35,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:35,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:35,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:35,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:35,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 14:34:35,875 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:36,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:36,005 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2022-04-06 14:34:36,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 14:34:36,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-06 14:34:36,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:36,006 INFO L225 Difference]: With dead ends: 60 [2022-04-06 14:34:36,006 INFO L226 Difference]: Without dead ends: 58 [2022-04-06 14:34:36,006 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-06 14:34:36,007 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 84 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:36,007 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 49 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:36,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-06 14:34:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-06 14:34:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-04-06 14:34:36,023 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2022-04-06 14:34:36,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:36,023 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-04-06 14:34:36,024 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:36,024 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-06 14:34:36,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-06 14:34:36,024 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:36,024 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:36,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-06 14:34:36,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 14:34:36,239 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:36,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:36,240 INFO L85 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 1 times [2022-04-06 14:34:36,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:36,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [119696058] [2022-04-06 14:34:36,240 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:36,241 INFO L85 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 2 times [2022-04-06 14:34:36,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:36,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135489497] [2022-04-06 14:34:36,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:36,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:36,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:36,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:36,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135489497] [2022-04-06 14:34:36,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135489497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:36,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:36,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:36,291 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:36,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [119696058] [2022-04-06 14:34:36,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [119696058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:36,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:36,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:36,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495574975] [2022-04-06 14:34:36,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:36,292 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:36,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:36,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:36,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:36,292 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:36,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:36,446 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-06 14:34:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 14:34:36,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-06 14:34:36,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:36,447 INFO L225 Difference]: With dead ends: 69 [2022-04-06 14:34:36,448 INFO L226 Difference]: Without dead ends: 67 [2022-04-06 14:34:36,448 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-06 14:34:36,448 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:36,449 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 65 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:36,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-06 14:34:36,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2022-04-06 14:34:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-04-06 14:34:36,464 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2022-04-06 14:34:36,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:36,465 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-04-06 14:34:36,465 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:36,465 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-06 14:34:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-06 14:34:36,465 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:36,465 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:36,466 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-06 14:34:36,466 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 14:34:36,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:36,466 INFO L85 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 1 times [2022-04-06 14:34:36,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:36,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1585878331] [2022-04-06 14:34:36,467 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:36,467 INFO L85 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 2 times [2022-04-06 14:34:36,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:36,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2267561] [2022-04-06 14:34:36,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:36,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:36,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:36,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-06 14:34:36,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:36,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2267561] [2022-04-06 14:34:36,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2267561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:36,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:36,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:36,522 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:36,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1585878331] [2022-04-06 14:34:36,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1585878331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:36,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:36,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:36,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510193608] [2022-04-06 14:34:36,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:36,523 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:36,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:36,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:36,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:36,524 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:36,730 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-06 14:34:36,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 14:34:36,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-06 14:34:36,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:36,730 INFO L225 Difference]: With dead ends: 75 [2022-04-06 14:34:36,730 INFO L226 Difference]: Without dead ends: 0 [2022-04-06 14:34:36,731 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-06 14:34:36,731 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 88 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:36,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 55 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 14:34:36,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-06 14:34:36,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-06 14:34:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-04-06 14:34:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-06 14:34:36,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-04-06 14:34:36,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:36,733 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-06 14:34:36,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-06 14:34:36,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-06 14:34:36,735 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-04-06 14:34:36,736 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-04-06 14:34:36,736 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-04-06 14:34:36,736 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-04-06 14:34:36,736 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-04-06 14:34:36,736 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-04-06 14:34:36,737 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-04-06 14:34:36,737 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-04-06 14:34:36,737 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-04-06 14:34:36,737 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-04-06 14:34:36,737 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-04-06 14:34:36,737 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-04-06 14:34:36,737 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-04-06 14:34:36,738 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-04-06 14:34:36,738 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-04-06 14:34:36,738 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-04-06 14:34:36,738 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-04-06 14:34:36,738 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-04-06 14:34:36,738 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-06 14:34:36,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-06 14:35:13,629 WARN L232 SmtUtils]: Spent 21.91s on a formula simplification. DAG size of input: 130 DAG size of output: 125 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-06 14:35:24,363 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-06 14:35:24,363 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-06 14:35:24,364 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-06 14:35:24,364 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-06 14:35:24,364 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-06 14:35:24,364 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-06 14:35:24,364 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-06 14:35:24,364 INFO L878 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) the Hoare annotation is: false [2022-04-06 14:35:24,364 INFO L878 garLoopResultBuilder]: At program point mainEXIT(lines 13 439) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2022-04-06 14:35:24,364 INFO L878 garLoopResultBuilder]: At program point L374(line 374) the Hoare annotation is: false [2022-04-06 14:35:24,364 INFO L878 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: false [2022-04-06 14:35:24,365 INFO L878 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: false [2022-04-06 14:35:24,365 INFO L878 garLoopResultBuilder]: At program point L143(lines 143 362) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (<= main_~main__urilen~0 main_~main__cp~0)) (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= |old(~__return_375~0)| ~__return_375~0)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4 .cse5)))) [2022-04-06 14:35:24,365 INFO L878 garLoopResultBuilder]: At program point L234(lines 234 338) the Hoare annotation is: (let ((.cse2 (= main_~__VERIFIER_assert__cond~9 1)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse6 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse7 (= main_~__VERIFIER_assert__cond~3 1)) (.cse8 (= |old(~__return_375~0)| ~__return_375~0)) (.cse0 (= main_~main__c~0 0)) (.cse16 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse11 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse12 (< 0 main_~main__scheme~0)) (.cse13 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse14 (<= 1 main_~main__cp~0)) (.cse15 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and (let ((.cse1 (let ((.cse9 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse10 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and .cse0 .cse1) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse1))) (not (= main_~__VERIFIER_assert__cond~10 0)) .cse16) (and .cse2 .cse3 (= main_~__VERIFIER_assert__cond~8 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse16 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-04-06 14:35:24,365 INFO L878 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) the Hoare annotation is: false [2022-04-06 14:35:24,365 INFO L878 garLoopResultBuilder]: At program point L135(lines 135 397) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5))) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0)) [2022-04-06 14:35:24,365 INFO L878 garLoopResultBuilder]: At program point L226(line 226) the Hoare annotation is: false [2022-04-06 14:35:24,365 INFO L878 garLoopResultBuilder]: At program point L61(lines 61 427) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-06 14:35:24,365 INFO L878 garLoopResultBuilder]: At program point L284(line 284) the Hoare annotation is: false [2022-04-06 14:35:24,366 INFO L878 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) the Hoare annotation is: false [2022-04-06 14:35:24,366 INFO L878 garLoopResultBuilder]: At program point L53(lines 53 433) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-06 14:35:24,366 INFO L878 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: false [2022-04-06 14:35:24,366 INFO L878 garLoopResultBuilder]: At program point L177(line 177) the Hoare annotation is: false [2022-04-06 14:35:24,366 INFO L878 garLoopResultBuilder]: At program point L111(lines 111 405) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (= main_~__VERIFIER_assert__cond~2 1) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-04-06 14:35:24,366 INFO L878 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) the Hoare annotation is: false [2022-04-06 14:35:24,366 INFO L878 garLoopResultBuilder]: At program point L392(lines 129 403) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5))) (< main_~main__cp~0 main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0)) [2022-04-06 14:35:24,366 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 354) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0))) [2022-04-06 14:35:24,367 INFO L878 garLoopResultBuilder]: At program point L384(lines 384 393) the Hoare annotation is: (and (not (<= main_~main__scheme~0 0)) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~17 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~16 0)) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-06 14:35:24,367 INFO L878 garLoopResultBuilder]: At program point L95(lines 95 412) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-04-06 14:35:24,367 INFO L878 garLoopResultBuilder]: At program point L29(lines 29 437) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-06 14:35:24,367 INFO L878 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) the Hoare annotation is: false [2022-04-06 14:35:24,367 INFO L878 garLoopResultBuilder]: At program point L145(line 145) the Hoare annotation is: false [2022-04-06 14:35:24,367 INFO L878 garLoopResultBuilder]: At program point L401(lines 131 402) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (not (<= main_~main__urilen~0 main_~main__cp~0))) [2022-04-06 14:35:24,367 INFO L878 garLoopResultBuilder]: At program point mainFINAL(lines 13 439) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2022-04-06 14:35:24,368 INFO L878 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) the Hoare annotation is: false [2022-04-06 14:35:24,368 INFO L878 garLoopResultBuilder]: At program point L104(lines 104 411) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-04-06 14:35:24,368 INFO L878 garLoopResultBuilder]: At program point L71(lines 71 416) the Hoare annotation is: (and (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0)) [2022-04-06 14:35:24,368 INFO L878 garLoopResultBuilder]: At program point L327(lines 262 328) the Hoare annotation is: (and (let ((.cse0 (let ((.cse1 (= main_~__VERIFIER_assert__cond~9 1)) (.cse2 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse6 (= main_~__VERIFIER_assert__cond~3 1)) (.cse7 (not (= main_~__VERIFIER_assert__cond~9 0))) (.cse8 (= |old(~__return_375~0)| ~__return_375~0)) (.cse9 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse10 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse11 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse13 (< 0 main_~main__scheme~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse15 (<= 1 main_~main__cp~0)) (.cse16 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and (= main_~main__c~0 0) .cse0) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse0))) (= main_~__VERIFIER_assert__cond~10 1)) [2022-04-06 14:35:24,368 INFO L878 garLoopResultBuilder]: At program point L294(lines 294 318) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~14 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-06 14:35:24,368 INFO L878 garLoopResultBuilder]: At program point L162(lines 162 359) the Hoare annotation is: (let ((.cse0 (let ((.cse6 (not (<= main_~main__scheme~0 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse9 (<= 1 main_~main__cp~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse6 .cse7 .cse8 (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0)) .cse9 .cse10) (and .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse9 .cse10)))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (= |old(~__return_375~0)| ~__return_375~0)) (.cse1 (+ main_~main__cp~0 1)) (.cse5 (not (= main_~__VERIFIER_assert__cond~5 0)))) (or (and .cse0 (= main_~main__urilen~0 .cse1) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (< .cse1 main_~main__urilen~0) .cse5))) [2022-04-06 14:35:24,368 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) the Hoare annotation is: false [2022-04-06 14:35:24,368 INFO L878 garLoopResultBuilder]: At program point L63(lines 63 422) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-06 14:35:24,368 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 13 439) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-06 14:35:24,368 INFO L878 garLoopResultBuilder]: At program point L253(lines 253 329) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 main_~main__c~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= main_~main__c~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2022-04-06 14:35:24,369 INFO L878 garLoopResultBuilder]: At program point L187(lines 187 355) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0))) [2022-04-06 14:35:24,369 INFO L878 garLoopResultBuilder]: At program point L410(lines 104 411) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2022-04-06 14:35:24,369 INFO L878 garLoopResultBuilder]: At program point L212(lines 212 346) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (= main_~__VERIFIER_assert__cond~8 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (= main_~main__c~0 0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-06 14:35:24,369 INFO L878 garLoopResultBuilder]: At program point L113(line 113) the Hoare annotation is: false [2022-04-06 14:35:24,369 INFO L878 garLoopResultBuilder]: At program point L47(lines 47 434) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-06 14:35:24,369 INFO L878 garLoopResultBuilder]: At program point L270(lines 270 322) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-06 14:35:24,369 INFO L878 garLoopResultBuilder]: At program point L204(lines 204 353) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-06 14:35:24,369 INFO L878 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) the Hoare annotation is: false [2022-04-06 14:35:24,369 INFO L878 garLoopResultBuilder]: At program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) the Hoare annotation is: false [2022-04-06 14:35:24,369 INFO L878 garLoopResultBuilder]: At program point L262(lines 262 328) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 main_~main__c~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= main_~main__c~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2022-04-06 14:35:24,369 INFO L878 garLoopResultBuilder]: At program point L386(line 386) the Hoare annotation is: false [2022-04-06 14:35:24,369 INFO L878 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: false [2022-04-06 14:35:24,370 INFO L878 garLoopResultBuilder]: At program point L155(lines 155 360) the Hoare annotation is: (let ((.cse0 (let ((.cse6 (not (<= main_~main__scheme~0 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse9 (<= 1 main_~main__cp~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse6 .cse7 .cse8 (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0)) .cse9 .cse10) (and .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse9 .cse10)))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (= |old(~__return_375~0)| ~__return_375~0)) (.cse1 (+ main_~main__cp~0 1)) (.cse5 (not (= main_~__VERIFIER_assert__cond~5 0)))) (or (and .cse0 (= main_~main__urilen~0 .cse1) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (< .cse1 main_~main__urilen~0) .cse5))) [2022-04-06 14:35:24,370 INFO L878 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) the Hoare annotation is: false [2022-04-06 14:35:24,370 INFO L878 garLoopResultBuilder]: At program point L23(lines 23 438) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-06 14:35:24,370 INFO L878 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) the Hoare annotation is: false [2022-04-06 14:35:24,370 INFO L878 garLoopResultBuilder]: At program point L296(line 296) the Hoare annotation is: false [2022-04-06 14:35:24,370 INFO L878 garLoopResultBuilder]: At program point L65(lines 65 417) the Hoare annotation is: (and (<= 0 main_~main__scheme~0) (= |old(~__return_375~0)| ~__return_375~0)) [2022-04-06 14:35:24,370 INFO L878 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) the Hoare annotation is: false [2022-04-06 14:35:24,370 INFO L878 garLoopResultBuilder]: At program point L255(line 255) the Hoare annotation is: false [2022-04-06 14:35:24,371 INFO L878 garLoopResultBuilder]: At program point L189(line 189) the Hoare annotation is: false [2022-04-06 14:35:24,371 INFO L878 garLoopResultBuilder]: At program point L123(lines 123 403) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (= main_~__VERIFIER_assert__cond~2 1) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-04-06 14:35:24,371 INFO L878 garLoopResultBuilder]: At program point L214(line 214) the Hoare annotation is: false [2022-04-06 14:35:24,371 INFO L878 garLoopResultBuilder]: At program point L272(line 272) the Hoare annotation is: false [2022-04-06 14:35:24,371 INFO L878 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) the Hoare annotation is: false [2022-04-06 14:35:24,371 INFO L878 garLoopResultBuilder]: At program point L41(lines 41 435) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-06 14:35:24,371 INFO L878 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) the Hoare annotation is: false [2022-04-06 14:35:24,371 INFO L878 garLoopResultBuilder]: At program point L157(line 157) the Hoare annotation is: false [2022-04-06 14:35:24,371 INFO L878 garLoopResultBuilder]: At program point L372(lines 372 395) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (not (= main_~__VERIFIER_assert__cond~16 0))) (.cse5 (<= 1 main_~main__cp~0)) (.cse6 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~__VERIFIER_assert__cond~2 1) .cse5 .cse6))) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0)) [2022-04-06 14:35:24,372 INFO L878 garLoopResultBuilder]: At program point L83(lines 83 414) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-04-06 14:35:24,372 INFO L878 garLoopResultBuilder]: At program point L306(lines 306 316) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~14 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~15 0))) [2022-04-06 14:35:24,372 INFO L878 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) the Hoare annotation is: false [2022-04-06 14:35:24,372 INFO L878 garLoopResultBuilder]: At program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) the Hoare annotation is: false [2022-04-06 14:35:24,372 INFO L878 garLoopResultBuilder]: At program point L224(lines 224 344) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (= main_~__VERIFIER_assert__cond~8 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (= main_~main__c~0 0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-06 14:35:24,372 INFO L878 garLoopResultBuilder]: At program point L125(line 125) the Hoare annotation is: false [2022-04-06 14:35:24,372 INFO L878 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) the Hoare annotation is: false [2022-04-06 14:35:24,373 INFO L878 garLoopResultBuilder]: At program point L59(lines 59 432) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-06 14:35:24,373 INFO L878 garLoopResultBuilder]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse9 (= main_~main__c~0 0)) (.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (< main_~main__cp~0 main_~main__urilen~0)) (.cse6 (= main_~__VERIFIER_assert__cond~3 1)) (.cse7 (= |old(~__return_375~0)| ~__return_375~0)) (.cse8 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~8 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0) .cse10 .cse11 .cse12 .cse13 .cse14) (and (let ((.cse15 (let ((.cse16 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse8 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse15) (and .cse9 .cse15))) (not (= main_~__VERIFIER_assert__cond~10 0))))) [2022-04-06 14:35:24,373 INFO L878 garLoopResultBuilder]: At program point L282(lines 282 320) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-06 14:35:24,373 INFO L878 garLoopResultBuilder]: At program point L241(lines 241 331) the Hoare annotation is: (let ((.cse14 (let ((.cse18 (<= main_~main__urilen~0 main_~main__cp~0))) (or (and (= main_~__VERIFIER_assert__cond~10 0) .cse18) (and (= main_~__VERIFIER_assert__cond~10 1) (not .cse18))))) (.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (= main_~main__c~0 0)) (.cse8 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse9 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse10 (< 0 main_~main__scheme~0)) (.cse11 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse12 (<= 1 main_~main__cp~0)) (.cse13 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0))) (or (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~8 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse14 (let ((.cse16 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse17 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 main_~main__c~0) .cse16 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15)))))) [2022-04-06 14:35:24,373 INFO L878 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) the Hoare annotation is: false [2022-04-06 14:35:24,373 INFO L878 garLoopResultBuilder]: At program point L175(lines 175 357) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (not (= main_~__VERIFIER_assert__cond~4 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0))) [2022-04-06 14:35:24,374 INFO L878 garLoopResultBuilder]: At program point L35(lines 35 436) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-06 14:35:24,374 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-06 14:35:24,374 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-06 14:35:24,374 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-06 14:35:24,374 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-06 14:35:24,374 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-06 14:35:24,374 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-06 14:35:24,374 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-06 14:35:24,377 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-06 14:35:24,378 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 14:35:24,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 02:35:24 BoogieIcfgContainer [2022-04-06 14:35:24,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 14:35:24,399 INFO L158 Benchmark]: Toolchain (without parser) took 56024.78ms. Allocated memory was 179.3MB in the beginning and 580.9MB in the end (delta: 401.6MB). Free memory was 132.2MB in the beginning and 305.6MB in the end (delta: -173.4MB). Peak memory consumption was 327.0MB. Max. memory is 8.0GB. [2022-04-06 14:35:24,399 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 14:35:24,400 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.06ms. Allocated memory is still 179.3MB. Free memory was 132.0MB in the beginning and 149.3MB in the end (delta: -17.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-06 14:35:24,400 INFO L158 Benchmark]: Boogie Preprocessor took 37.48ms. Allocated memory is still 179.3MB. Free memory was 149.3MB in the beginning and 147.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-06 14:35:24,400 INFO L158 Benchmark]: RCFGBuilder took 397.31ms. Allocated memory is still 179.3MB. Free memory was 147.2MB in the beginning and 131.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-04-06 14:35:24,401 INFO L158 Benchmark]: TraceAbstraction took 55169.72ms. Allocated memory was 179.3MB in the beginning and 580.9MB in the end (delta: 401.6MB). Free memory was 131.0MB in the beginning and 305.6MB in the end (delta: -174.6MB). Peak memory consumption was 326.0MB. Max. memory is 8.0GB. [2022-04-06 14:35:24,402 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 402.06ms. Allocated memory is still 179.3MB. Free memory was 132.0MB in the beginning and 149.3MB in the end (delta: -17.2MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.48ms. Allocated memory is still 179.3MB. Free memory was 149.3MB in the beginning and 147.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 397.31ms. Allocated memory is still 179.3MB. Free memory was 147.2MB in the beginning and 131.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 55169.72ms. Allocated memory was 179.3MB in the beginning and 580.9MB in the end (delta: 401.6MB). Free memory was 131.0MB in the beginning and 305.6MB in the end (delta: -174.6MB). Peak memory consumption was 326.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 94 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 55.1s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 47.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3590 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3590 mSDsluCounter, 1690 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 365 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2538 IncrementalHoareTripleChecker+Invalid, 2725 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 1325 mSDtfsCounter, 2538 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 269 SyntacticMatches, 18 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 296 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 87 LocationsWithAnnotation, 87 PreInvPairs, 140 NumberOfFragments, 2985 HoareAnnotationTreeSize, 87 FomulaSimplifications, 286041 FormulaSimplificationTreeSizeReduction, 44.1s HoareSimplificationTime, 87 FomulaSimplificationsInter, 619907 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: ((main__c == 0 && (((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen))) || ((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && (((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)))) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && main__cp < main__urilen) && \old(__return_375) == __return_375 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(main__urilen <= main__cp) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) && \old(__return_375) == __return_375 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen))) || (main__c == 0 && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)))) && !(__VERIFIER_assert__cond == 0)) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: !(__VERIFIER_assert__cond == 0) || \old(__return_375) == __return_375 RESULT: Ultimate proved your program to be correct! [2022-04-06 14:35:24,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...