/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-get-tag.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-5d317bd [2022-03-19 02:35:47,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-19 02:35:47,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-19 02:35:47,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-19 02:35:47,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-19 02:35:47,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-19 02:35:47,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-19 02:35:47,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-19 02:35:47,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-19 02:35:47,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-19 02:35:47,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-19 02:35:47,171 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-19 02:35:47,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-19 02:35:47,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-19 02:35:47,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-19 02:35:47,177 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-19 02:35:47,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-19 02:35:47,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-19 02:35:47,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-19 02:35:47,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-19 02:35:47,187 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-19 02:35:47,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-19 02:35:47,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-19 02:35:47,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-19 02:35:47,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-19 02:35:47,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-19 02:35:47,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-19 02:35:47,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-19 02:35:47,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-19 02:35:47,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-19 02:35:47,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-19 02:35:47,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-19 02:35:47,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-19 02:35:47,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-19 02:35:47,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-19 02:35:47,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-19 02:35:47,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-19 02:35:47,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-19 02:35:47,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-19 02:35:47,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-19 02:35:47,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-19 02:35:47,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-19 02:35:47,207 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-03-19 02:35:47,217 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-19 02:35:47,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-19 02:35:47,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-19 02:35:47,219 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-19 02:35:47,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-19 02:35:47,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-19 02:35:47,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-19 02:35:47,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-19 02:35:47,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-19 02:35:47,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-19 02:35:47,220 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-19 02:35:47,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-19 02:35:47,221 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-19 02:35:47,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-19 02:35:47,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-19 02:35:47,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-19 02:35:47,221 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-19 02:35:47,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-19 02:35:47,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 02:35:47,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-19 02:35:47,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-19 02:35:47,222 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-19 02:35:47,222 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-19 02:35:47,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-19 02:35:47,222 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-03-19 02:35:47,222 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-03-19 02:35:47,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-19 02:35:47,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-19 02:35:47,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-19 02:35:47,462 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-19 02:35:47,462 INFO L275 PluginConnector]: CDTParser initialized [2022-03-19 02:35:47,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-03-19 02:35:47,533 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398622d20/fdb02a15367440dcb57a09352098e1de/FLAGf2ed6a7b5 [2022-03-19 02:35:47,956 INFO L306 CDTParser]: Found 1 translation units. [2022-03-19 02:35:47,956 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-03-19 02:35:47,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398622d20/fdb02a15367440dcb57a09352098e1de/FLAGf2ed6a7b5 [2022-03-19 02:35:48,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398622d20/fdb02a15367440dcb57a09352098e1de [2022-03-19 02:35:48,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-19 02:35:48,335 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-19 02:35:48,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-19 02:35:48,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-19 02:35:48,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-19 02:35:48,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 02:35:48" (1/1) ... [2022-03-19 02:35:48,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd8619a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:48, skipping insertion in model container [2022-03-19 02:35:48,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.03 02:35:48" (1/1) ... [2022-03-19 02:35:48,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-19 02:35:48,405 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-19 02:35:48,561 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-get-tag.i.p+lhb-reducer.c[919,932] [2022-03-19 02:35:48,565 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-get-tag.i.p+lhb-reducer.c[1134,1147] [2022-03-19 02:35:48,569 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-get-tag.i.p+lhb-reducer.c[2208,2221] [2022-03-19 02:35:48,570 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-get-tag.i.p+lhb-reducer.c[2423,2436] [2022-03-19 02:35:48,572 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-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-03-19 02:35:48,573 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-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-03-19 02:35:48,577 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-get-tag.i.p+lhb-reducer.c[3435,3448] [2022-03-19 02:35:48,578 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-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-03-19 02:35:48,584 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-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-03-19 02:35:48,585 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-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-03-19 02:35:48,587 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-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-03-19 02:35:48,588 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-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-03-19 02:35:48,648 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-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-03-19 02:35:48,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-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-03-19 02:35:48,652 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-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-03-19 02:35:48,653 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-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-03-19 02:35:48,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 02:35:48,669 INFO L203 MainTranslator]: Completed pre-run [2022-03-19 02:35:48,681 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-get-tag.i.p+lhb-reducer.c[919,932] [2022-03-19 02:35:48,682 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-get-tag.i.p+lhb-reducer.c[1134,1147] [2022-03-19 02:35:48,690 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-get-tag.i.p+lhb-reducer.c[2208,2221] [2022-03-19 02:35:48,692 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-get-tag.i.p+lhb-reducer.c[2423,2436] [2022-03-19 02:35:48,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-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-03-19 02:35:48,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-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-03-19 02:35:48,696 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-get-tag.i.p+lhb-reducer.c[3435,3448] [2022-03-19 02:35:48,698 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-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-03-19 02:35:48,701 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-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-03-19 02:35:48,702 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-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-03-19 02:35:48,703 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-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-03-19 02:35:48,704 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-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-03-19 02:35:48,730 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-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-03-19 02:35:48,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-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-03-19 02:35:48,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-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-03-19 02:35:48,734 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-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-03-19 02:35:48,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-19 02:35:48,752 INFO L208 MainTranslator]: Completed translation [2022-03-19 02:35:48,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:48 WrapperNode [2022-03-19 02:35:48,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-19 02:35:48,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-19 02:35:48,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-19 02:35:48,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-19 02:35:48,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:48" (1/1) ... [2022-03-19 02:35:48,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:48" (1/1) ... [2022-03-19 02:35:48,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:48" (1/1) ... [2022-03-19 02:35:48,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:48" (1/1) ... [2022-03-19 02:35:48,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:48" (1/1) ... [2022-03-19 02:35:48,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:48" (1/1) ... [2022-03-19 02:35:48,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:48" (1/1) ... [2022-03-19 02:35:48,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-19 02:35:48,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-19 02:35:48,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-19 02:35:48,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-19 02:35:48,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:48" (1/1) ... [2022-03-19 02:35:48,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-19 02:35:48,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-19 02:35:48,849 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-03-19 02:35:48,874 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-03-19 02:35:48,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-19 02:35:48,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-19 02:35:48,888 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-19 02:35:48,888 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-19 02:35:48,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-19 02:35:48,888 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-19 02:35:48,888 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-19 02:35:48,889 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-19 02:35:48,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-19 02:35:48,889 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-19 02:35:48,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-19 02:35:48,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-19 02:35:48,889 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-19 02:35:48,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-19 02:35:48,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-19 02:35:48,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-19 02:35:48,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-19 02:35:48,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-19 02:35:48,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-19 02:35:48,976 INFO L234 CfgBuilder]: Building ICFG [2022-03-19 02:35:48,977 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-19 02:35:49,433 INFO L275 CfgBuilder]: Performing block encoding [2022-03-19 02:35:49,441 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-19 02:35:49,441 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-19 02:35:49,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 02:35:49 BoogieIcfgContainer [2022-03-19 02:35:49,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-19 02:35:49,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-19 02:35:49,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-19 02:35:49,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-19 02:35:49,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.03 02:35:48" (1/3) ... [2022-03-19 02:35:49,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f86f7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 02:35:49, skipping insertion in model container [2022-03-19 02:35:49,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.03 02:35:48" (2/3) ... [2022-03-19 02:35:49,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f86f7d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.03 02:35:49, skipping insertion in model container [2022-03-19 02:35:49,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.03 02:35:49" (3/3) ... [2022-03-19 02:35:49,454 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2022-03-19 02:35:49,458 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-19 02:35:49,458 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-03-19 02:35:49,508 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-19 02:35:49,519 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-03-19 02:35:49,519 INFO L341 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-03-19 02:35:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 104 states have (on average 1.9038461538461537) internal successors, (198), 120 states have internal predecessors, (198), 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-03-19 02:35:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-19 02:35:49,561 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:49,561 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:35:49,562 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:49,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:49,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1600664684, now seen corresponding path program 1 times [2022-03-19 02:35:49,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:49,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1055523186] [2022-03-19 02:35:49,583 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:49,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1600664684, now seen corresponding path program 2 times [2022-03-19 02:35:49,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:49,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046937161] [2022-03-19 02:35:49,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:49,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:49,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:49,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:49,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046937161] [2022-03-19 02:35:49,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046937161] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:49,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:49,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:35:49,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:49,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1055523186] [2022-03-19 02:35:49,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1055523186] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:49,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:49,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:35:49,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770965606] [2022-03-19 02:35:49,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:49,877 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 02:35:49,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:49,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 02:35:49,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 02:35:49,908 INFO L87 Difference]: Start difference. First operand has 125 states, 104 states have (on average 1.9038461538461537) internal successors, (198), 120 states have internal predecessors, (198), 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 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-03-19 02:35:50,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:50,367 INFO L93 Difference]: Finished difference Result 143 states and 221 transitions. [2022-03-19 02:35:50,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:35:50,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 11 [2022-03-19 02:35:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:50,383 INFO L225 Difference]: With dead ends: 143 [2022-03-19 02:35:50,383 INFO L226 Difference]: Without dead ends: 123 [2022-03-19 02:35:50,386 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-19 02:35:50,393 INFO L912 BasicCegarLoop]: 57 mSDtfsCounter, 269 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:50,394 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 118 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 02:35:50,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-03-19 02:35:50,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2022-03-19 02:35:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.36) internal successors, (136), 114 states have internal predecessors, (136), 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-03-19 02:35:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2022-03-19 02:35:50,491 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2022-03-19 02:35:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:50,492 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2022-03-19 02:35:50,493 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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-03-19 02:35:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2022-03-19 02:35:50,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-19 02:35:50,494 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:50,495 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:35:50,495 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-19 02:35:50,495 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:50,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:50,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1919005414, now seen corresponding path program 1 times [2022-03-19 02:35:50,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:50,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1298208622] [2022-03-19 02:35:50,497 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1919005414, now seen corresponding path program 2 times [2022-03-19 02:35:50,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:50,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885325274] [2022-03-19 02:35:50,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:50,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:50,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:50,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:50,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885325274] [2022-03-19 02:35:50,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885325274] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:50,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:50,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:50,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:50,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1298208622] [2022-03-19 02:35:50,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1298208622] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:50,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:50,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:50,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894760770] [2022-03-19 02:35:50,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:50,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:50,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:50,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:50,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:50,648 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-03-19 02:35:51,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:51,042 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2022-03-19 02:35:51,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:35:51,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 12 [2022-03-19 02:35:51,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:51,045 INFO L225 Difference]: With dead ends: 121 [2022-03-19 02:35:51,045 INFO L226 Difference]: Without dead ends: 113 [2022-03-19 02:35:51,046 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-03-19 02:35:51,048 INFO L912 BasicCegarLoop]: 125 mSDtfsCounter, 85 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:51,048 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 248 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-19 02:35:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-03-19 02:35:51,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-03-19 02:35:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 109 states have internal predecessors, (122), 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-03-19 02:35:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2022-03-19 02:35:51,071 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2022-03-19 02:35:51,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:51,071 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2022-03-19 02:35:51,071 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-03-19 02:35:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-03-19 02:35:51,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-19 02:35:51,072 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:51,073 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:35:51,073 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-19 02:35:51,073 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:51,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:51,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1908131676, now seen corresponding path program 1 times [2022-03-19 02:35:51,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:51,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1683728228] [2022-03-19 02:35:51,076 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:51,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1908131676, now seen corresponding path program 2 times [2022-03-19 02:35:51,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:51,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103089850] [2022-03-19 02:35:51,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:51,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:51,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:51,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:51,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103089850] [2022-03-19 02:35:51,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103089850] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:51,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:51,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:51,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:51,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1683728228] [2022-03-19 02:35:51,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1683728228] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:51,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:51,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:51,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066566707] [2022-03-19 02:35:51,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:51,189 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:51,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:51,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:51,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:51,191 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-03-19 02:35:51,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:51,461 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-03-19 02:35:51,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:35:51,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2022-03-19 02:35:51,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:51,463 INFO L225 Difference]: With dead ends: 113 [2022-03-19 02:35:51,463 INFO L226 Difference]: Without dead ends: 111 [2022-03-19 02:35:51,464 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-19 02:35:51,464 INFO L912 BasicCegarLoop]: 39 mSDtfsCounter, 140 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:51,465 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 118 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 02:35:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-03-19 02:35:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-03-19 02:35:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.263157894736842) internal successors, (120), 107 states have internal predecessors, (120), 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-03-19 02:35:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2022-03-19 02:35:51,486 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2022-03-19 02:35:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:51,486 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2022-03-19 02:35:51,486 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-03-19 02:35:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-03-19 02:35:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-19 02:35:51,487 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:51,487 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:35:51,487 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-19 02:35:51,488 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:51,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:51,488 INFO L85 PathProgramCache]: Analyzing trace with hash -977457091, now seen corresponding path program 1 times [2022-03-19 02:35:51,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:51,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1293387672] [2022-03-19 02:35:51,489 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:51,489 INFO L85 PathProgramCache]: Analyzing trace with hash -977457091, now seen corresponding path program 2 times [2022-03-19 02:35:51,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:51,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490665045] [2022-03-19 02:35:51,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:51,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:51,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:51,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:51,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490665045] [2022-03-19 02:35:51,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490665045] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:51,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:51,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:35:51,576 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:51,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1293387672] [2022-03-19 02:35:51,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1293387672] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:51,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:51,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:35:51,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307956867] [2022-03-19 02:35:51,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:51,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 02:35:51,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:51,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 02:35:51,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 02:35:51,578 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-03-19 02:35:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:51,794 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-03-19 02:35:51,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 02:35:51,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 16 [2022-03-19 02:35:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:51,795 INFO L225 Difference]: With dead ends: 111 [2022-03-19 02:35:51,796 INFO L226 Difference]: Without dead ends: 107 [2022-03-19 02:35:51,796 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:35:51,797 INFO L912 BasicCegarLoop]: 112 mSDtfsCounter, 65 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:51,797 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 199 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 02:35:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-03-19 02:35:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-03-19 02:35:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 103 states have internal predecessors, (116), 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-03-19 02:35:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2022-03-19 02:35:51,811 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2022-03-19 02:35:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:51,811 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2022-03-19 02:35:51,812 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-03-19 02:35:51,812 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-03-19 02:35:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-19 02:35:51,812 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:51,812 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:35:51,813 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-19 02:35:51,813 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:51,813 INFO L85 PathProgramCache]: Analyzing trace with hash -223130707, now seen corresponding path program 1 times [2022-03-19 02:35:51,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:51,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1076467532] [2022-03-19 02:35:51,814 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash -223130707, now seen corresponding path program 2 times [2022-03-19 02:35:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:51,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496507988] [2022-03-19 02:35:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:51,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:51,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:51,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496507988] [2022-03-19 02:35:51,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496507988] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:51,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:51,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:51,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:51,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1076467532] [2022-03-19 02:35:51,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1076467532] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:51,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:51,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:51,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726113019] [2022-03-19 02:35:51,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:51,871 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:51,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:51,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:51,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:51,872 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-03-19 02:35:52,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:52,147 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2022-03-19 02:35:52,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:35:52,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 17 [2022-03-19 02:35:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:52,149 INFO L225 Difference]: With dead ends: 125 [2022-03-19 02:35:52,149 INFO L226 Difference]: Without dead ends: 123 [2022-03-19 02:35:52,150 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-19 02:35:52,150 INFO L912 BasicCegarLoop]: 48 mSDtfsCounter, 157 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:52,151 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 128 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 02:35:52,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-03-19 02:35:52,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-03-19 02:35:52,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 101 states have internal predecessors, (114), 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-03-19 02:35:52,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-03-19 02:35:52,178 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2022-03-19 02:35:52,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:52,178 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-03-19 02:35:52,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-03-19 02:35:52,178 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-03-19 02:35:52,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-19 02:35:52,179 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:52,179 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:35:52,179 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-19 02:35:52,180 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:52,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:52,181 INFO L85 PathProgramCache]: Analyzing trace with hash -221591507, now seen corresponding path program 1 times [2022-03-19 02:35:52,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:52,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1172356506] [2022-03-19 02:35:52,182 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:52,183 INFO L85 PathProgramCache]: Analyzing trace with hash -221591507, now seen corresponding path program 2 times [2022-03-19 02:35:52,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:52,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578343567] [2022-03-19 02:35:52,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:52,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:52,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:52,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:52,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578343567] [2022-03-19 02:35:52,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578343567] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:52,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:52,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:52,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:52,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1172356506] [2022-03-19 02:35:52,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1172356506] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:52,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:52,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:52,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41019560] [2022-03-19 02:35:52,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:52,258 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:52,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:52,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:52,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:52,259 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-03-19 02:35:52,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:52,516 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2022-03-19 02:35:52,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:35:52,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 17 [2022-03-19 02:35:52,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:52,518 INFO L225 Difference]: With dead ends: 105 [2022-03-19 02:35:52,518 INFO L226 Difference]: Without dead ends: 103 [2022-03-19 02:35:52,519 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-19 02:35:52,521 INFO L912 BasicCegarLoop]: 33 mSDtfsCounter, 130 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:52,521 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 100 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 02:35:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-03-19 02:35:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-03-19 02:35:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 99 states have internal predecessors, (112), 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-03-19 02:35:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2022-03-19 02:35:52,536 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2022-03-19 02:35:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:52,537 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2022-03-19 02:35:52,537 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-03-19 02:35:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-03-19 02:35:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-19 02:35:52,538 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:52,538 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:35:52,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-19 02:35:52,539 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:52,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:52,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1674251212, now seen corresponding path program 1 times [2022-03-19 02:35:52,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:52,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1372371661] [2022-03-19 02:35:52,540 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:52,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1674251212, now seen corresponding path program 2 times [2022-03-19 02:35:52,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:52,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99677217] [2022-03-19 02:35:52,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:52,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:52,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:52,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:52,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99677217] [2022-03-19 02:35:52,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99677217] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:52,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:52,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:52,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:52,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1372371661] [2022-03-19 02:35:52,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1372371661] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:52,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:52,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-19 02:35:52,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069530563] [2022-03-19 02:35:52,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:52,622 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-19 02:35:52,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:52,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-19 02:35:52,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-19 02:35:52,623 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-03-19 02:35:52,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:52,888 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2022-03-19 02:35:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-19 02:35:52,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 18 [2022-03-19 02:35:52,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:52,889 INFO L225 Difference]: With dead ends: 124 [2022-03-19 02:35:52,889 INFO L226 Difference]: Without dead ends: 122 [2022-03-19 02:35:52,889 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-19 02:35:52,890 INFO L912 BasicCegarLoop]: 44 mSDtfsCounter, 148 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:52,890 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 120 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 02:35:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-03-19 02:35:52,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2022-03-19 02:35:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 97 states have internal predecessors, (110), 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-03-19 02:35:52,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2022-03-19 02:35:52,904 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2022-03-19 02:35:52,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:52,904 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2022-03-19 02:35:52,904 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-03-19 02:35:52,904 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2022-03-19 02:35:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-19 02:35:52,908 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:52,908 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:35:52,908 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-19 02:35:52,908 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:52,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:52,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1672885792, now seen corresponding path program 1 times [2022-03-19 02:35:52,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:52,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2028082401] [2022-03-19 02:35:52,910 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:52,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1672885792, now seen corresponding path program 2 times [2022-03-19 02:35:52,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:52,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398357387] [2022-03-19 02:35:52,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:52,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:53,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:53,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:53,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398357387] [2022-03-19 02:35:53,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398357387] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:53,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:53,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:35:53,040 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:53,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2028082401] [2022-03-19 02:35:53,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2028082401] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:53,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:53,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:35:53,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969585065] [2022-03-19 02:35:53,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:53,041 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 02:35:53,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:53,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 02:35:53,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:35:53,042 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-03-19 02:35:53,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:53,353 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2022-03-19 02:35:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 02:35:53,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 18 [2022-03-19 02:35:53,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:53,355 INFO L225 Difference]: With dead ends: 134 [2022-03-19 02:35:53,355 INFO L226 Difference]: Without dead ends: 132 [2022-03-19 02:35:53,355 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-03-19 02:35:53,356 INFO L912 BasicCegarLoop]: 107 mSDtfsCounter, 102 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:53,356 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 214 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 02:35:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-03-19 02:35:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 107. [2022-03-19 02:35:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 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-03-19 02:35:53,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2022-03-19 02:35:53,368 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 18 [2022-03-19 02:35:53,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:53,368 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2022-03-19 02:35:53,368 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-03-19 02:35:53,369 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-03-19 02:35:53,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-19 02:35:53,369 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:53,369 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:35:53,369 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-19 02:35:53,369 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:53,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:53,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1720601042, now seen corresponding path program 1 times [2022-03-19 02:35:53,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:53,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1856274416] [2022-03-19 02:35:53,371 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:53,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1720601042, now seen corresponding path program 2 times [2022-03-19 02:35:53,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:53,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308416743] [2022-03-19 02:35:53,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:53,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:53,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:53,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:53,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308416743] [2022-03-19 02:35:53,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308416743] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:53,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:53,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:35:53,465 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:53,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1856274416] [2022-03-19 02:35:53,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1856274416] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:53,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:53,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:35:53,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130506084] [2022-03-19 02:35:53,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:53,466 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 02:35:53,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:53,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 02:35:53,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:35:53,467 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-03-19 02:35:53,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:53,749 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2022-03-19 02:35:53,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 02:35:53,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 18 [2022-03-19 02:35:53,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:53,751 INFO L225 Difference]: With dead ends: 117 [2022-03-19 02:35:53,751 INFO L226 Difference]: Without dead ends: 113 [2022-03-19 02:35:53,751 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-03-19 02:35:53,752 INFO L912 BasicCegarLoop]: 90 mSDtfsCounter, 75 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:53,752 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 217 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 02:35:53,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-03-19 02:35:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-03-19 02:35:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 104 states have internal predecessors, (119), 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-03-19 02:35:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2022-03-19 02:35:53,763 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 18 [2022-03-19 02:35:53,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:53,763 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2022-03-19 02:35:53,763 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-03-19 02:35:53,763 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2022-03-19 02:35:53,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-19 02:35:53,764 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:53,764 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:35:53,764 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-19 02:35:53,764 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:53,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:53,765 INFO L85 PathProgramCache]: Analyzing trace with hash 362183168, now seen corresponding path program 1 times [2022-03-19 02:35:53,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:53,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1655106019] [2022-03-19 02:35:53,765 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:53,765 INFO L85 PathProgramCache]: Analyzing trace with hash 362183168, now seen corresponding path program 2 times [2022-03-19 02:35:53,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:53,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340610075] [2022-03-19 02:35:53,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:53,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:53,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:53,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:53,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340610075] [2022-03-19 02:35:53,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340610075] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:53,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:53,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:35:53,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:53,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1655106019] [2022-03-19 02:35:53,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1655106019] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:53,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:53,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:35:53,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564834534] [2022-03-19 02:35:53,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:53,874 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 02:35:53,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:53,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 02:35:53,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:35:53,875 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-03-19 02:35:54,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:54,187 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2022-03-19 02:35:54,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 02:35:54,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-03-19 02:35:54,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:54,189 INFO L225 Difference]: With dead ends: 135 [2022-03-19 02:35:54,189 INFO L226 Difference]: Without dead ends: 133 [2022-03-19 02:35:54,189 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-03-19 02:35:54,190 INFO L912 BasicCegarLoop]: 116 mSDtfsCounter, 93 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:54,190 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 284 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 02:35:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-03-19 02:35:54,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2022-03-19 02:35:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 107 states have internal predecessors, (122), 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-03-19 02:35:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-03-19 02:35:54,201 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 19 [2022-03-19 02:35:54,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:54,202 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-03-19 02:35:54,202 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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-03-19 02:35:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-03-19 02:35:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-19 02:35:54,202 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:54,202 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:35:54,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-19 02:35:54,203 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:54,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:54,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1325574371, now seen corresponding path program 1 times [2022-03-19 02:35:54,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:54,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2045342962] [2022-03-19 02:35:54,204 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:54,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1325574371, now seen corresponding path program 2 times [2022-03-19 02:35:54,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:54,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528529557] [2022-03-19 02:35:54,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:54,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:54,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:54,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:54,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528529557] [2022-03-19 02:35:54,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528529557] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:54,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:54,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:35:54,246 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:54,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2045342962] [2022-03-19 02:35:54,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2045342962] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:54,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:54,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:35:54,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107002532] [2022-03-19 02:35:54,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:54,247 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 02:35:54,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:54,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 02:35:54,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 02:35:54,248 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-03-19 02:35:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:54,411 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-03-19 02:35:54,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 02:35:54,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-03-19 02:35:54,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:54,412 INFO L225 Difference]: With dead ends: 111 [2022-03-19 02:35:54,412 INFO L226 Difference]: Without dead ends: 109 [2022-03-19 02:35:54,413 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:35:54,414 INFO L912 BasicCegarLoop]: 74 mSDtfsCounter, 152 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:54,414 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 115 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:35:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-03-19 02:35:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-03-19 02:35:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 105 states have internal predecessors, (120), 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-03-19 02:35:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2022-03-19 02:35:54,426 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 20 [2022-03-19 02:35:54,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:54,428 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2022-03-19 02:35:54,428 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-03-19 02:35:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-03-19 02:35:54,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-19 02:35:54,428 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:54,428 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-19 02:35:54,429 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-19 02:35:54,429 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:54,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:54,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1856864327, now seen corresponding path program 1 times [2022-03-19 02:35:54,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:54,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [74153146] [2022-03-19 02:35:54,430 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:54,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1856864327, now seen corresponding path program 2 times [2022-03-19 02:35:54,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:54,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712445251] [2022-03-19 02:35:54,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:54,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:54,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:54,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:54,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712445251] [2022-03-19 02:35:54,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712445251] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:54,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:54,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:35:54,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:54,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [74153146] [2022-03-19 02:35:54,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [74153146] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:54,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:54,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-19 02:35:54,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261265167] [2022-03-19 02:35:54,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:54,487 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-19 02:35:54,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:54,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-19 02:35:54,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-03-19 02:35:54,487 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-03-19 02:35:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:54,668 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-03-19 02:35:54,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-19 02:35:54,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 21 [2022-03-19 02:35:54,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:54,670 INFO L225 Difference]: With dead ends: 109 [2022-03-19 02:35:54,670 INFO L226 Difference]: Without dead ends: 105 [2022-03-19 02:35:54,670 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:35:54,671 INFO L912 BasicCegarLoop]: 101 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:54,671 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 171 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:35:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-03-19 02:35:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-03-19 02:35:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 101 states have internal predecessors, (116), 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-03-19 02:35:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-03-19 02:35:54,682 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 21 [2022-03-19 02:35:54,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:54,684 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-03-19 02:35:54,684 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-03-19 02:35:54,684 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-03-19 02:35:54,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-19 02:35:54,685 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:54,685 INFO L500 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-03-19 02:35:54,685 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-19 02:35:54,685 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:54,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:54,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1714979017, now seen corresponding path program 1 times [2022-03-19 02:35:54,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:54,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [321439980] [2022-03-19 02:35:54,686 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:54,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1714979017, now seen corresponding path program 2 times [2022-03-19 02:35:54,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:54,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832474767] [2022-03-19 02:35:54,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:54,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:54,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:54,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:54,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:54,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832474767] [2022-03-19 02:35:54,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832474767] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:54,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:54,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:35:54,779 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:54,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [321439980] [2022-03-19 02:35:54,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [321439980] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:54,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:54,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:35:54,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776509191] [2022-03-19 02:35:54,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:54,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 02:35:54,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:54,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 02:35:54,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:35:54,780 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-03-19 02:35:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:55,054 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2022-03-19 02:35:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 02:35:55,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-03-19 02:35:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:55,055 INFO L225 Difference]: With dead ends: 121 [2022-03-19 02:35:55,055 INFO L226 Difference]: Without dead ends: 119 [2022-03-19 02:35:55,056 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-03-19 02:35:55,056 INFO L912 BasicCegarLoop]: 34 mSDtfsCounter, 199 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:55,056 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 80 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 02:35:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-03-19 02:35:55,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2022-03-19 02:35:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 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-03-19 02:35:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-03-19 02:35:55,086 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 22 [2022-03-19 02:35:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:55,086 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-03-19 02:35:55,086 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-03-19 02:35:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-03-19 02:35:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-19 02:35:55,087 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:55,087 INFO L500 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-03-19 02:35:55,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-19 02:35:55,087 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:55,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:55,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1738536758, now seen corresponding path program 1 times [2022-03-19 02:35:55,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:55,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [43097365] [2022-03-19 02:35:55,088 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:55,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1738536758, now seen corresponding path program 2 times [2022-03-19 02:35:55,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:55,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837683686] [2022-03-19 02:35:55,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:55,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:55,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:55,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:55,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837683686] [2022-03-19 02:35:55,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837683686] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:55,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:55,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:35:55,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:55,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [43097365] [2022-03-19 02:35:55,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [43097365] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:55,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:55,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:35:55,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704139876] [2022-03-19 02:35:55,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:55,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 02:35:55,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:55,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 02:35:55,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:35:55,163 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-03-19 02:35:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:55,486 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2022-03-19 02:35:55,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 02:35:55,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-03-19 02:35:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:55,488 INFO L225 Difference]: With dead ends: 113 [2022-03-19 02:35:55,488 INFO L226 Difference]: Without dead ends: 111 [2022-03-19 02:35:55,489 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-03-19 02:35:55,489 INFO L912 BasicCegarLoop]: 30 mSDtfsCounter, 191 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:55,490 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 74 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 02:35:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-03-19 02:35:55,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2022-03-19 02:35:55,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 91 states have internal predecessors, (105), 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-03-19 02:35:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-03-19 02:35:55,501 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 22 [2022-03-19 02:35:55,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:55,502 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-03-19 02:35:55,502 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-03-19 02:35:55,502 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-03-19 02:35:55,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-19 02:35:55,503 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:55,504 INFO L500 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-03-19 02:35:55,504 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-19 02:35:55,504 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:55,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:55,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1786252008, now seen corresponding path program 1 times [2022-03-19 02:35:55,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:55,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [931856782] [2022-03-19 02:35:55,506 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:55,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1786252008, now seen corresponding path program 2 times [2022-03-19 02:35:55,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:55,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112115205] [2022-03-19 02:35:55,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:55,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:55,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:55,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:55,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112115205] [2022-03-19 02:35:55,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112115205] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:55,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:55,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:35:55,590 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:55,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [931856782] [2022-03-19 02:35:55,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [931856782] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:55,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:55,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-19 02:35:55,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253813198] [2022-03-19 02:35:55,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:55,591 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-19 02:35:55,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:55,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-19 02:35:55,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-19 02:35:55,592 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-03-19 02:35:55,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:55,825 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2022-03-19 02:35:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 02:35:55,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-03-19 02:35:55,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:55,827 INFO L225 Difference]: With dead ends: 95 [2022-03-19 02:35:55,827 INFO L226 Difference]: Without dead ends: 58 [2022-03-19 02:35:55,827 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-03-19 02:35:55,828 INFO L912 BasicCegarLoop]: 21 mSDtfsCounter, 173 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:55,828 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 61 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-19 02:35:55,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-03-19 02:35:55,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-03-19 02:35:55,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 states have internal predecessors, (55), 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-03-19 02:35:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-03-19 02:35:55,833 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 22 [2022-03-19 02:35:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:55,833 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-03-19 02:35:55,833 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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-03-19 02:35:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-03-19 02:35:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-19 02:35:55,834 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:55,834 INFO L500 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, 1, 1, 1, 1] [2022-03-19 02:35:55,834 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-19 02:35:55,834 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:55,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:55,835 INFO L85 PathProgramCache]: Analyzing trace with hash -563432656, now seen corresponding path program 1 times [2022-03-19 02:35:55,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:55,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [269143153] [2022-03-19 02:35:55,835 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:55,835 INFO L85 PathProgramCache]: Analyzing trace with hash -563432656, now seen corresponding path program 2 times [2022-03-19 02:35:55,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:55,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23802733] [2022-03-19 02:35:55,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:55,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:55,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:55,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:55,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:55,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23802733] [2022-03-19 02:35:55,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23802733] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:55,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:55,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-19 02:35:55,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:55,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [269143153] [2022-03-19 02:35:55,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [269143153] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:55,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:55,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-19 02:35:55,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769449155] [2022-03-19 02:35:55,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:55,966 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-19 02:35:55,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:55,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-19 02:35:55,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-03-19 02:35:55,967 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 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-03-19 02:35:56,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:56,266 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-03-19 02:35:56,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-19 02:35:56,267 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 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 48 [2022-03-19 02:35:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:56,267 INFO L225 Difference]: With dead ends: 67 [2022-03-19 02:35:56,268 INFO L226 Difference]: Without dead ends: 65 [2022-03-19 02:35:56,268 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-03-19 02:35:56,269 INFO L912 BasicCegarLoop]: 19 mSDtfsCounter, 94 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:56,269 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 68 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:35:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-03-19 02:35:56,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2022-03-19 02:35:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 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-03-19 02:35:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-03-19 02:35:56,274 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2022-03-19 02:35:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:56,274 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-03-19 02:35:56,275 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 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-03-19 02:35:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-03-19 02:35:56,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-19 02:35:56,275 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:56,275 INFO L500 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, 1, 1, 1, 1] [2022-03-19 02:35:56,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-19 02:35:56,275 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:56,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:56,276 INFO L85 PathProgramCache]: Analyzing trace with hash -563446558, now seen corresponding path program 1 times [2022-03-19 02:35:56,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:56,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [240170522] [2022-03-19 02:35:56,276 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:56,276 INFO L85 PathProgramCache]: Analyzing trace with hash -563446558, now seen corresponding path program 2 times [2022-03-19 02:35:56,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:56,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701230048] [2022-03-19 02:35:56,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:56,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:56,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:56,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:56,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701230048] [2022-03-19 02:35:56,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701230048] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:56,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:56,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-19 02:35:56,407 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:56,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [240170522] [2022-03-19 02:35:56,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [240170522] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:56,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:56,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-19 02:35:56,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766909593] [2022-03-19 02:35:56,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:56,407 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-19 02:35:56,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:56,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-19 02:35:56,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-03-19 02:35:56,408 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 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-03-19 02:35:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:56,661 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-03-19 02:35:56,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-19 02:35:56,662 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 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 48 [2022-03-19 02:35:56,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:56,662 INFO L225 Difference]: With dead ends: 56 [2022-03-19 02:35:56,662 INFO L226 Difference]: Without dead ends: 54 [2022-03-19 02:35:56,663 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-03-19 02:35:56,663 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 109 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:56,664 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 42 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:35:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-03-19 02:35:56,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-03-19 02:35:56,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 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-03-19 02:35:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-03-19 02:35:56,679 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2022-03-19 02:35:56,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:56,680 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-03-19 02:35:56,680 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 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-03-19 02:35:56,680 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-03-19 02:35:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-19 02:35:56,680 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:56,680 INFO L500 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, 1, 1, 1, 1, 1] [2022-03-19 02:35:56,680 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-19 02:35:56,681 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:56,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:56,681 INFO L85 PathProgramCache]: Analyzing trace with hash -286539729, now seen corresponding path program 1 times [2022-03-19 02:35:56,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:56,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [544615912] [2022-03-19 02:35:56,682 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:56,682 INFO L85 PathProgramCache]: Analyzing trace with hash -286539729, now seen corresponding path program 2 times [2022-03-19 02:35:56,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:56,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386200797] [2022-03-19 02:35:56,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:56,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:56,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:56,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:56,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386200797] [2022-03-19 02:35:56,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386200797] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:56,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:56,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 02:35:56,809 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:56,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [544615912] [2022-03-19 02:35:56,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [544615912] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:56,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:56,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 02:35:56,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055452008] [2022-03-19 02:35:56,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:56,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 02:35:56,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:56,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 02:35:56,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-19 02:35:56,811 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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-03-19 02:35:56,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:56,957 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-03-19 02:35:56,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-19 02:35:56,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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-03-19 02:35:56,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:56,959 INFO L225 Difference]: With dead ends: 62 [2022-03-19 02:35:56,959 INFO L226 Difference]: Without dead ends: 60 [2022-03-19 02:35:56,960 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-03-19 02:35:56,960 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 81 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:56,960 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 49 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:35:56,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-03-19 02:35:56,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2022-03-19 02:35:56,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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-03-19 02:35:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-03-19 02:35:56,967 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2022-03-19 02:35:56,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:56,968 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-03-19 02:35:56,968 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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-03-19 02:35:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-03-19 02:35:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-03-19 02:35:56,968 INFO L492 BasicCegarLoop]: Found error trace [2022-03-19 02:35:56,968 INFO L500 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, 1, 1, 1, 1, 1] [2022-03-19 02:35:56,968 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-19 02:35:56,969 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-03-19 02:35:56,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-19 02:35:56,969 INFO L85 PathProgramCache]: Analyzing trace with hash -286970705, now seen corresponding path program 1 times [2022-03-19 02:35:56,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:56,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2095920776] [2022-03-19 02:35:56,970 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-19 02:35:56,970 INFO L85 PathProgramCache]: Analyzing trace with hash -286970705, now seen corresponding path program 2 times [2022-03-19 02:35:56,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-19 02:35:56,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30104465] [2022-03-19 02:35:56,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-19 02:35:56,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-19 02:35:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:57,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-19 02:35:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-19 02:35:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-19 02:35:57,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-19 02:35:57,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30104465] [2022-03-19 02:35:57,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30104465] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:57,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:57,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 02:35:57,104 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-19 02:35:57,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2095920776] [2022-03-19 02:35:57,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2095920776] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-19 02:35:57,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-19 02:35:57,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-19 02:35:57,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264776447] [2022-03-19 02:35:57,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-19 02:35:57,105 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-19 02:35:57,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-19 02:35:57,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-19 02:35:57,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-19 02:35:57,106 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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-03-19 02:35:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-19 02:35:57,235 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-03-19 02:35:57,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-19 02:35:57,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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-03-19 02:35:57,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-19 02:35:57,236 INFO L225 Difference]: With dead ends: 52 [2022-03-19 02:35:57,236 INFO L226 Difference]: Without dead ends: 0 [2022-03-19 02:35:57,237 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-03-19 02:35:57,237 INFO L912 BasicCegarLoop]: 8 mSDtfsCounter, 86 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-19 02:35:57,237 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 33 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-19 02:35:57,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-19 02:35:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-19 02:35:57,238 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-03-19 02:35:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-19 02:35:57,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-03-19 02:35:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-19 02:35:57,238 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-19 02:35:57,238 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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-03-19 02:35:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-19 02:35:57,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-19 02:35:57,241 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-03-19 02:35:57,241 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-03-19 02:35:57,241 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-03-19 02:35:57,242 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-03-19 02:35:57,242 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-03-19 02:35:57,242 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-03-19 02:35:57,242 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-03-19 02:35:57,242 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-03-19 02:35:57,242 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-03-19 02:35:57,242 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-03-19 02:35:57,243 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-03-19 02:35:57,243 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-03-19 02:35:57,243 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-03-19 02:35:57,243 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-03-19 02:35:57,243 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-03-19 02:35:57,243 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-03-19 02:35:57,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-19 02:35:57,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-19 02:35:59,279 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-03-19 02:35:59,279 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-03-19 02:35:59,279 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-03-19 02:35:59,279 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-03-19 02:35:59,280 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-03-19 02:35:59,280 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-03-19 02:35:59,280 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-03-19 02:35:59,280 INFO L878 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 117) the Hoare annotation is: false [2022-03-19 02:35:59,280 INFO L878 garLoopResultBuilder]: At program point L217(lines 217 229) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~10 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,280 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 17 1006) the Hoare annotation is: true [2022-03-19 02:35:59,280 INFO L878 garLoopResultBuilder]: At program point L597(lines 597 969) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 5 main_~main__t~0)) [2022-03-19 02:35:59,280 INFO L878 garLoopResultBuilder]: At program point L366(lines 366 991) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,280 INFO L878 garLoopResultBuilder]: At program point L267(lines 267 275) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~12 0))) (.cse2 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 .cse1 (not (<= main_~main__tagbuf_len~0 0)) .cse2) (and .cse0 .cse1 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse2))) [2022-03-19 02:35:59,280 INFO L878 garLoopResultBuilder]: At program point L581(lines 581 971) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 4 main_~main__t~0)) [2022-03-19 02:35:59,281 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: false [2022-03-19 02:35:59,281 INFO L878 garLoopResultBuilder]: At program point L895(line 895) the Hoare annotation is: false [2022-03-19 02:35:59,281 INFO L878 garLoopResultBuilder]: At program point L317(lines 317 994) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,281 INFO L878 garLoopResultBuilder]: At program point L185(line 185) the Hoare annotation is: false [2022-03-19 02:35:59,281 INFO L878 garLoopResultBuilder]: At program point L400(lines 400 424) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,281 INFO L878 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 919) the Hoare annotation is: false [2022-03-19 02:35:59,281 INFO L878 garLoopResultBuilder]: At program point L136(lines 136 242) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,281 INFO L878 garLoopResultBuilder]: At program point L103(lines 103 125) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,281 INFO L878 garLoopResultBuilder]: At program point L615(lines 615 626) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,281 INFO L878 garLoopResultBuilder]: At program point L929(lines 929 941) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~50 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~51 0)) (<= 9 main_~main__t~0)) [2022-03-19 02:35:59,282 INFO L878 garLoopResultBuilder]: At program point L219(line 219) the Hoare annotation is: false [2022-03-19 02:35:59,282 INFO L878 garLoopResultBuilder]: At program point L665(lines 665 963) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 6 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-03-19 02:35:59,282 INFO L878 garLoopResultBuilder]: At program point L434(lines 434 985) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 2 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-03-19 02:35:59,282 INFO L878 garLoopResultBuilder]: At program point L269(line 269) the Hoare annotation is: false [2022-03-19 02:35:59,282 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 17 1006) the Hoare annotation is: true [2022-03-19 02:35:59,282 INFO L878 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 895) the Hoare annotation is: false [2022-03-19 02:35:59,282 INFO L878 garLoopResultBuilder]: At program point L649(lines 649 965) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 5 main_~main__t~0)) [2022-03-19 02:35:59,282 INFO L878 garLoopResultBuilder]: At program point L385(lines 385 988) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 2 main_~main__t~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,282 INFO L878 garLoopResultBuilder]: At program point L22(lines 22 1005) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-03-19 02:35:59,283 INFO L878 garLoopResultBuilder]: At program point L468(lines 468 492) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,283 INFO L878 garLoopResultBuilder]: At program point L881(lines 881 907) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~48 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0)) [2022-03-19 02:35:59,283 INFO L878 garLoopResultBuilder]: At program point L171(lines 171 193) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,283 INFO L878 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 207) the Hoare annotation is: false [2022-03-19 02:35:59,283 INFO L878 garLoopResultBuilder]: At program point L683(lines 683 694) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,283 INFO L878 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: false [2022-03-19 02:35:59,283 INFO L878 garLoopResultBuilder]: At program point L72(lines 72 288) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (< 0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,283 INFO L878 garLoopResultBuilder]: At program point L931(line 931) the Hoare annotation is: false [2022-03-19 02:35:59,283 INFO L878 garLoopResultBuilder]: At program point L733(lines 733 957) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-03-19 02:35:59,283 INFO L878 garLoopResultBuilder]: At program point L155(lines 155 234) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~7 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,284 INFO L878 garLoopResultBuilder]: At program point L502(lines 502 979) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 3 main_~main__t~0)) [2022-03-19 02:35:59,284 INFO L878 garLoopResultBuilder]: At program point L205(lines 205 231) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~10 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,284 INFO L878 garLoopResultBuilder]: At program point L717(lines 717 959) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 6 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-03-19 02:35:59,284 INFO L878 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 931) the Hoare annotation is: false [2022-03-19 02:35:59,284 INFO L878 garLoopResultBuilder]: At program point L453(lines 453 982) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 3 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,284 INFO L878 garLoopResultBuilder]: At program point L866(lines 866 946) the Hoare annotation is: (and (<= 9 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,284 INFO L878 garLoopResultBuilder]: At program point L255(lines 255 277) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~12 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 (not (<= main_~main__tagbuf_len~0 0)) .cse1) (and .cse0 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse1))) [2022-03-19 02:35:59,284 INFO L878 garLoopResultBuilder]: At program point L536(lines 536 560) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,284 INFO L878 garLoopResultBuilder]: At program point L883(line 883) the Hoare annotation is: false [2022-03-19 02:35:59,285 INFO L878 garLoopResultBuilder]: At program point L751(lines 751 762) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,285 INFO L878 garLoopResultBuilder]: At program point L173(line 173) the Hoare annotation is: false [2022-03-19 02:35:59,285 INFO L878 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 257) the Hoare annotation is: false [2022-03-19 02:35:59,285 INFO L878 garLoopResultBuilder]: At program point L801(lines 801 951) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 8 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-03-19 02:35:59,285 INFO L878 garLoopResultBuilder]: At program point L157(line 157) the Hoare annotation is: false [2022-03-19 02:35:59,285 INFO L878 garLoopResultBuilder]: At program point L570(lines 570 973) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 4 main_~main__t~0)) [2022-03-19 02:35:59,285 INFO L878 garLoopResultBuilder]: At program point L917(lines 917 943) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~50 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0)) [2022-03-19 02:35:59,285 INFO L878 garLoopResultBuilder]: At program point L785(lines 785 953) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-03-19 02:35:59,285 INFO L878 garLoopResultBuilder]: At program point L207(line 207) the Hoare annotation is: false [2022-03-19 02:35:59,285 INFO L878 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) the Hoare annotation is: false [2022-03-19 02:35:59,286 INFO L878 garLoopResultBuilder]: At program point L521(lines 521 976) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 4 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,286 INFO L878 garLoopResultBuilder]: At program point L868(lines 26 1000) the Hoare annotation is: (and (<= 0 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,286 INFO L878 garLoopResultBuilder]: At program point L257(line 257) the Hoare annotation is: false [2022-03-19 02:35:59,286 INFO L878 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) the Hoare annotation is: false [2022-03-19 02:35:59,286 INFO L878 garLoopResultBuilder]: At program point L604(lines 604 628) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,286 INFO L878 garLoopResultBuilder]: At program point L26(lines 26 1000) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,286 INFO L878 garLoopResultBuilder]: At program point L819(lines 819 830) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,286 INFO L878 garLoopResultBuilder]: At program point L638(lines 638 967) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 5 main_~main__t~0)) [2022-03-19 02:35:59,286 INFO L878 garLoopResultBuilder]: At program point L919(line 919) the Hoare annotation is: false [2022-03-19 02:35:59,287 INFO L878 garLoopResultBuilder]: At program point L853(lines 853 947) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 8 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-03-19 02:35:59,287 INFO L878 garLoopResultBuilder]: At program point L143(lines 143 236) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,287 INFO L878 garLoopResultBuilder]: At program point L589(lines 589 970) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 5 main_~main__t~0)) [2022-03-19 02:35:59,287 INFO L878 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 269) the Hoare annotation is: false [2022-03-19 02:35:59,287 INFO L878 garLoopResultBuilder]: At program point L325(lines 325 993) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,287 INFO L878 garLoopResultBuilder]: At program point L672(lines 672 696) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,287 INFO L878 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 173) the Hoare annotation is: false [2022-03-19 02:35:59,287 INFO L878 garLoopResultBuilder]: At program point L309(lines 309 995) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (< 0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,287 INFO L878 garLoopResultBuilder]: At program point L904(lines 65 999) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,287 INFO L878 garLoopResultBuilder]: At program point L706(lines 706 961) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 6 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-03-19 02:35:59,287 INFO L878 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) the Hoare annotation is: false [2022-03-19 02:35:59,288 INFO L878 garLoopResultBuilder]: At program point L343(lines 343 354) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,288 INFO L878 garLoopResultBuilder]: At program point L145(line 145) the Hoare annotation is: false [2022-03-19 02:35:59,288 INFO L878 garLoopResultBuilder]: At program point L657(lines 657 964) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 6 main_~main__t~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,288 INFO L878 garLoopResultBuilder]: At program point L46(lines 46 56) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (<= 0 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,288 INFO L878 garLoopResultBuilder]: At program point L1004(lines 22 1005) the Hoare annotation is: (or (<= 0 main_~main__t~0) (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|))) [2022-03-19 02:35:59,288 INFO L878 garLoopResultBuilder]: At program point L393(lines 393 987) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 2 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-03-19 02:35:59,288 INFO L878 garLoopResultBuilder]: At program point L740(lines 740 764) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,288 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) the Hoare annotation is: false [2022-03-19 02:35:59,288 INFO L878 garLoopResultBuilder]: At program point L96(lines 96 285) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,288 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 17 1006) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-03-19 02:35:59,288 INFO L878 garLoopResultBuilder]: At program point L377(lines 377 989) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,289 INFO L878 garLoopResultBuilder]: At program point L774(lines 774 955) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-03-19 02:35:59,289 INFO L878 garLoopResultBuilder]: At program point L411(lines 411 422) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,289 INFO L878 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 185) the Hoare annotation is: false [2022-03-19 02:35:59,289 INFO L878 garLoopResultBuilder]: At program point L725(lines 725 958) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,289 INFO L878 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: false [2022-03-19 02:35:59,289 INFO L878 garLoopResultBuilder]: At program point L461(lines 461 981) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 3 main_~main__t~0)) [2022-03-19 02:35:59,289 INFO L878 garLoopResultBuilder]: At program point L940(lines 858 947) the Hoare annotation is: (and (<= 9 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,289 INFO L878 garLoopResultBuilder]: At program point L874(lines 874 945) the Hoare annotation is: (and (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0)) [2022-03-19 02:35:59,289 INFO L878 garLoopResultBuilder]: At program point L808(lines 808 832) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,289 INFO L878 garLoopResultBuilder]: At program point L164(lines 164 233) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,290 INFO L878 garLoopResultBuilder]: At program point L65(lines 65 999) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (< 0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,290 INFO L878 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2022-03-19 02:35:59,290 INFO L878 garLoopResultBuilder]: At program point L445(lines 445 983) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 2 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-03-19 02:35:59,290 INFO L878 garLoopResultBuilder]: At program point L115(lines 115 123) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,290 INFO L878 garLoopResultBuilder]: At program point L842(lines 842 949) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 8 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-03-19 02:35:59,290 INFO L878 garLoopResultBuilder]: At program point L132(lines 132 284) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,290 INFO L878 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) the Hoare annotation is: false [2022-03-19 02:35:59,290 INFO L878 garLoopResultBuilder]: At program point L479(lines 479 490) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,290 INFO L878 garLoopResultBuilder]: At program point L793(lines 793 952) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 8 main_~main__t~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,290 INFO L878 garLoopResultBuilder]: At program point L248(lines 248 283) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,290 INFO L878 garLoopResultBuilder]: At program point L83(lines 83 286) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (< 0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,291 INFO L878 garLoopResultBuilder]: At program point L529(lines 529 975) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 4 main_~main__t~0)) [2022-03-19 02:35:59,291 INFO L878 garLoopResultBuilder]: At program point L298(lines 298 997) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (< 0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,291 INFO L878 garLoopResultBuilder]: At program point L34(lines 34 58) the Hoare annotation is: (and (<= 0 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,291 INFO L878 garLoopResultBuilder]: At program point L513(lines 513 977) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 3 main_~main__t~0)) [2022-03-19 02:35:59,291 INFO L878 garLoopResultBuilder]: At program point L893(lines 893 905) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~48 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~49 0))) [2022-03-19 02:35:59,291 INFO L878 garLoopResultBuilder]: At program point L282(lines 132 284) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,291 INFO L878 garLoopResultBuilder]: At program point L183(lines 183 191) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-03-19 02:35:59,291 INFO L878 garLoopResultBuilder]: At program point L117(line 117) the Hoare annotation is: false [2022-03-19 02:35:59,291 INFO L878 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 883) the Hoare annotation is: false [2022-03-19 02:35:59,292 INFO L878 garLoopResultBuilder]: At program point L332(lines 332 356) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,292 INFO L878 garLoopResultBuilder]: At program point L547(lines 547 558) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-03-19 02:35:59,292 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-19 02:35:59,292 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-19 02:35:59,292 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-19 02:35:59,292 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-19 02:35:59,292 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-19 02:35:59,292 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-19 02:35:59,292 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-19 02:35:59,295 INFO L718 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-03-19 02:35:59,296 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-19 02:35:59,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.03 02:35:59 BoogieIcfgContainer [2022-03-19 02:35:59,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-19 02:35:59,312 INFO L158 Benchmark]: Toolchain (without parser) took 10976.58ms. Allocated memory was 187.7MB in the beginning and 300.9MB in the end (delta: 113.2MB). Free memory was 129.0MB in the beginning and 183.2MB in the end (delta: -54.2MB). Peak memory consumption was 149.6MB. Max. memory is 8.0GB. [2022-03-19 02:35:59,312 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 187.7MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-19 02:35:59,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.85ms. Allocated memory was 187.7MB in the beginning and 250.6MB in the end (delta: 62.9MB). Free memory was 128.9MB in the beginning and 209.6MB in the end (delta: -80.7MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-03-19 02:35:59,313 INFO L158 Benchmark]: Boogie Preprocessor took 54.24ms. Allocated memory is still 250.6MB. Free memory was 209.6MB in the beginning and 207.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-19 02:35:59,313 INFO L158 Benchmark]: RCFGBuilder took 638.94ms. Allocated memory is still 250.6MB. Free memory was 207.0MB in the beginning and 181.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-03-19 02:35:59,313 INFO L158 Benchmark]: TraceAbstraction took 9861.78ms. Allocated memory was 250.6MB in the beginning and 300.9MB in the end (delta: 50.3MB). Free memory was 181.3MB in the beginning and 183.2MB in the end (delta: -1.9MB). Peak memory consumption was 139.2MB. Max. memory is 8.0GB. [2022-03-19 02:35:59,315 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.14ms. Allocated memory is still 187.7MB. Free memory is still 145.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 413.85ms. Allocated memory was 187.7MB in the beginning and 250.6MB in the end (delta: 62.9MB). Free memory was 128.9MB in the beginning and 209.6MB in the end (delta: -80.7MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.24ms. Allocated memory is still 250.6MB. Free memory was 209.6MB in the beginning and 207.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 638.94ms. Allocated memory is still 250.6MB. Free memory was 207.0MB in the beginning and 181.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 9861.78ms. Allocated memory was 250.6MB in the beginning and 300.9MB in the end (delta: 50.3MB). Free memory was 181.3MB in the beginning and 183.2MB in the end (delta: -1.9MB). Peak memory consumption was 139.2MB. 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: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 105]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 117]: 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: 173]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 185]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 207]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 219]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 269]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 883]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 895]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 919]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 931]: 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, 132 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2409 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2409 mSDsluCounter, 2439 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1356 mSDsCounter, 438 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5255 IncrementalHoareTripleChecker+Invalid, 5693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 438 mSolverCounterUnsat, 1083 mSDtfsCounter, 5255 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=0, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 148 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 125 LocationsWithAnnotation, 125 PreInvPairs, 147 NumberOfFragments, 1678 HoareAnnotationTreeSize, 125 FomulaSimplifications, 13187 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 125 FomulaSimplificationsInter, 4837 FormulaSimplificationTreeSizeReductionInter, 1.6s 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 16 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 858]: Loop Invariant Derived loop invariant: 9 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 0 <= main__t || ((((__tmp_3137_1 == \old(__tmp_3137_1) && __tmp_2624_1 == \old(__tmp_2624_1)) && __tmp_3137_0 == \old(__tmp_3137_0)) && \old(__return_2598) == __return_2598) && __tmp_2624_0 == \old(__tmp_2624_0)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && 1 <= main__t - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 <= main__t && main__t <= main__tagbuf_len - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-03-19 02:35:59,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...