/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+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 14:34:41,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 14:34:41,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 14:34:41,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 14:34:41,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 14:34:41,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 14:34:41,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 14:34:41,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 14:34:41,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 14:34:41,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 14:34:41,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 14:34:41,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 14:34:41,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 14:34:41,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 14:34:41,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 14:34:41,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 14:34:41,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 14:34:41,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 14:34:41,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 14:34:41,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 14:34:41,865 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 14:34:41,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 14:34:41,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 14:34:41,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 14:34:41,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 14:34:41,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 14:34:41,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 14:34:41,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 14:34:41,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 14:34:41,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 14:34:41,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 14:34:41,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 14:34:41,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 14:34:41,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 14:34:41,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 14:34:41,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 14:34:41,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 14:34:41,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 14:34:41,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 14:34:41,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 14:34:41,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 14:34:41,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 14:34:41,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-06 14:34:41,881 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 14:34:41,881 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 14:34:41,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 14:34:41,882 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-06 14:34:41,882 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 14:34:41,882 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-06 14:34:41,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 14:34:41,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 14:34:41,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 14:34:41,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 14:34:41,883 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-06 14:34:41,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 14:34:41,883 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 14:34:41,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 14:34:41,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 14:34:41,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 14:34:41,883 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-06 14:34:41,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 14:34:41,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 14:34:41,884 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 14:34:41,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-06 14:34:41,884 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-06 14:34:41,884 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-06 14:34:41,884 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 14:34:41,884 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-06 14:34:41,884 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-06 14:34:42,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 14:34:42,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 14:34:42,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 14:34:42,034 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 14:34:42,035 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 14:34:42,035 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+nlh-reducer.c [2022-04-06 14:34:42,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/440c42aa3/7c23ab3811004176ae23588c583409b0/FLAGab66909ef [2022-04-06 14:34:42,467 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 14:34:42,467 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2022-04-06 14:34:42,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/440c42aa3/7c23ab3811004176ae23588c583409b0/FLAGab66909ef [2022-04-06 14:34:42,806 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/440c42aa3/7c23ab3811004176ae23588c583409b0 [2022-04-06 14:34:42,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 14:34:42,809 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-06 14:34:42,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 14:34:42,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 14:34:42,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 14:34:42,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 02:34:42" (1/1) ... [2022-04-06 14:34:42,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4342d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:42, skipping insertion in model container [2022-04-06 14:34:42,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 02:34:42" (1/1) ... [2022-04-06 14:34:42,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 14:34:42,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 14:34:43,037 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+nlh-reducer.c[901,914] [2022-04-06 14:34:43,040 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+nlh-reducer.c[1116,1129] [2022-04-06 14:34:43,042 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+nlh-reducer.c[1625,1638] [2022-04-06 14:34:43,043 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+nlh-reducer.c[1840,1853] [2022-04-06 14:34:43,044 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+nlh-reducer.c[2157,2170] [2022-04-06 14:34:43,045 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+nlh-reducer.c[2372,2385] [2022-04-06 14:34:43,046 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+nlh-reducer.c[2867,2880] [2022-04-06 14:34:43,048 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+nlh-reducer.c[3082,3095] [2022-04-06 14:34:43,049 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+nlh-reducer.c[3384,3397] [2022-04-06 14:34:43,050 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+nlh-reducer.c[3602,3615] [2022-04-06 14:34:43,051 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+nlh-reducer.c[3878,3891] [2022-04-06 14:34:43,052 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+nlh-reducer.c[4096,4109] [2022-04-06 14:34:43,053 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+nlh-reducer.c[4582,4595] [2022-04-06 14:34:43,054 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+nlh-reducer.c[4800,4813] [2022-04-06 14:34:43,179 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+nlh-reducer.c[47686,47699] [2022-04-06 14:34:43,182 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+nlh-reducer.c[47907,47920] [2022-04-06 14:34:43,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 14:34:43,204 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 14:34:43,213 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+nlh-reducer.c[901,914] [2022-04-06 14:34:43,214 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+nlh-reducer.c[1116,1129] [2022-04-06 14:34:43,214 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+nlh-reducer.c[1625,1638] [2022-04-06 14:34:43,215 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+nlh-reducer.c[1840,1853] [2022-04-06 14:34:43,215 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+nlh-reducer.c[2157,2170] [2022-04-06 14:34:43,216 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+nlh-reducer.c[2372,2385] [2022-04-06 14:34:43,217 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+nlh-reducer.c[2867,2880] [2022-04-06 14:34:43,217 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+nlh-reducer.c[3082,3095] [2022-04-06 14:34:43,218 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+nlh-reducer.c[3384,3397] [2022-04-06 14:34:43,219 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+nlh-reducer.c[3602,3615] [2022-04-06 14:34:43,219 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+nlh-reducer.c[3878,3891] [2022-04-06 14:34:43,220 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+nlh-reducer.c[4096,4109] [2022-04-06 14:34:43,221 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+nlh-reducer.c[4582,4595] [2022-04-06 14:34:43,221 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+nlh-reducer.c[4800,4813] [2022-04-06 14:34:43,299 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+nlh-reducer.c[47686,47699] [2022-04-06 14:34:43,302 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+nlh-reducer.c[47907,47920] [2022-04-06 14:34:43,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 14:34:43,317 INFO L208 MainTranslator]: Completed translation [2022-04-06 14:34:43,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:43 WrapperNode [2022-04-06 14:34:43,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 14:34:43,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 14:34:43,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 14:34:43,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 14:34:43,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:43" (1/1) ... [2022-04-06 14:34:43,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:43" (1/1) ... [2022-04-06 14:34:43,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:43" (1/1) ... [2022-04-06 14:34:43,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:43" (1/1) ... [2022-04-06 14:34:43,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:43" (1/1) ... [2022-04-06 14:34:43,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:43" (1/1) ... [2022-04-06 14:34:43,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:43" (1/1) ... [2022-04-06 14:34:43,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 14:34:43,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 14:34:43,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 14:34:43,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 14:34:43,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:43" (1/1) ... [2022-04-06 14:34:43,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 14:34:43,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 14:34:43,413 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-06 14:34:43,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-06 14:34:43,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 14:34:43,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 14:34:43,450 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 14:34:43,450 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-06 14:34:43,450 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 14:34:43,450 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 14:34:43,450 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 14:34:43,450 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 14:34:43,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 14:34:43,450 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-06 14:34:43,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 14:34:43,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 14:34:43,450 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 14:34:43,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 14:34:43,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 14:34:43,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 14:34:43,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 14:34:43,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 14:34:43,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 14:34:43,587 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 14:34:43,588 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 14:34:44,304 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 14:34:44,316 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 14:34:44,317 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-06 14:34:44,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 02:34:44 BoogieIcfgContainer [2022-04-06 14:34:44,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 14:34:44,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 14:34:44,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 14:34:44,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 14:34:44,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 02:34:42" (1/3) ... [2022-04-06 14:34:44,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4615c287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 02:34:44, skipping insertion in model container [2022-04-06 14:34:44,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 02:34:43" (2/3) ... [2022-04-06 14:34:44,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4615c287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 02:34:44, skipping insertion in model container [2022-04-06 14:34:44,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 02:34:44" (3/3) ... [2022-04-06 14:34:44,326 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2022-04-06 14:34:44,329 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-06 14:34:44,329 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-04-06 14:34:44,368 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 14:34:44,372 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-06 14:34:44,372 INFO L341 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-04-06 14:34:44,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 309 states, 288 states have (on average 1.9652777777777777) internal successors, (566), 304 states have internal predecessors, (566), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 14:34:44,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-06 14:34:44,396 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:44,396 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:44,397 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-04-06 14:34:44,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:44,402 INFO L85 PathProgramCache]: Analyzing trace with hash -191009829, now seen corresponding path program 1 times [2022-04-06 14:34:44,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:44,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1808577954] [2022-04-06 14:34:44,420 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:44,421 INFO L85 PathProgramCache]: Analyzing trace with hash -191009829, now seen corresponding path program 2 times [2022-04-06 14:34:44,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:44,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775868739] [2022-04-06 14:34:44,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:44,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:44,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:44,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:44,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775868739] [2022-04-06 14:34:44,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775868739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:44,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:44,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 14:34:44,621 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:44,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1808577954] [2022-04-06 14:34:44,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1808577954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:44,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:44,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 14:34:44,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480996034] [2022-04-06 14:34:44,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:44,626 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 14:34:44,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:44,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 14:34:44,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 14:34:44,654 INFO L87 Difference]: Start difference. First operand has 309 states, 288 states have (on average 1.9652777777777777) internal successors, (566), 304 states have internal predecessors, (566), 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-04-06 14:34:45,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:45,568 INFO L93 Difference]: Finished difference Result 327 states and 589 transitions. [2022-04-06 14:34:45,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 14:34:45,570 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-04-06 14:34:45,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:45,577 INFO L225 Difference]: With dead ends: 327 [2022-04-06 14:34:45,578 INFO L226 Difference]: Without dead ends: 307 [2022-04-06 14:34:45,579 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-06 14:34:45,581 INFO L913 BasicCegarLoop]: 118 mSDtfsCounter, 862 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:45,582 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [862 Valid, 179 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-06 14:34:45,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-06 14:34:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 302. [2022-04-06 14:34:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 284 states have (on average 1.4859154929577465) internal successors, (422), 298 states have internal predecessors, (422), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2022-04-06 14:34:45,631 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 11 [2022-04-06 14:34:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:45,631 INFO L478 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2022-04-06 14:34:45,631 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-04-06 14:34:45,632 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2022-04-06 14:34:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-06 14:34:45,632 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:45,632 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:45,632 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 14:34:45,632 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-04-06 14:34:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:45,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1626334337, now seen corresponding path program 1 times [2022-04-06 14:34:45,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:45,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [377385254] [2022-04-06 14:34:45,633 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:45,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1626334337, now seen corresponding path program 2 times [2022-04-06 14:34:45,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:45,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465131783] [2022-04-06 14:34:45,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:45,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:45,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:45,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:45,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:45,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465131783] [2022-04-06 14:34:45,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465131783] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:45,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:45,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:45,696 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:45,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [377385254] [2022-04-06 14:34:45,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [377385254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:45,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:45,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:45,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392347618] [2022-04-06 14:34:45,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:45,697 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:45,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:45,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:45,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:45,698 INFO L87 Difference]: Start difference. First operand 302 states and 425 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-04-06 14:34:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:46,430 INFO L93 Difference]: Finished difference Result 312 states and 435 transitions. [2022-04-06 14:34:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 14:34:46,430 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-04-06 14:34:46,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:46,433 INFO L225 Difference]: With dead ends: 312 [2022-04-06 14:34:46,433 INFO L226 Difference]: Without dead ends: 304 [2022-04-06 14:34:46,434 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-06 14:34:46,437 INFO L913 BasicCegarLoop]: 411 mSDtfsCounter, 325 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:46,437 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 531 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-06 14:34:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-04-06 14:34:46,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2022-04-06 14:34:46,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 280 states have (on average 1.275) internal successors, (357), 293 states have internal predecessors, (357), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2022-04-06 14:34:46,482 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 12 [2022-04-06 14:34:46,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:46,482 INFO L478 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2022-04-06 14:34:46,482 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-04-06 14:34:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2022-04-06 14:34:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-06 14:34:46,483 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:46,483 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:46,483 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 14:34:46,483 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-04-06 14:34:46,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:46,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1610084340, now seen corresponding path program 1 times [2022-04-06 14:34:46,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:46,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [244044818] [2022-04-06 14:34:46,484 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:46,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1610084340, now seen corresponding path program 2 times [2022-04-06 14:34:46,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:46,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867453261] [2022-04-06 14:34:46,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:46,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:46,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:46,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:46,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867453261] [2022-04-06 14:34:46,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867453261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:46,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:46,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 14:34:46,565 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:46,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [244044818] [2022-04-06 14:34:46,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [244044818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:46,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:46,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 14:34:46,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854065109] [2022-04-06 14:34:46,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:46,566 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 14:34:46,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:46,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 14:34:46,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 14:34:46,566 INFO L87 Difference]: Start difference. First operand 297 states and 360 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-04-06 14:34:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:46,947 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2022-04-06 14:34:46,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 14:34:46,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-04-06 14:34:46,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:46,963 INFO L225 Difference]: With dead ends: 297 [2022-04-06 14:34:46,963 INFO L226 Difference]: Without dead ends: 295 [2022-04-06 14:34:46,963 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-04-06 14:34:46,964 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 505 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:46,964 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [505 Valid, 118 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-06 14:34:46,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-04-06 14:34:46,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-04-06 14:34:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 279 states have (on average 1.2724014336917562) internal successors, (355), 291 states have internal predecessors, (355), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:46,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2022-04-06 14:34:46,995 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 12 [2022-04-06 14:34:46,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:46,995 INFO L478 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2022-04-06 14:34:46,996 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-04-06 14:34:46,996 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2022-04-06 14:34:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-06 14:34:46,996 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:46,996 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:46,996 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-06 14:34:46,996 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-04-06 14:34:46,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:46,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1626996098, now seen corresponding path program 1 times [2022-04-06 14:34:46,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:46,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1524336047] [2022-04-06 14:34:46,998 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:46,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1626996098, now seen corresponding path program 2 times [2022-04-06 14:34:46,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:46,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870951437] [2022-04-06 14:34:46,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:46,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:47,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:47,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:47,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870951437] [2022-04-06 14:34:47,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870951437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:47,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:47,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 14:34:47,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:47,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1524336047] [2022-04-06 14:34:47,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1524336047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:47,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:47,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 14:34:47,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677232603] [2022-04-06 14:34:47,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:47,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 14:34:47,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:47,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 14:34:47,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 14:34:47,070 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:47,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:47,502 INFO L93 Difference]: Finished difference Result 300 states and 363 transitions. [2022-04-06 14:34:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 14:34:47,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 13 [2022-04-06 14:34:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:47,504 INFO L225 Difference]: With dead ends: 300 [2022-04-06 14:34:47,504 INFO L226 Difference]: Without dead ends: 298 [2022-04-06 14:34:47,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-04-06 14:34:47,507 INFO L913 BasicCegarLoop]: 351 mSDtfsCounter, 279 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:47,508 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 406 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 14:34:47,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-04-06 14:34:47,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2022-04-06 14:34:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2695035460992907) internal successors, (358), 294 states have internal predecessors, (358), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 361 transitions. [2022-04-06 14:34:47,530 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 361 transitions. Word has length 13 [2022-04-06 14:34:47,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:47,530 INFO L478 AbstractCegarLoop]: Abstraction has 298 states and 361 transitions. [2022-04-06 14:34:47,530 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:47,530 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2022-04-06 14:34:47,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-06 14:34:47,531 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:47,531 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:47,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-06 14:34:47,531 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-04-06 14:34:47,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:47,531 INFO L85 PathProgramCache]: Analyzing trace with hash 175251398, now seen corresponding path program 1 times [2022-04-06 14:34:47,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:47,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1001737107] [2022-04-06 14:34:47,532 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:47,532 INFO L85 PathProgramCache]: Analyzing trace with hash 175251398, now seen corresponding path program 2 times [2022-04-06 14:34:47,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:47,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989235792] [2022-04-06 14:34:47,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:47,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:47,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:47,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:47,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989235792] [2022-04-06 14:34:47,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989235792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:47,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:47,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:47,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:47,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1001737107] [2022-04-06 14:34:47,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1001737107] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:47,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:47,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:47,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382411720] [2022-04-06 14:34:47,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:47,569 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:47,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:47,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:47,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:47,569 INFO L87 Difference]: Start difference. First operand 298 states and 361 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-04-06 14:34:48,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:48,185 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2022-04-06 14:34:48,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 14:34:48,186 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-04-06 14:34:48,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:48,187 INFO L225 Difference]: With dead ends: 298 [2022-04-06 14:34:48,187 INFO L226 Difference]: Without dead ends: 296 [2022-04-06 14:34:48,187 INFO L912 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-04-06 14:34:48,188 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 467 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:48,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 173 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-06 14:34:48,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-04-06 14:34:48,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-04-06 14:34:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2669039145907472) internal successors, (356), 292 states have internal predecessors, (356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2022-04-06 14:34:48,205 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 15 [2022-04-06 14:34:48,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:48,205 INFO L478 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2022-04-06 14:34:48,205 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-04-06 14:34:48,205 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2022-04-06 14:34:48,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-06 14:34:48,206 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:48,206 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:48,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-06 14:34:48,206 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-06 14:34:48,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:48,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1137829144, now seen corresponding path program 1 times [2022-04-06 14:34:48,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:48,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [291094710] [2022-04-06 14:34:48,207 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:48,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1137829144, now seen corresponding path program 2 times [2022-04-06 14:34:48,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:48,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939813483] [2022-04-06 14:34:48,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:48,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:48,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:48,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:48,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939813483] [2022-04-06 14:34:48,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939813483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:48,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:48,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 14:34:48,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:48,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [291094710] [2022-04-06 14:34:48,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [291094710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:48,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:48,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 14:34:48,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893167799] [2022-04-06 14:34:48,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:48,242 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 14:34:48,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:48,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 14:34:48,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 14:34:48,242 INFO L87 Difference]: Start difference. First operand 296 states and 359 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-04-06 14:34:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:48,739 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2022-04-06 14:34:48,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 14:34:48,739 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-04-06 14:34:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:48,741 INFO L225 Difference]: With dead ends: 296 [2022-04-06 14:34:48,741 INFO L226 Difference]: Without dead ends: 292 [2022-04-06 14:34:48,741 INFO L912 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-04-06 14:34:48,742 INFO L913 BasicCegarLoop]: 345 mSDtfsCounter, 250 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:48,742 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 425 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 14:34:48,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-06 14:34:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-04-06 14:34:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 278 states have (on average 1.2661870503597121) internal successors, (352), 288 states have internal predecessors, (352), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2022-04-06 14:34:48,758 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 16 [2022-04-06 14:34:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:48,759 INFO L478 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2022-04-06 14:34:48,759 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-04-06 14:34:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2022-04-06 14:34:48,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-06 14:34:48,759 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:48,759 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:48,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-06 14:34:48,760 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-06 14:34:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:48,760 INFO L85 PathProgramCache]: Analyzing trace with hash 926233143, now seen corresponding path program 1 times [2022-04-06 14:34:48,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:48,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [277295094] [2022-04-06 14:34:48,760 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:48,760 INFO L85 PathProgramCache]: Analyzing trace with hash 926233143, now seen corresponding path program 2 times [2022-04-06 14:34:48,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:48,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385871875] [2022-04-06 14:34:48,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:48,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:48,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:48,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:48,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385871875] [2022-04-06 14:34:48,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385871875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:48,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:48,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:48,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:48,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [277295094] [2022-04-06 14:34:48,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [277295094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:48,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:48,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:48,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86901241] [2022-04-06 14:34:48,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:48,799 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:48,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:48,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:48,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:48,800 INFO L87 Difference]: Start difference. First operand 292 states and 355 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-04-06 14:34:49,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:49,394 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2022-04-06 14:34:49,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 14:34:49,394 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-04-06 14:34:49,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:49,396 INFO L225 Difference]: With dead ends: 309 [2022-04-06 14:34:49,396 INFO L226 Difference]: Without dead ends: 307 [2022-04-06 14:34:49,396 INFO L912 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-04-06 14:34:49,397 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 483 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:49,397 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [483 Valid, 181 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-06 14:34:49,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-06 14:34:49,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 290. [2022-04-06 14:34:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 277 states have (on average 1.263537906137184) internal successors, (350), 286 states have internal predecessors, (350), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 353 transitions. [2022-04-06 14:34:49,414 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 353 transitions. Word has length 17 [2022-04-06 14:34:49,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:49,414 INFO L478 AbstractCegarLoop]: Abstraction has 290 states and 353 transitions. [2022-04-06 14:34:49,414 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-04-06 14:34:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 353 transitions. [2022-04-06 14:34:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-06 14:34:49,415 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:49,415 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:49,415 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-06 14:34:49,415 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-06 14:34:49,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:49,416 INFO L85 PathProgramCache]: Analyzing trace with hash 927772343, now seen corresponding path program 1 times [2022-04-06 14:34:49,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:49,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1612453200] [2022-04-06 14:34:49,416 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:49,416 INFO L85 PathProgramCache]: Analyzing trace with hash 927772343, now seen corresponding path program 2 times [2022-04-06 14:34:49,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:49,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895370180] [2022-04-06 14:34:49,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:49,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:49,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:49,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:49,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895370180] [2022-04-06 14:34:49,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895370180] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:49,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:49,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:49,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:49,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1612453200] [2022-04-06 14:34:49,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1612453200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:49,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:49,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:49,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091400482] [2022-04-06 14:34:49,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:49,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:49,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:49,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:49,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:49,459 INFO L87 Difference]: Start difference. First operand 290 states and 353 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-04-06 14:34:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:49,997 INFO L93 Difference]: Finished difference Result 290 states and 353 transitions. [2022-04-06 14:34:49,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 14:34:49,997 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-04-06 14:34:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:49,998 INFO L225 Difference]: With dead ends: 290 [2022-04-06 14:34:49,998 INFO L226 Difference]: Without dead ends: 288 [2022-04-06 14:34:49,998 INFO L912 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-04-06 14:34:49,999 INFO L913 BasicCegarLoop]: 92 mSDtfsCounter, 457 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:49,999 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 155 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-06 14:34:50,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-04-06 14:34:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-04-06 14:34:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 276 states have (on average 1.2608695652173914) internal successors, (348), 284 states have internal predecessors, (348), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2022-04-06 14:34:50,013 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 17 [2022-04-06 14:34:50,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:50,014 INFO L478 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2022-04-06 14:34:50,014 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-04-06 14:34:50,014 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2022-04-06 14:34:50,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-06 14:34:50,014 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:50,014 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:50,014 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-06 14:34:50,014 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-06 14:34:50,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:50,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1470973679, now seen corresponding path program 1 times [2022-04-06 14:34:50,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:50,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1755702494] [2022-04-06 14:34:50,015 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:50,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1470973679, now seen corresponding path program 2 times [2022-04-06 14:34:50,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:50,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861257968] [2022-04-06 14:34:50,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:50,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:50,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:50,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:50,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861257968] [2022-04-06 14:34:50,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861257968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:50,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:50,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:50,098 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:50,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1755702494] [2022-04-06 14:34:50,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1755702494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:50,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:50,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:50,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051396141] [2022-04-06 14:34:50,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:50,098 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 14:34:50,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:50,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 14:34:50,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 14:34:50,099 INFO L87 Difference]: Start difference. First operand 288 states and 351 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-04-06 14:34:50,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:50,664 INFO L93 Difference]: Finished difference Result 312 states and 377 transitions. [2022-04-06 14:34:50,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-06 14:34:50,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-04-06 14:34:50,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:50,666 INFO L225 Difference]: With dead ends: 312 [2022-04-06 14:34:50,666 INFO L226 Difference]: Without dead ends: 310 [2022-04-06 14:34:50,666 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-04-06 14:34:50,667 INFO L913 BasicCegarLoop]: 328 mSDtfsCounter, 317 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:50,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 404 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-06 14:34:50,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-04-06 14:34:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 288. [2022-04-06 14:34:50,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 276 states have (on average 1.2608695652173914) internal successors, (348), 284 states have internal predecessors, (348), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2022-04-06 14:34:50,681 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 17 [2022-04-06 14:34:50,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:50,682 INFO L478 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2022-04-06 14:34:50,682 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-04-06 14:34:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2022-04-06 14:34:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-06 14:34:50,682 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:50,682 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:50,682 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-06 14:34:50,683 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-06 14:34:50,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:50,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1350175097, now seen corresponding path program 1 times [2022-04-06 14:34:50,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:50,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [361048484] [2022-04-06 14:34:50,683 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:50,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1350175097, now seen corresponding path program 2 times [2022-04-06 14:34:50,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:50,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079762688] [2022-04-06 14:34:50,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:50,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:50,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:50,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:50,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079762688] [2022-04-06 14:34:50,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079762688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:50,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:50,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:50,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:50,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [361048484] [2022-04-06 14:34:50,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [361048484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:50,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:50,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 14:34:50,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428263187] [2022-04-06 14:34:50,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:50,735 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 14:34:50,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:50,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 14:34:50,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 14:34:50,735 INFO L87 Difference]: Start difference. First operand 288 states and 351 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-04-06 14:34:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:51,284 INFO L93 Difference]: Finished difference Result 311 states and 376 transitions. [2022-04-06 14:34:51,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 14:34:51,284 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-04-06 14:34:51,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:51,285 INFO L225 Difference]: With dead ends: 311 [2022-04-06 14:34:51,286 INFO L226 Difference]: Without dead ends: 309 [2022-04-06 14:34:51,286 INFO L912 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-04-06 14:34:51,286 INFO L913 BasicCegarLoop]: 102 mSDtfsCounter, 474 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:51,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [474 Valid, 173 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-06 14:34:51,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-04-06 14:34:51,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 286. [2022-04-06 14:34:51,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 275 states have (on average 1.2581818181818183) internal successors, (346), 282 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 349 transitions. [2022-04-06 14:34:51,301 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 349 transitions. Word has length 18 [2022-04-06 14:34:51,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:51,302 INFO L478 AbstractCegarLoop]: Abstraction has 286 states and 349 transitions. [2022-04-06 14:34:51,302 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-04-06 14:34:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 349 transitions. [2022-04-06 14:34:51,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-06 14:34:51,302 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:51,302 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:51,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-06 14:34:51,303 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-06 14:34:51,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:51,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1351540517, now seen corresponding path program 1 times [2022-04-06 14:34:51,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:51,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [123046387] [2022-04-06 14:34:51,303 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:51,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1351540517, now seen corresponding path program 2 times [2022-04-06 14:34:51,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:51,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304889910] [2022-04-06 14:34:51,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:51,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:51,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:51,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:51,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304889910] [2022-04-06 14:34:51,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304889910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:51,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:51,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:51,359 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:51,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [123046387] [2022-04-06 14:34:51,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [123046387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:51,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:51,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:51,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472285856] [2022-04-06 14:34:51,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:51,360 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 14:34:51,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:51,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 14:34:51,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 14:34:51,360 INFO L87 Difference]: Start difference. First operand 286 states and 349 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-04-06 14:34:51,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:51,918 INFO L93 Difference]: Finished difference Result 320 states and 387 transitions. [2022-04-06 14:34:51,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-06 14:34:51,918 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-04-06 14:34:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:51,919 INFO L225 Difference]: With dead ends: 320 [2022-04-06 14:34:51,919 INFO L226 Difference]: Without dead ends: 318 [2022-04-06 14:34:51,920 INFO L912 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-04-06 14:34:51,920 INFO L913 BasicCegarLoop]: 342 mSDtfsCounter, 288 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:51,920 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 438 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-06 14:34:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-04-06 14:34:51,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 294. [2022-04-06 14:34:51,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 283 states have (on average 1.2579505300353357) internal successors, (356), 290 states have internal predecessors, (356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:51,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 359 transitions. [2022-04-06 14:34:51,949 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 359 transitions. Word has length 18 [2022-04-06 14:34:51,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:51,949 INFO L478 AbstractCegarLoop]: Abstraction has 294 states and 359 transitions. [2022-04-06 14:34:51,949 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-04-06 14:34:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 359 transitions. [2022-04-06 14:34:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-06 14:34:51,950 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:51,950 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:51,950 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-06 14:34:51,950 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-06 14:34:51,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:51,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1303825267, now seen corresponding path program 1 times [2022-04-06 14:34:51,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:51,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [839672389] [2022-04-06 14:34:51,951 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:51,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1303825267, now seen corresponding path program 2 times [2022-04-06 14:34:51,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:51,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142311219] [2022-04-06 14:34:51,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:51,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:52,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:52,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:52,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142311219] [2022-04-06 14:34:52,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142311219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:52,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:52,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:52,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:52,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [839672389] [2022-04-06 14:34:52,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [839672389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:52,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:52,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:52,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756854104] [2022-04-06 14:34:52,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:52,014 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 14:34:52,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:52,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 14:34:52,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 14:34:52,015 INFO L87 Difference]: Start difference. First operand 294 states and 359 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-04-06 14:34:52,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:52,469 INFO L93 Difference]: Finished difference Result 304 states and 369 transitions. [2022-04-06 14:34:52,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 14:34:52,470 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-04-06 14:34:52,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:52,471 INFO L225 Difference]: With dead ends: 304 [2022-04-06 14:34:52,471 INFO L226 Difference]: Without dead ends: 300 [2022-04-06 14:34:52,471 INFO L912 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-04-06 14:34:52,471 INFO L913 BasicCegarLoop]: 326 mSDtfsCounter, 266 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:52,472 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 415 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 14:34:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-04-06 14:34:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 295. [2022-04-06 14:34:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 284 states have (on average 1.2570422535211268) internal successors, (357), 291 states have internal predecessors, (357), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 360 transitions. [2022-04-06 14:34:52,486 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 360 transitions. Word has length 18 [2022-04-06 14:34:52,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:52,486 INFO L478 AbstractCegarLoop]: Abstraction has 295 states and 360 transitions. [2022-04-06 14:34:52,486 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-04-06 14:34:52,486 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 360 transitions. [2022-04-06 14:34:52,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-06 14:34:52,487 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:52,487 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:52,487 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-06 14:34:52,487 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-06 14:34:52,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:52,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1094248106, now seen corresponding path program 1 times [2022-04-06 14:34:52,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:52,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1573353003] [2022-04-06 14:34:52,488 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:52,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1094248106, now seen corresponding path program 2 times [2022-04-06 14:34:52,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:52,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747309925] [2022-04-06 14:34:52,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:52,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:52,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:52,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:52,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747309925] [2022-04-06 14:34:52,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747309925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:52,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:52,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:52,550 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:52,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1573353003] [2022-04-06 14:34:52,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1573353003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:52,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:52,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:52,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552749435] [2022-04-06 14:34:52,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:52,550 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 14:34:52,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:52,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 14:34:52,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 14:34:52,551 INFO L87 Difference]: Start difference. First operand 295 states and 360 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-04-06 14:34:53,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:53,174 INFO L93 Difference]: Finished difference Result 321 states and 388 transitions. [2022-04-06 14:34:53,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-06 14:34:53,174 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-04-06 14:34:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:53,175 INFO L225 Difference]: With dead ends: 321 [2022-04-06 14:34:53,175 INFO L226 Difference]: Without dead ends: 319 [2022-04-06 14:34:53,176 INFO L912 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-04-06 14:34:53,176 INFO L913 BasicCegarLoop]: 351 mSDtfsCounter, 281 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:53,176 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 466 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-06 14:34:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-04-06 14:34:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 298. [2022-04-06 14:34:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 287 states have (on average 1.254355400696864) internal successors, (360), 294 states have internal predecessors, (360), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 363 transitions. [2022-04-06 14:34:53,204 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 363 transitions. Word has length 19 [2022-04-06 14:34:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:53,204 INFO L478 AbstractCegarLoop]: Abstraction has 298 states and 363 transitions. [2022-04-06 14:34:53,204 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-04-06 14:34:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 363 transitions. [2022-04-06 14:34:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-06 14:34:53,205 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:53,205 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:53,205 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-06 14:34:53,205 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-06 14:34:53,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:53,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1750216322, now seen corresponding path program 1 times [2022-04-06 14:34:53,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:53,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1143889969] [2022-04-06 14:34:53,209 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:53,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1750216322, now seen corresponding path program 2 times [2022-04-06 14:34:53,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:53,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199054873] [2022-04-06 14:34:53,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:53,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:53,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:53,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:53,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199054873] [2022-04-06 14:34:53,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199054873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:53,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:53,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 14:34:53,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:53,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1143889969] [2022-04-06 14:34:53,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1143889969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:53,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:53,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 14:34:53,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086872125] [2022-04-06 14:34:53,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:53,258 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 14:34:53,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:53,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 14:34:53,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 14:34:53,259 INFO L87 Difference]: Start difference. First operand 298 states and 363 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-04-06 14:34:53,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:53,596 INFO L93 Difference]: Finished difference Result 298 states and 363 transitions. [2022-04-06 14:34:53,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 14:34:53,596 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-04-06 14:34:53,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:53,597 INFO L225 Difference]: With dead ends: 298 [2022-04-06 14:34:53,597 INFO L226 Difference]: Without dead ends: 296 [2022-04-06 14:34:53,598 INFO L912 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-04-06 14:34:53,598 INFO L913 BasicCegarLoop]: 215 mSDtfsCounter, 569 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:53,598 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [569 Valid, 254 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-06 14:34:53,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-04-06 14:34:53,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-04-06 14:34:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 286 states have (on average 1.2517482517482517) internal successors, (358), 292 states have internal predecessors, (358), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:53,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 361 transitions. [2022-04-06 14:34:53,621 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 361 transitions. Word has length 20 [2022-04-06 14:34:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:53,622 INFO L478 AbstractCegarLoop]: Abstraction has 296 states and 361 transitions. [2022-04-06 14:34:53,622 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-04-06 14:34:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 361 transitions. [2022-04-06 14:34:53,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-06 14:34:53,623 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:53,623 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:53,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-06 14:34:53,623 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-06 14:34:53,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:53,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1577872003, now seen corresponding path program 1 times [2022-04-06 14:34:53,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:53,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1907080182] [2022-04-06 14:34:53,625 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:53,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1577872003, now seen corresponding path program 2 times [2022-04-06 14:34:53,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:53,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647164199] [2022-04-06 14:34:53,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:53,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:53,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:53,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:53,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647164199] [2022-04-06 14:34:53,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647164199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:53,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:53,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 14:34:53,664 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:53,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1907080182] [2022-04-06 14:34:53,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1907080182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:53,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:53,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 14:34:53,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574026859] [2022-04-06 14:34:53,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:53,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 14:34:53,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:53,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 14:34:53,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 14:34:53,665 INFO L87 Difference]: Start difference. First operand 296 states and 361 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-04-06 14:34:53,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:53,974 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2022-04-06 14:34:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 14:34:53,975 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-04-06 14:34:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:53,976 INFO L225 Difference]: With dead ends: 296 [2022-04-06 14:34:53,976 INFO L226 Difference]: Without dead ends: 292 [2022-04-06 14:34:53,976 INFO L912 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-04-06 14:34:53,977 INFO L913 BasicCegarLoop]: 334 mSDtfsCounter, 245 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:53,977 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 397 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-06 14:34:53,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-06 14:34:53,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-04-06 14:34:53,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 283 states have (on average 1.2508833922261484) internal successors, (354), 288 states have internal predecessors, (354), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 357 transitions. [2022-04-06 14:34:53,992 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 357 transitions. Word has length 21 [2022-04-06 14:34:53,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:53,992 INFO L478 AbstractCegarLoop]: Abstraction has 292 states and 357 transitions. [2022-04-06 14:34:53,992 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-04-06 14:34:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2022-04-06 14:34:53,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-06 14:34:53,993 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:53,993 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:53,993 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-06 14:34:53,993 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-06 14:34:53,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:53,993 INFO L85 PathProgramCache]: Analyzing trace with hash -383054022, now seen corresponding path program 1 times [2022-04-06 14:34:53,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:53,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1420108060] [2022-04-06 14:34:53,994 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:53,994 INFO L85 PathProgramCache]: Analyzing trace with hash -383054022, now seen corresponding path program 2 times [2022-04-06 14:34:53,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:53,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717292062] [2022-04-06 14:34:53,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:53,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:54,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:54,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:54,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717292062] [2022-04-06 14:34:54,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717292062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:54,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:54,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:54,067 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:54,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1420108060] [2022-04-06 14:34:54,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1420108060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:54,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:54,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:54,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987750285] [2022-04-06 14:34:54,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:54,068 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 14:34:54,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:54,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 14:34:54,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-06 14:34:54,068 INFO L87 Difference]: Start difference. First operand 292 states and 357 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-04-06 14:34:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:54,576 INFO L93 Difference]: Finished difference Result 292 states and 357 transitions. [2022-04-06 14:34:54,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 14:34:54,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-04-06 14:34:54,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:54,578 INFO L225 Difference]: With dead ends: 292 [2022-04-06 14:34:54,578 INFO L226 Difference]: Without dead ends: 290 [2022-04-06 14:34:54,578 INFO L912 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-04-06 14:34:54,578 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 871 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:54,578 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [871 Valid, 107 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 14:34:54,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-04-06 14:34:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2022-04-06 14:34:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 279 states have (on average 1.2508960573476702) internal successors, (349), 283 states have internal predecessors, (349), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 352 transitions. [2022-04-06 14:34:54,596 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 352 transitions. Word has length 21 [2022-04-06 14:34:54,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:54,596 INFO L478 AbstractCegarLoop]: Abstraction has 287 states and 352 transitions. [2022-04-06 14:34:54,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-04-06 14:34:54,596 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 352 transitions. [2022-04-06 14:34:54,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-06 14:34:54,597 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:54,597 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:54,597 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-06 14:34:54,597 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-06 14:34:54,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:54,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1682632114, now seen corresponding path program 1 times [2022-04-06 14:34:54,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:54,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1637597412] [2022-04-06 14:34:54,597 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:54,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1682632114, now seen corresponding path program 2 times [2022-04-06 14:34:54,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:54,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517854627] [2022-04-06 14:34:54,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:54,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:54,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:54,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517854627] [2022-04-06 14:34:54,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517854627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:54,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:54,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:54,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:54,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1637597412] [2022-04-06 14:34:54,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1637597412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:54,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:54,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:54,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112632063] [2022-04-06 14:34:54,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:54,666 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 14:34:54,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:54,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 14:34:54,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-06 14:34:54,667 INFO L87 Difference]: Start difference. First operand 287 states and 352 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-04-06 14:34:55,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:55,181 INFO L93 Difference]: Finished difference Result 302 states and 369 transitions. [2022-04-06 14:34:55,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 14:34:55,182 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-04-06 14:34:55,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:55,183 INFO L225 Difference]: With dead ends: 302 [2022-04-06 14:34:55,183 INFO L226 Difference]: Without dead ends: 300 [2022-04-06 14:34:55,183 INFO L912 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-04-06 14:34:55,184 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 862 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:55,184 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [862 Valid, 121 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 14:34:55,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-04-06 14:34:55,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 282. [2022-04-06 14:34:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 275 states have (on average 1.250909090909091) internal successors, (344), 278 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 347 transitions. [2022-04-06 14:34:55,200 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 347 transitions. Word has length 22 [2022-04-06 14:34:55,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:55,200 INFO L478 AbstractCegarLoop]: Abstraction has 282 states and 347 transitions. [2022-04-06 14:34:55,200 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-04-06 14:34:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 347 transitions. [2022-04-06 14:34:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-06 14:34:55,200 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:55,200 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:55,200 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-06 14:34:55,200 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-06 14:34:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1297761964, now seen corresponding path program 1 times [2022-04-06 14:34:55,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:55,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2089768231] [2022-04-06 14:34:55,201 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1297761964, now seen corresponding path program 2 times [2022-04-06 14:34:55,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:55,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514711111] [2022-04-06 14:34:55,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:55,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:55,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:55,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:55,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514711111] [2022-04-06 14:34:55,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514711111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:55,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:55,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:55,248 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:55,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2089768231] [2022-04-06 14:34:55,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2089768231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:55,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:55,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:55,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463831073] [2022-04-06 14:34:55,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:55,249 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 14:34:55,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:55,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 14:34:55,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-06 14:34:55,249 INFO L87 Difference]: Start difference. First operand 282 states and 347 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-04-06 14:34:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:55,774 INFO L93 Difference]: Finished difference Result 294 states and 361 transitions. [2022-04-06 14:34:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 14:34:55,774 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-04-06 14:34:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:55,775 INFO L225 Difference]: With dead ends: 294 [2022-04-06 14:34:55,775 INFO L226 Difference]: Without dead ends: 292 [2022-04-06 14:34:55,776 INFO L912 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-04-06 14:34:55,776 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 655 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:55,776 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [655 Valid, 120 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 14:34:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-06 14:34:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 277. [2022-04-06 14:34:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 271 states have (on average 1.2472324723247232) internal successors, (338), 273 states have internal predecessors, (338), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 341 transitions. [2022-04-06 14:34:55,799 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 341 transitions. Word has length 22 [2022-04-06 14:34:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:55,799 INFO L478 AbstractCegarLoop]: Abstraction has 277 states and 341 transitions. [2022-04-06 14:34:55,799 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-04-06 14:34:55,799 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 341 transitions. [2022-04-06 14:34:55,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-06 14:34:55,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:55,801 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:55,801 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-06 14:34:55,801 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-04-06 14:34:55,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:55,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1345477214, now seen corresponding path program 1 times [2022-04-06 14:34:55,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:55,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1028882826] [2022-04-06 14:34:55,802 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:55,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1345477214, now seen corresponding path program 2 times [2022-04-06 14:34:55,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:55,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147214675] [2022-04-06 14:34:55,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:55,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:55,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:55,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:55,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147214675] [2022-04-06 14:34:55,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147214675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:55,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:55,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:55,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:55,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1028882826] [2022-04-06 14:34:55,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1028882826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:55,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:55,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 14:34:55,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765475841] [2022-04-06 14:34:55,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:55,857 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 14:34:55,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:55,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 14:34:55,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-06 14:34:55,857 INFO L87 Difference]: Start difference. First operand 277 states and 341 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-04-06 14:34:56,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:56,363 INFO L93 Difference]: Finished difference Result 277 states and 341 transitions. [2022-04-06 14:34:56,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 14:34:56,365 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-04-06 14:34:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:56,366 INFO L225 Difference]: With dead ends: 277 [2022-04-06 14:34:56,366 INFO L226 Difference]: Without dead ends: 254 [2022-04-06 14:34:56,366 INFO L912 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-04-06 14:34:56,366 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 834 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:56,366 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [834 Valid, 105 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-06 14:34:56,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-04-06 14:34:56,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2022-04-06 14:34:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 249 states have (on average 1.0080321285140563) internal successors, (251), 250 states have internal predecessors, (251), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2022-04-06 14:34:56,379 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 22 [2022-04-06 14:34:56,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:56,380 INFO L478 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2022-04-06 14:34:56,380 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-04-06 14:34:56,380 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2022-04-06 14:34:56,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-04-06 14:34:56,382 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:56,382 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:56,382 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-06 14:34:56,384 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-06 14:34:56,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:56,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1242952801, now seen corresponding path program 1 times [2022-04-06 14:34:56,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:56,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [129928700] [2022-04-06 14:34:56,384 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:56,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1242952801, now seen corresponding path program 2 times [2022-04-06 14:34:56,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:56,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479165158] [2022-04-06 14:34:56,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:56,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:57,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:57,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:57,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479165158] [2022-04-06 14:34:57,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479165158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:57,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:57,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-06 14:34:57,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:57,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [129928700] [2022-04-06 14:34:57,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [129928700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:57,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:57,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-06 14:34:57,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270153545] [2022-04-06 14:34:57,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:57,700 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-06 14:34:57,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:57,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-06 14:34:57,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1836, Invalid=2196, Unknown=0, NotChecked=0, Total=4032 [2022-04-06 14:34:57,702 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand has 64 states, 64 states have (on average 3.828125) internal successors, (245), 63 states have internal predecessors, (245), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:34:59,330 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2022-04-06 14:34:59,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-06 14:34:59,330 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.828125) internal successors, (245), 63 states have internal predecessors, (245), 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 248 [2022-04-06 14:34:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:34:59,331 INFO L225 Difference]: With dead ends: 255 [2022-04-06 14:34:59,332 INFO L226 Difference]: Without dead ends: 253 [2022-04-06 14:34:59,335 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5560, Invalid=9940, Unknown=0, NotChecked=0, Total=15500 [2022-04-06 14:34:59,337 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 740 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-06 14:34:59,337 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [740 Valid, 56 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-06 14:34:59,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-06 14:34:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2022-04-06 14:34:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 248 states have (on average 1.0040322580645162) internal successors, (249), 248 states have internal predecessors, (249), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2022-04-06 14:34:59,362 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2022-04-06 14:34:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:34:59,362 INFO L478 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2022-04-06 14:34:59,363 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.828125) internal successors, (245), 63 states have internal predecessors, (245), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:34:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2022-04-06 14:34:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-04-06 14:34:59,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 14:34:59,364 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 14:34:59,364 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-06 14:34:59,364 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-06 14:34:59,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 14:34:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash 123173085, now seen corresponding path program 1 times [2022-04-06 14:34:59,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:59,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1708543726] [2022-04-06 14:34:59,365 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 14:34:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash 123173085, now seen corresponding path program 2 times [2022-04-06 14:34:59,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 14:34:59,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546658937] [2022-04-06 14:34:59,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 14:34:59,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 14:34:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:59,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 14:34:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 14:34:59,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 14:34:59,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 14:34:59,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546658937] [2022-04-06 14:34:59,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546658937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:59,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:59,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-06 14:34:59,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 14:34:59,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1708543726] [2022-04-06 14:34:59,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1708543726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 14:34:59,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 14:34:59,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-06 14:34:59,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618668673] [2022-04-06 14:34:59,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 14:34:59,905 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 14:34:59,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 14:34:59,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 14:34:59,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-06 14:34:59,906 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand has 8 states, 8 states have (on average 30.75) internal successors, (246), 7 states have internal predecessors, (246), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:35:00,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 14:35:00,231 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2022-04-06 14:35:00,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 14:35:00,231 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.75) internal successors, (246), 7 states have internal predecessors, (246), 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 249 [2022-04-06 14:35:00,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 14:35:00,237 INFO L225 Difference]: With dead ends: 254 [2022-04-06 14:35:00,237 INFO L226 Difference]: Without dead ends: 0 [2022-04-06 14:35:00,240 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-06 14:35:00,241 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 492 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-06 14:35:00,241 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [492 Valid, 31 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-06 14:35:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-06 14:35:00,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-06 14:35:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-06 14:35:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-06 14:35:00,243 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 249 [2022-04-06 14:35:00,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 14:35:00,243 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-06 14:35:00,243 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.75) internal successors, (246), 7 states have internal predecessors, (246), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 14:35:00,243 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-06 14:35:00,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-06 14:35:00,245 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-04-06 14:35:00,245 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-04-06 14:35:00,245 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-04-06 14:35:00,245 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-04-06 14:35:00,245 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-04-06 14:35:00,245 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-04-06 14:35:00,245 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-04-06 14:35:00,245 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-04-06 14:35:00,245 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-04-06 14:35:00,245 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-04-06 14:35:00,245 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-04-06 14:35:00,246 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-04-06 14:35:00,246 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-04-06 14:35:00,246 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-04-06 14:35:00,246 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-04-06 14:35:00,246 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-04-06 14:35:00,246 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-06 14:35:00,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-06 14:35:05,859 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-06 14:35:05,859 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-06 14:35:05,859 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-06 14:35:05,859 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-06 14:35:05,859 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-06 14:35:05,860 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-06 14:35:05,860 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-06 14:35:05,860 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 16 3008) the Hoare annotation is: true [2022-04-06 14:35:05,860 INFO L878 garLoopResultBuilder]: At program point L1555(lines 1555 2805) the Hoare annotation is: (and (<= 32 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,860 INFO L878 garLoopResultBuilder]: At program point L2546(lines 2546 2653) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 58 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,860 INFO L878 garLoopResultBuilder]: At program point L2480(lines 2480 2663) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 56 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,860 INFO L878 garLoopResultBuilder]: At program point L432(lines 432 2978) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 4 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,860 INFO L878 garLoopResultBuilder]: At program point L697(lines 697 2937) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 10 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,860 INFO L878 garLoopResultBuilder]: At program point L1688(lines 1688 2785) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 36 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,860 INFO L878 garLoopResultBuilder]: At program point L1622(lines 1622 2795) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 34 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,860 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) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-06 14:35:05,860 INFO L878 garLoopResultBuilder]: At program point L1953(lines 1953 2744) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 43 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,860 INFO L878 garLoopResultBuilder]: At program point L830(lines 830 2917) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 14 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,860 INFO L878 garLoopResultBuilder]: At program point L764(lines 764 2927) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 12 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,860 INFO L878 garLoopResultBuilder]: At program point L2614(lines 2614 2643) the Hoare annotation is: (and (<= 59 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~133 0)) (not (= main_~__VERIFIER_assert__cond~132 0))) [2022-04-06 14:35:05,860 INFO L878 garLoopResultBuilder]: At program point L2218(lines 2218 2703) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 49 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,860 INFO L878 garLoopResultBuilder]: At program point L1095(lines 1095 2876) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 21 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,861 INFO L878 garLoopResultBuilder]: At program point L1360(lines 1360 2835) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 27 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,861 INFO L878 garLoopResultBuilder]: At program point L2351(lines 2351 2683) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 53 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,861 INFO L878 garLoopResultBuilder]: At program point L2285(lines 2285 2693) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 51 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,861 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) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-06 14:35:05,861 INFO L878 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 173) the Hoare annotation is: false [2022-04-06 14:35:05,861 INFO L878 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: false [2022-04-06 14:35:05,861 INFO L878 garLoopResultBuilder]: At program point L2616(line 2616) the Hoare annotation is: false [2022-04-06 14:35:05,861 INFO L878 garLoopResultBuilder]: At program point L502(lines 502 2967) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (<= 5 main_~main__t~0)) [2022-04-06 14:35:05,861 INFO L878 garLoopResultBuilder]: At program point L1493(lines 1493 2815) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 31 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,861 INFO L878 garLoopResultBuilder]: At program point L1427(lines 1427 2825) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 29 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,861 INFO L878 garLoopResultBuilder]: At program point L1758(lines 1758 2774) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 38 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,861 INFO L878 garLoopResultBuilder]: At program point L635(lines 635 2947) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,861 INFO L878 garLoopResultBuilder]: At program point L569(lines 569 2957) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,861 INFO L878 garLoopResultBuilder]: At program point L173(line 173) the Hoare annotation is: false [2022-04-06 14:35:05,861 INFO L878 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 207) the Hoare annotation is: false [2022-04-06 14:35:05,861 INFO L878 garLoopResultBuilder]: At program point L2023(lines 2023 2733) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 44 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,861 INFO L878 garLoopResultBuilder]: At program point L900(lines 900 2906) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 16 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,861 INFO L878 garLoopResultBuilder]: At program point L1165(lines 1165 2865) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 22 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L2156(lines 2156 2713) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 48 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L2090(lines 2090 2723) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 46 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L2421(lines 2421 2672) the Hoare annotation is: (and (<= 55 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L307(lines 307 2997) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L1298(lines 1298 2845) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 26 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L1232(lines 1232 2855) the Hoare annotation is: (and (<= 24 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L1563(lines 1563 2804) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 33 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L440(lines 440 2977) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 4 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L374(lines 374 2987) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 2 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L1828(lines 1828 2763) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 39 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L705(lines 705 2936) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 11 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L45(lines 45 55) 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-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L970(lines 970 2895) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 17 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L1961(lines 1961 2743) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 43 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L1895(lines 1895 2753) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 41 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L2226(lines 2226 2702) the Hoare annotation is: (and (<= 50 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L1103(lines 1103 2875) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 21 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L1037(lines 1037 2885) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 19 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,862 INFO L878 garLoopResultBuilder]: At program point L2623(lines 2623 2642) the Hoare annotation is: (and (<= 59 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~133 0)) (not (= main_~__VERIFIER_assert__cond~132 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-06 14:35:05,863 INFO L878 garLoopResultBuilder]: At program point L2491(lines 2491 2661) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 56 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,863 INFO L878 garLoopResultBuilder]: At program point L1368(lines 1368 2834) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 28 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,863 INFO L878 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: false [2022-04-06 14:35:05,863 INFO L878 garLoopResultBuilder]: At program point L1633(lines 1633 2793) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 34 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,863 INFO L878 garLoopResultBuilder]: At program point L2558(lines 2558 2651) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 58 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,864 INFO L878 garLoopResultBuilder]: At program point L510(lines 510 2966) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 6 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,864 INFO L878 garLoopResultBuilder]: At program point L246(lines 246 281) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-06 14:35:05,864 INFO L878 garLoopResultBuilder]: At program point L775(lines 775 2925) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 12 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,864 INFO L878 garLoopResultBuilder]: At program point L1766(lines 1766 2773) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 38 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,864 INFO L878 garLoopResultBuilder]: At program point L1700(lines 1700 2783) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 36 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,864 INFO L878 garLoopResultBuilder]: At program point L2625(lines 25 3002) the Hoare annotation is: (and (<= 0 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-06 14:35:05,864 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) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-06 14:35:05,864 INFO L878 garLoopResultBuilder]: At program point L2031(lines 2031 2732) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 45 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,864 INFO L878 garLoopResultBuilder]: At program point L908(lines 908 2905) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 16 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,864 INFO L878 garLoopResultBuilder]: At program point L842(lines 842 2915) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 14 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,864 INFO L878 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 47) the Hoare annotation is: false [2022-04-06 14:35:05,864 INFO L878 garLoopResultBuilder]: At program point L2296(lines 2296 2691) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 51 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,864 INFO L878 garLoopResultBuilder]: At program point L1173(lines 1173 2864) the Hoare annotation is: (and (<= 23 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,864 INFO L878 garLoopResultBuilder]: At program point L1438(lines 1438 2823) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 29 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point L2429(lines 2429 2671) the Hoare annotation is: (and (<= 55 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point L315(lines 315 2996) the Hoare annotation is: (and (<= main_~main__t~0 1) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point L2363(lines 2363 2681) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 53 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,865 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) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point L117(line 117) the Hoare annotation is: false [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 255) the Hoare annotation is: false [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point L580(lines 580 2955) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point L1571(lines 1571 2803) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 33 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point L1505(lines 1505 2813) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 31 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) the Hoare annotation is: false [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point L1836(lines 1836 2762) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 40 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point L713(lines 713 2935) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 11 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point L647(lines 647 2945) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point L185(line 185) the Hoare annotation is: false [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point L2101(lines 2101 2721) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 46 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point L978(lines 978 2894) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (<= 18 main_~main__t~0)) [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 2604) the Hoare annotation is: false [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point L1243(lines 1243 2853) the Hoare annotation is: (and (<= 24 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point L2234(lines 2234 2701) the Hoare annotation is: (and (<= 50 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,865 INFO L878 garLoopResultBuilder]: At program point L2168(lines 2168 2711) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 48 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L2631(lines 2631 2641) the Hoare annotation is: (and (<= 59 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~133 0)) (not (= main_~__VERIFIER_assert__cond~132 0))) [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L2499(lines 2499 2660) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 57 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L385(lines 385 2985) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 2 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L1376(lines 1376 2833) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 28 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L1310(lines 1310 2843) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 26 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L253(lines 253 275) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~12 0))) (.cse1 (<= 1 main_~main__t~0)) (.cse2 (not (= main_~__VERIFIER_assert__cond~3 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) .cse0 (not (= main_~main__tagbuf_len~0 0)) .cse1 .cse2 .cse3) (and .cse0 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse1 .cse2 .cse3))) [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L1641(lines 1641 2792) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 35 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L518(lines 518 2965) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 6 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L452(lines 452 2975) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 4 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L1906(lines 1906 2751) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 41 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L783(lines 783 2924) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 13 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L255(line 255) the Hoare annotation is: false [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L1048(lines 1048 2883) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 19 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L2039(lines 2039 2731) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 45 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L1973(lines 1973 2741) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 43 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L2634(lines 64 3001) the Hoare annotation is: (and (or (= main_~main__t~0 0) (<= 1 main_~main__t~0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L2304(lines 2304 2690) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 52 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,866 INFO L878 garLoopResultBuilder]: At program point L1181(lines 1181 2863) the Hoare annotation is: (and (<= 23 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L1115(lines 1115 2873) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 21 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L2569(lines 2569 2649) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 58 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L1446(lines 1446 2822) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 30 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L323(lines 323 2995) the Hoare annotation is: (and (<= main_~main__t~0 1) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 1 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L1711(lines 1711 2781) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 36 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L588(lines 588 2954) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 8 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L853(lines 853 2913) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 14 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L1844(lines 1844 2761) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 40 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L1778(lines 1778 2771) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 38 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L2109(lines 2109 2720) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 47 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L986(lines 986 2893) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (<= 18 main_~main__t~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L920(lines 920 2903) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 16 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L2374(lines 2374 2679) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 53 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L1251(lines 1251 2852) the Hoare annotation is: (and (<= 25 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 117) the Hoare annotation is: false [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L1516(lines 1516 2811) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 31 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L2507(lines 2507 2659) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 57 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L393(lines 393 2984) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 3 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,867 INFO L878 garLoopResultBuilder]: At program point L2441(lines 2441 2669) the Hoare annotation is: (and (<= 55 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L658(lines 658 2943) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L1649(lines 1649 2791) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 35 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L2640(lines 2591 2647) the Hoare annotation is: (and (<= 59 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L1583(lines 1583 2801) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 33 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L64(lines 64 3001) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L1914(lines 1914 2750) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 42 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 157) the Hoare annotation is: false [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L791(lines 791 2923) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 13 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L725(lines 725 2933) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 11 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L2179(lines 2179 2709) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 48 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L1056(lines 1056 2882) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 20 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L1321(lines 1321 2841) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 26 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L2312(lines 2312 2689) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 52 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L2246(lines 2246 2699) the Hoare annotation is: (and (<= 50 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L132(lines 132 282) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L2577(lines 2577 2648) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 59 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L463(lines 463 2973) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 4 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L1454(lines 1454 2821) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 30 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,868 INFO L878 garLoopResultBuilder]: At program point L1388(lines 1388 2831) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 28 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L265(lines 265 273) 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)) (.cse3 (not (= main_~__VERIFIER_assert__cond~3 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse2 .cse3 .cse4) (and (<= main_~main__t~0 1) .cse0 (< 0 (+ main_~main__tagbuf_len~0 1)) .cse1 (not (= main_~main__tagbuf_len~0 0)) .cse2 .cse3 .cse4))) [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L1719(lines 1719 2780) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 37 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L596(lines 596 2953) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 8 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L530(lines 530 2963) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 6 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L1984(lines 1984 2739) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 43 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L861(lines 861 2912) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 15 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L267(line 267) the Hoare annotation is: false [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L1126(lines 1126 2871) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 21 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L2117(lines 2117 2719) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 47 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L2051(lines 2051 2729) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 45 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L2382(lines 2382 2678) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 54 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L1259(lines 1259 2851) the Hoare annotation is: (and (<= 25 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L1193(lines 1193 2861) the Hoare annotation is: (and (<= 23 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L136(lines 136 240) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L1524(lines 1524 2810) the Hoare annotation is: (and (<= 32 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L401(lines 401 2983) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 3 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L335(lines 335 2993) the Hoare annotation is: (and (<= main_~main__t~0 1) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 1 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,869 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 16 3008) the Hoare annotation is: true [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L1789(lines 1789 2769) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 38 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,869 INFO L878 garLoopResultBuilder]: At program point L666(lines 666 2942) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 10 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L931(lines 931 2901) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 16 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L1922(lines 1922 2749) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 42 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L1856(lines 1856 2759) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 40 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L205(lines 205 229) 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) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L2187(lines 2187 2708) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 49 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L1064(lines 1064 2881) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 20 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L998(lines 998 2891) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (<= 18 main_~main__t~0)) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L2452(lines 2452 2667) the Hoare annotation is: (and (<= 55 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L1329(lines 1329 2840) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 27 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L74(lines 74 286) the Hoare annotation is: (let ((.cse0 (< main_~main__t~0 main_~main__tagbuf_len~0)) (.cse1 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 (= main_~main__t~0 0) .cse1) (and .cse0 (<= 1 main_~main__t~0) .cse1))) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L1594(lines 1594 2799) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 33 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L2585(lines 2585 2647) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 59 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L471(lines 471 2972) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (<= 5 main_~main__t~0)) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L2519(lines 2519 2657) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 57 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L207(line 207) the Hoare annotation is: false [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 185) the Hoare annotation is: false [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L736(lines 736 2931) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 11 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L1727(lines 1727 2779) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 37 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L1661(lines 1661 2789) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 35 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,870 INFO L878 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: false [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L1992(lines 1992 2738) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 44 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L869(lines 869 2911) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 15 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L803(lines 803 2921) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 13 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L2257(lines 2257 2697) the Hoare annotation is: (and (<= 50 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L143(lines 143 234) 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) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L1134(lines 1134 2870) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 22 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 219) the Hoare annotation is: false [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L1399(lines 1399 2829) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 28 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L2390(lines 2390 2677) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 54 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L2324(lines 2324 2687) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 52 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L541(lines 541 2961) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 6 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L1532(lines 1532 2809) the Hoare annotation is: (and (<= 32 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L1466(lines 1466 2819) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 30 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L145(line 145) the Hoare annotation is: false [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L1797(lines 1797 2768) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 39 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L674(lines 674 2941) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 10 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 35) the Hoare annotation is: false [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L608(lines 608 2951) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 8 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L2062(lines 2062 2727) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 45 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,871 INFO L878 garLoopResultBuilder]: At program point L939(lines 939 2900) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 17 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L1204(lines 1204 2859) the Hoare annotation is: (and (<= 23 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L2195(lines 2195 2707) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 49 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L2129(lines 2129 2717) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 47 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) the Hoare annotation is: false [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L2460(lines 2460 2666) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 56 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L346(lines 346 2991) the Hoare annotation is: (and (<= main_~main__t~0 1) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 1 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L1337(lines 1337 2839) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 27 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L280(lines 132 282) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L1271(lines 1271 2849) the Hoare annotation is: (and (<= 25 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L1602(lines 1602 2798) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 34 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L479(lines 479 2971) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (<= 5 main_~main__t~0)) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L413(lines 413 2981) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 3 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L1867(lines 1867 2757) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 40 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L744(lines 744 2930) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 12 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L1009(lines 1009 2889) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (<= 18 main_~main__t~0)) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L2000(lines 2000 2737) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 44 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L1934(lines 1934 2747) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 42 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L217(lines 217 227) 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) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L2265(lines 2265 2696) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 51 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,872 INFO L878 garLoopResultBuilder]: At program point L1142(lines 1142 2869) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 22 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L1076(lines 1076 2879) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 20 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L2530(lines 2530 2655) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 57 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L1407(lines 1407 2828) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 29 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L86(lines 86 284) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~3 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0) .cse0 .cse1) (and (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)) .cse0 .cse1 (<= main_~main__t~0 main_~main__tagbuf_len~0)))) [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L1672(lines 1672 2787) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 35 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L549(lines 549 2960) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L219(line 219) the Hoare annotation is: false [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L21(lines 21 3007) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L814(lines 814 2919) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 13 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L1805(lines 1805 2767) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 39 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 267) the Hoare annotation is: false [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L1739(lines 1739 2777) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 37 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L88(line 88) the Hoare annotation is: false [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L2070(lines 2070 2726) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 46 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L947(lines 947 2899) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 17 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L881(lines 881 2909) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 15 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L2335(lines 2335 2685) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 52 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L1212(lines 1212 2858) the Hoare annotation is: (and (<= 24 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point L155(lines 155 232) 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) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-06 14:35:05,873 INFO L878 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 2616) the Hoare annotation is: false [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L1477(lines 1477 2817) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 30 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L2468(lines 2468 2665) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 56 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L2402(lines 2402 2675) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 54 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L354(lines 354 2990) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 2 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L619(lines 619 2949) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 8 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L1610(lines 1610 2797) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 34 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L1544(lines 1544 2807) the Hoare annotation is: (and (<= 32 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L157(line 157) the Hoare annotation is: false [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L25(lines 25 3002) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= main_~main__t~0 0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L1875(lines 1875 2756) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 41 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L752(lines 752 2929) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 12 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L686(lines 686 2939) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 10 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L2602(lines 2602 2645) the Hoare annotation is: (and (<= 59 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~132 0))) [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L2140(lines 2140 2715) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 47 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L1017(lines 1017 2888) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 19 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L1282(lines 1282 2847) the Hoare annotation is: (and (<= 25 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L2273(lines 2273 2695) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 51 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L2207(lines 2207 2705) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 49 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,874 INFO L878 garLoopResultBuilder]: At program point L2604(line 2604) the Hoare annotation is: false [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point L2538(lines 2538 2654) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 58 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point L424(lines 424 2979) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 3 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point L1415(lines 1415 2827) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 29 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point L1349(lines 1349 2837) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 27 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point L226(lines 92 284) the Hoare annotation is: (and (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 145) the Hoare annotation is: false [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point L1680(lines 1680 2786) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 36 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point L557(lines 557 2959) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point L491(lines 491 2969) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (<= 5 main_~main__t~0)) [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point L1945(lines 1945 2745) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 42 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point L822(lines 822 2918) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 14 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point L1087(lines 1087 2877) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 20 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point L2078(lines 2078 2725) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 46 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 16 3008) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point L2012(lines 2012 2735) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 44 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point L2343(lines 2343 2684) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 53 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point L1220(lines 1220 2857) the Hoare annotation is: (and (<= 24 main_~main__t~0) (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,875 INFO L878 garLoopResultBuilder]: At program point L1154(lines 1154 2867) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 22 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point L1485(lines 1485 2816) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 31 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point L362(lines 362 2989) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 2 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point L296(lines 296 2999) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point L164(lines 164 231) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point L1750(lines 1750 2775) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 37 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point L627(lines 627 2948) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (<= 9 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point L33(lines 33 57) 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-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point L3006(lines 21 3007) the Hoare annotation is: (or (<= 0 main_~main__t~0) (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0))) [2022-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point L892(lines 892 2907) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 15 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point L1883(lines 1883 2755) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 41 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point L1817(lines 1817 2765) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 39 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point L2148(lines 2148 2714) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 48 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point L1025(lines 1025 2887) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 19 main_~main__t~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point L959(lines 959 2897) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 17 main_~main__t~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point L2413(lines 2413 2673) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 54 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point L1290(lines 1290 2846) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (<= 26 main_~main__t~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0)) [2022-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: false [2022-04-06 14:35:05,876 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-06 14:35:05,876 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-06 14:35:05,876 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-06 14:35:05,877 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-06 14:35:05,877 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-06 14:35:05,877 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-06 14:35:05,877 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-06 14:35:05,879 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-06 14:35:05,880 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 14:35:05,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 02:35:05 BoogieIcfgContainer [2022-04-06 14:35:05,905 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 14:35:05,906 INFO L158 Benchmark]: Toolchain (without parser) took 23096.41ms. Allocated memory was 176.2MB in the beginning and 488.6MB in the end (delta: 312.5MB). Free memory was 125.3MB in the beginning and 235.8MB in the end (delta: -110.5MB). Peak memory consumption was 227.5MB. Max. memory is 8.0GB. [2022-04-06 14:35:05,906 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 176.2MB. Free memory was 143.1MB in the beginning and 143.0MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 14:35:05,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.55ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 125.1MB in the beginning and 159.9MB in the end (delta: -34.8MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-04-06 14:35:05,909 INFO L158 Benchmark]: Boogie Preprocessor took 55.42ms. Allocated memory is still 211.8MB. Free memory was 159.9MB in the beginning and 155.3MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-04-06 14:35:05,910 INFO L158 Benchmark]: RCFGBuilder took 944.32ms. Allocated memory is still 211.8MB. Free memory was 155.3MB in the beginning and 122.5MB in the end (delta: 32.9MB). Peak memory consumption was 43.6MB. Max. memory is 8.0GB. [2022-04-06 14:35:05,910 INFO L158 Benchmark]: TraceAbstraction took 21584.92ms. Allocated memory was 211.8MB in the beginning and 488.6MB in the end (delta: 276.8MB). Free memory was 121.9MB in the beginning and 235.8MB in the end (delta: -113.9MB). Peak memory consumption was 188.6MB. Max. memory is 8.0GB. [2022-04-06 14:35:05,912 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 176.2MB. Free memory was 143.1MB in the beginning and 143.0MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 506.55ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 125.1MB in the beginning and 159.9MB in the end (delta: -34.8MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.42ms. Allocated memory is still 211.8MB. Free memory was 159.9MB in the beginning and 155.3MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 944.32ms. Allocated memory is still 211.8MB. Free memory was 155.3MB in the beginning and 122.5MB in the end (delta: 32.9MB). Peak memory consumption was 43.6MB. Max. memory is 8.0GB. * TraceAbstraction took 21584.92ms. Allocated memory was 211.8MB in the beginning and 488.6MB in the end (delta: 276.8MB). Free memory was 121.9MB in the beginning and 235.8MB in the end (delta: -113.9MB). Peak memory consumption was 188.6MB. 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: 35]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 47]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 88]: 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: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 267]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2604]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2616]: 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, 316 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 21.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10522 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10522 mSDsluCounter, 5255 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1278 mSDsCounter, 2160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19389 IncrementalHoareTripleChecker+Invalid, 21549 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2160 mSolverCounterUnsat, 3977 mSDtfsCounter, 19389 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 467 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2085 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=0, InterpolantAutomatonStates: 225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 161 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 309 LocationsWithAnnotation, 309 PreInvPairs, 335 NumberOfFragments, 5202 HoareAnnotationTreeSize, 309 FomulaSimplifications, 9124 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 309 FomulaSimplificationsInter, 51740 FormulaSimplificationTreeSizeReductionInter, 3.8s 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: 64]: Loop Invariant Derived loop invariant: (main__t == 0 || 1 <= main__t) && !(main__tagbuf_len <= main__t) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__t <= main__tagbuf_len - InvariantResult [Line: 2591]: Loop Invariant Derived loop invariant: 59 <= main__t && main__t < main__tagbuf_len - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 <= main__t || (((\old(__tmp_3904_0) == __tmp_3904_0 && \old(__tmp_2609_0) == __tmp_2609_0) && \old(__return_2598) == __return_2598) && \old(__tmp_3904_1) == __tmp_3904_1) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((!(main__tagbuf_len <= main__t) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0) - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-06 14:35:05,947 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...