/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 02:25:39,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 02:25:39,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 02:25:39,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 02:25:39,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 02:25:39,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 02:25:39,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 02:25:39,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 02:25:39,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 02:25:39,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 02:25:39,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 02:25:39,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 02:25:39,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 02:25:39,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 02:25:39,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 02:25:39,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 02:25:39,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 02:25:39,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 02:25:39,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 02:25:39,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 02:25:39,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 02:25:39,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 02:25:39,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 02:25:39,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 02:25:39,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 02:25:39,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 02:25:39,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 02:25:39,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 02:25:39,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 02:25:39,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 02:25:39,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 02:25:39,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 02:25:39,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 02:25:39,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 02:25:39,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 02:25:39,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 02:25:39,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 02:25:39,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 02:25:39,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 02:25:39,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 02:25:39,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 02:25:39,718 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-01-31 02:25:39,748 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 02:25:39,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 02:25:39,749 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-31 02:25:39,749 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-31 02:25:39,750 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-31 02:25:39,750 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-31 02:25:39,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-31 02:25:39,751 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-31 02:25:39,751 INFO L138 SettingsManager]: * Use SBE=true [2022-01-31 02:25:39,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 02:25:39,752 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 02:25:39,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 02:25:39,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 02:25:39,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 02:25:39,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 02:25:39,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 02:25:39,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 02:25:39,753 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 02:25:39,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 02:25:39,753 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 02:25:39,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 02:25:39,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 02:25:39,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 02:25:39,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 02:25:39,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 02:25:39,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 02:25:39,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-31 02:25:39,756 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-31 02:25:39,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 02:25:39,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-31 02:25:39,756 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-31 02:25:39,756 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-31 02:25:39,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 02:25:39,756 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 02:25:39,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 02:25:40,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 02:25:40,005 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 02:25:40,005 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 02:25:40,008 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 02:25:40,009 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-01-31 02:25:40,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb73f52cc/2f2bbe00af0149398d9f2772c1a1d8a7/FLAG3a60b58ff [2022-01-31 02:25:40,555 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 02:25:40,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2022-01-31 02:25:40,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb73f52cc/2f2bbe00af0149398d9f2772c1a1d8a7/FLAG3a60b58ff [2022-01-31 02:25:40,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb73f52cc/2f2bbe00af0149398d9f2772c1a1d8a7 [2022-01-31 02:25:40,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 02:25:40,856 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 02:25:40,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 02:25:40,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 02:25:40,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 02:25:40,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 02:25:40" (1/1) ... [2022-01-31 02:25:40,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24e0cc4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:40, skipping insertion in model container [2022-01-31 02:25:40,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 02:25:40" (1/1) ... [2022-01-31 02:25:40,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 02:25:40,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 02:25:41,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[901,914] [2022-01-31 02:25:41,108 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-01-31 02:25:41,110 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-01-31 02:25:41,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1840,1853] [2022-01-31 02:25:41,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2157,2170] [2022-01-31 02:25:41,119 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-01-31 02:25:41,121 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-01-31 02:25:41,122 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-01-31 02:25:41,124 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-01-31 02:25:41,125 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-01-31 02:25:41,126 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-01-31 02:25:41,128 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-01-31 02:25:41,130 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-01-31 02:25:41,131 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-01-31 02:25:41,315 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-01-31 02:25:41,333 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-01-31 02:25:41,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 02:25:41,364 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 02:25:41,378 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-01-31 02:25:41,379 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-01-31 02:25:41,380 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-01-31 02:25:41,381 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-01-31 02:25:41,382 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-01-31 02:25:41,395 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-01-31 02:25:41,397 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-01-31 02:25:41,398 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-01-31 02:25:41,399 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-01-31 02:25:41,399 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-01-31 02:25:41,400 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-01-31 02:25:41,401 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-01-31 02:25:41,402 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-01-31 02:25:41,403 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-01-31 02:25:41,557 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-01-31 02:25:41,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47907,47920] [2022-01-31 02:25:41,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 02:25:41,578 INFO L208 MainTranslator]: Completed translation [2022-01-31 02:25:41,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:41 WrapperNode [2022-01-31 02:25:41,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 02:25:41,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 02:25:41,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 02:25:41,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 02:25:41,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:41" (1/1) ... [2022-01-31 02:25:41,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:41" (1/1) ... [2022-01-31 02:25:41,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:41" (1/1) ... [2022-01-31 02:25:41,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:41" (1/1) ... [2022-01-31 02:25:41,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:41" (1/1) ... [2022-01-31 02:25:41,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:41" (1/1) ... [2022-01-31 02:25:41,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:41" (1/1) ... [2022-01-31 02:25:41,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 02:25:41,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 02:25:41,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 02:25:41,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 02:25:41,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:41" (1/1) ... [2022-01-31 02:25:41,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 02:25:41,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 02:25:41,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 02:25:41,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 02:25:41,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 02:25:41,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 02:25:41,788 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 02:25:41,789 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 02:25:41,789 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 02:25:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 02:25:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 02:25:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 02:25:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 02:25:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 02:25:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 02:25:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 02:25:41,790 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 02:25:41,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 02:25:41,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 02:25:41,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 02:25:41,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 02:25:41,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 02:25:41,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 02:25:42,011 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 02:25:42,012 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 02:25:42,900 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 02:25:42,918 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 02:25:42,918 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-31 02:25:42,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:25:42 BoogieIcfgContainer [2022-01-31 02:25:42,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 02:25:42,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 02:25:42,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 02:25:42,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 02:25:42,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 02:25:40" (1/3) ... [2022-01-31 02:25:42,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fd7dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:25:42, skipping insertion in model container [2022-01-31 02:25:42,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:41" (2/3) ... [2022-01-31 02:25:42,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60fd7dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:25:42, skipping insertion in model container [2022-01-31 02:25:42,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:25:42" (3/3) ... [2022-01-31 02:25:42,932 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2022-01-31 02:25:42,937 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-31 02:25:42,937 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-01-31 02:25:43,000 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 02:25:43,007 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 02:25:43,007 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-01-31 02:25:43,063 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-01-31 02:25:43,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-31 02:25:43,068 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:43,069 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:43,070 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:43,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:43,081 INFO L85 PathProgramCache]: Analyzing trace with hash -191009829, now seen corresponding path program 1 times [2022-01-31 02:25:43,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:43,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145252016] [2022-01-31 02:25:43,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:43,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:43,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:43,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:43,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:43,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145252016] [2022-01-31 02:25:43,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145252016] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:43,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:43,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 02:25:43,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539826655] [2022-01-31 02:25:43,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:43,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 02:25:43,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 02:25:43,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:25:43,400 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-01-31 02:25:44,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:44,393 INFO L93 Difference]: Finished difference Result 327 states and 589 transitions. [2022-01-31 02:25:44,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:44,413 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-01-31 02:25:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:44,423 INFO L225 Difference]: With dead ends: 327 [2022-01-31 02:25:44,424 INFO L226 Difference]: Without dead ends: 307 [2022-01-31 02:25:44,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 02:25:44,430 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 862 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:44,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [862 Valid, 179 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 02:25:44,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-01-31 02:25:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 302. [2022-01-31 02:25:44,478 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-01-31 02:25:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2022-01-31 02:25:44,482 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 11 [2022-01-31 02:25:44,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:44,482 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2022-01-31 02:25:44,483 INFO L471 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-01-31 02:25:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2022-01-31 02:25:44,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-31 02:25:44,483 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:44,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:44,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 02:25:44,484 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:44,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:44,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1626334337, now seen corresponding path program 1 times [2022-01-31 02:25:44,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:44,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720289417] [2022-01-31 02:25:44,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:44,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:44,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:44,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:44,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720289417] [2022-01-31 02:25:44,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720289417] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:44,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:44,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:44,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146249730] [2022-01-31 02:25:44,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:44,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:44,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:44,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:44,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:44,570 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-01-31 02:25:45,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:45,255 INFO L93 Difference]: Finished difference Result 312 states and 435 transitions. [2022-01-31 02:25:45,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:45,255 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-01-31 02:25:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:45,260 INFO L225 Difference]: With dead ends: 312 [2022-01-31 02:25:45,260 INFO L226 Difference]: Without dead ends: 304 [2022-01-31 02:25:45,261 INFO L932 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-01-31 02:25:45,263 INFO L933 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-01-31 02:25:45,268 INFO L934 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-01-31 02:25:45,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-01-31 02:25:45,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2022-01-31 02:25:45,290 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-01-31 02:25:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2022-01-31 02:25:45,302 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 12 [2022-01-31 02:25:45,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:45,302 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2022-01-31 02:25:45,303 INFO L471 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-01-31 02:25:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2022-01-31 02:25:45,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-31 02:25:45,303 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:45,303 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:45,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 02:25:45,304 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:45,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:45,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1610084340, now seen corresponding path program 1 times [2022-01-31 02:25:45,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:45,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978945053] [2022-01-31 02:25:45,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:45,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:45,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:45,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:45,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978945053] [2022-01-31 02:25:45,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978945053] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:45,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:45,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 02:25:45,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084765273] [2022-01-31 02:25:45,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:45,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 02:25:45,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:45,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 02:25:45,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:25:45,391 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-01-31 02:25:45,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:45,980 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2022-01-31 02:25:45,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:25:45,980 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-01-31 02:25:45,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:45,982 INFO L225 Difference]: With dead ends: 297 [2022-01-31 02:25:45,982 INFO L226 Difference]: Without dead ends: 295 [2022-01-31 02:25:45,982 INFO L932 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-01-31 02:25:45,983 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 505 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:45,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [505 Valid, 118 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 02:25:45,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-01-31 02:25:45,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2022-01-31 02:25:45,992 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-01-31 02:25:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2022-01-31 02:25:45,993 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 12 [2022-01-31 02:25:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:45,993 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2022-01-31 02:25:45,994 INFO L471 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-01-31 02:25:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2022-01-31 02:25:45,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-31 02:25:45,994 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:45,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:45,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 02:25:45,995 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:45,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:45,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1626996098, now seen corresponding path program 1 times [2022-01-31 02:25:45,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:45,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031878070] [2022-01-31 02:25:45,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:45,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:46,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:46,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:46,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031878070] [2022-01-31 02:25:46,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031878070] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:46,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:46,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 02:25:46,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492196550] [2022-01-31 02:25:46,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:46,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 02:25:46,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:46,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 02:25:46,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:25:46,047 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-01-31 02:25:46,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:46,629 INFO L93 Difference]: Finished difference Result 300 states and 363 transitions. [2022-01-31 02:25:46,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:46,630 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-01-31 02:25:46,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:46,631 INFO L225 Difference]: With dead ends: 300 [2022-01-31 02:25:46,631 INFO L226 Difference]: Without dead ends: 298 [2022-01-31 02:25:46,632 INFO L932 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-01-31 02:25:46,633 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 279 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:46,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 406 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 02:25:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-01-31 02:25:46,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2022-01-31 02:25:46,642 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-01-31 02:25:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 361 transitions. [2022-01-31 02:25:46,643 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 361 transitions. Word has length 13 [2022-01-31 02:25:46,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:46,643 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 361 transitions. [2022-01-31 02:25:46,644 INFO L471 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-01-31 02:25:46,644 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2022-01-31 02:25:46,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 02:25:46,644 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:46,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:46,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 02:25:46,645 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:46,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:46,645 INFO L85 PathProgramCache]: Analyzing trace with hash 175251398, now seen corresponding path program 1 times [2022-01-31 02:25:46,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:46,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650770915] [2022-01-31 02:25:46,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:46,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:46,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:46,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:46,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650770915] [2022-01-31 02:25:46,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650770915] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:46,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:46,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:46,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23529159] [2022-01-31 02:25:46,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:46,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:46,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:46,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:46,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:46,720 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-01-31 02:25:47,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:47,383 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2022-01-31 02:25:47,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 02:25:47,384 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-01-31 02:25:47,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:47,385 INFO L225 Difference]: With dead ends: 298 [2022-01-31 02:25:47,385 INFO L226 Difference]: Without dead ends: 296 [2022-01-31 02:25:47,386 INFO L932 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-01-31 02:25:47,387 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 467 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-01-31 02:25:47,387 INFO L934 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-01-31 02:25:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-31 02:25:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-31 02:25:47,393 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-01-31 02:25:47,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2022-01-31 02:25:47,394 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 15 [2022-01-31 02:25:47,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:47,395 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2022-01-31 02:25:47,395 INFO L471 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-01-31 02:25:47,395 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2022-01-31 02:25:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 02:25:47,396 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:47,396 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:47,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 02:25:47,396 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:47,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:47,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1137829144, now seen corresponding path program 1 times [2022-01-31 02:25:47,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:47,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362712077] [2022-01-31 02:25:47,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:47,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:47,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:47,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:47,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362712077] [2022-01-31 02:25:47,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362712077] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:47,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:47,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 02:25:47,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010180333] [2022-01-31 02:25:47,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:47,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 02:25:47,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:47,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 02:25:47,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:25:47,444 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-01-31 02:25:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:48,260 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2022-01-31 02:25:48,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:25:48,260 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-01-31 02:25:48,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:48,262 INFO L225 Difference]: With dead ends: 296 [2022-01-31 02:25:48,262 INFO L226 Difference]: Without dead ends: 292 [2022-01-31 02:25:48,262 INFO L932 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-01-31 02:25:48,263 INFO L933 BasicCegarLoop]: 345 mSDtfsCounter, 250 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:48,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 425 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 02:25:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-01-31 02:25:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-01-31 02:25:48,270 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-01-31 02:25:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2022-01-31 02:25:48,271 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 16 [2022-01-31 02:25:48,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:48,271 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2022-01-31 02:25:48,271 INFO L471 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-01-31 02:25:48,272 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2022-01-31 02:25:48,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 02:25:48,272 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:48,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:48,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 02:25:48,273 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:48,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:48,273 INFO L85 PathProgramCache]: Analyzing trace with hash 926233143, now seen corresponding path program 1 times [2022-01-31 02:25:48,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:48,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077029113] [2022-01-31 02:25:48,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:48,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:48,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:48,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:48,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:48,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077029113] [2022-01-31 02:25:48,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077029113] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:48,320 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:48,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:48,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335211553] [2022-01-31 02:25:48,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:48,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:48,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:48,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:48,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:48,322 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-01-31 02:25:48,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:48,918 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2022-01-31 02:25:48,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 02:25:48,919 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-01-31 02:25:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:48,920 INFO L225 Difference]: With dead ends: 309 [2022-01-31 02:25:48,920 INFO L226 Difference]: Without dead ends: 307 [2022-01-31 02:25:48,920 INFO L932 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-01-31 02:25:48,921 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 483 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-01-31 02:25:48,921 INFO L934 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-01-31 02:25:48,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-01-31 02:25:48,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 290. [2022-01-31 02:25:48,926 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-01-31 02:25:48,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 353 transitions. [2022-01-31 02:25:48,927 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 353 transitions. Word has length 17 [2022-01-31 02:25:48,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:48,933 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 353 transitions. [2022-01-31 02:25:48,934 INFO L471 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-01-31 02:25:48,934 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 353 transitions. [2022-01-31 02:25:48,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 02:25:48,934 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:48,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:48,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 02:25:48,935 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:48,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:48,935 INFO L85 PathProgramCache]: Analyzing trace with hash 927772343, now seen corresponding path program 1 times [2022-01-31 02:25:48,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:48,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64557880] [2022-01-31 02:25:48,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:48,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:49,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:49,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-01-31 02:25:49,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:49,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64557880] [2022-01-31 02:25:49,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64557880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:49,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:49,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:49,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114731959] [2022-01-31 02:25:49,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:49,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:49,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:49,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:49,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:49,015 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-01-31 02:25:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:49,637 INFO L93 Difference]: Finished difference Result 290 states and 353 transitions. [2022-01-31 02:25:49,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 02:25:49,638 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-01-31 02:25:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:49,639 INFO L225 Difference]: With dead ends: 290 [2022-01-31 02:25:49,639 INFO L226 Difference]: Without dead ends: 288 [2022-01-31 02:25:49,640 INFO L932 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-01-31 02:25:49,640 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 457 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:49,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 155 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 02:25:49,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-01-31 02:25:49,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-01-31 02:25:49,646 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-01-31 02:25:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2022-01-31 02:25:49,647 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 17 [2022-01-31 02:25:49,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:49,648 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2022-01-31 02:25:49,648 INFO L471 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-01-31 02:25:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2022-01-31 02:25:49,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 02:25:49,648 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:49,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:49,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 02:25:49,649 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:49,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:49,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1470973679, now seen corresponding path program 1 times [2022-01-31 02:25:49,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:49,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571394446] [2022-01-31 02:25:49,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:49,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:49,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:49,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:49,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571394446] [2022-01-31 02:25:49,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571394446] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:49,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:49,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 02:25:49,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350052471] [2022-01-31 02:25:49,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:49,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:49,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:49,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:49,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:49,763 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-01-31 02:25:50,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:50,427 INFO L93 Difference]: Finished difference Result 312 states and 377 transitions. [2022-01-31 02:25:50,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 02:25:50,428 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-01-31 02:25:50,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:50,429 INFO L225 Difference]: With dead ends: 312 [2022-01-31 02:25:50,430 INFO L226 Difference]: Without dead ends: 310 [2022-01-31 02:25:50,430 INFO L932 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-01-31 02:25:50,431 INFO L933 BasicCegarLoop]: 328 mSDtfsCounter, 317 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:50,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 404 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 02:25:50,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-01-31 02:25:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 288. [2022-01-31 02:25:50,439 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-01-31 02:25:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2022-01-31 02:25:50,440 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 17 [2022-01-31 02:25:50,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:50,440 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2022-01-31 02:25:50,441 INFO L471 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-01-31 02:25:50,441 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2022-01-31 02:25:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 02:25:50,441 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:50,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:50,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 02:25:50,442 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:50,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1350175097, now seen corresponding path program 1 times [2022-01-31 02:25:50,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:50,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455750101] [2022-01-31 02:25:50,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:50,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:50,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:50,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:50,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455750101] [2022-01-31 02:25:50,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455750101] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:50,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:50,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:50,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037565056] [2022-01-31 02:25:50,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:50,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:50,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:50,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:50,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:50,505 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-01-31 02:25:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:51,145 INFO L93 Difference]: Finished difference Result 311 states and 376 transitions. [2022-01-31 02:25:51,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 02:25:51,146 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-01-31 02:25:51,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:51,147 INFO L225 Difference]: With dead ends: 311 [2022-01-31 02:25:51,147 INFO L226 Difference]: Without dead ends: 309 [2022-01-31 02:25:51,148 INFO L932 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-01-31 02:25:51,148 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 474 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:51,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [474 Valid, 173 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 02:25:51,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-01-31 02:25:51,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 286. [2022-01-31 02:25:51,153 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-01-31 02:25:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 349 transitions. [2022-01-31 02:25:51,154 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 349 transitions. Word has length 18 [2022-01-31 02:25:51,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:51,154 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 349 transitions. [2022-01-31 02:25:51,154 INFO L471 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-01-31 02:25:51,154 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 349 transitions. [2022-01-31 02:25:51,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 02:25:51,155 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:51,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:51,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 02:25:51,155 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:51,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1351540517, now seen corresponding path program 1 times [2022-01-31 02:25:51,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:51,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203966681] [2022-01-31 02:25:51,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:51,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:51,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:51,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:51,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203966681] [2022-01-31 02:25:51,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203966681] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:51,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:51,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 02:25:51,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713553635] [2022-01-31 02:25:51,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:51,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:51,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:51,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:51,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:51,233 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-01-31 02:25:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:51,933 INFO L93 Difference]: Finished difference Result 320 states and 387 transitions. [2022-01-31 02:25:51,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 02:25:51,933 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-01-31 02:25:51,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:51,935 INFO L225 Difference]: With dead ends: 320 [2022-01-31 02:25:51,935 INFO L226 Difference]: Without dead ends: 318 [2022-01-31 02:25:51,935 INFO L932 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-01-31 02:25:51,936 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 288 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:51,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 446 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 02:25:51,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-01-31 02:25:51,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 294. [2022-01-31 02:25:51,942 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-01-31 02:25:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 359 transitions. [2022-01-31 02:25:51,943 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 359 transitions. Word has length 18 [2022-01-31 02:25:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:51,944 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 359 transitions. [2022-01-31 02:25:51,944 INFO L471 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-01-31 02:25:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 359 transitions. [2022-01-31 02:25:51,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 02:25:51,944 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:51,945 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:51,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 02:25:51,945 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:51,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:51,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1303825267, now seen corresponding path program 1 times [2022-01-31 02:25:51,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:51,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516472210] [2022-01-31 02:25:51,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:51,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:52,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:52,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:52,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516472210] [2022-01-31 02:25:52,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516472210] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:52,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:52,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 02:25:52,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720650847] [2022-01-31 02:25:52,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:52,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:52,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:52,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:52,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:52,021 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-01-31 02:25:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:52,765 INFO L93 Difference]: Finished difference Result 304 states and 369 transitions. [2022-01-31 02:25:52,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 02:25:52,766 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-01-31 02:25:52,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:52,767 INFO L225 Difference]: With dead ends: 304 [2022-01-31 02:25:52,767 INFO L226 Difference]: Without dead ends: 300 [2022-01-31 02:25:52,768 INFO L932 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-01-31 02:25:52,768 INFO L933 BasicCegarLoop]: 326 mSDtfsCounter, 262 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:52,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 442 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 02:25:52,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-01-31 02:25:52,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 295. [2022-01-31 02:25:52,774 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-01-31 02:25:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 360 transitions. [2022-01-31 02:25:52,776 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 360 transitions. Word has length 18 [2022-01-31 02:25:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:52,776 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 360 transitions. [2022-01-31 02:25:52,776 INFO L471 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-01-31 02:25:52,776 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 360 transitions. [2022-01-31 02:25:52,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 02:25:52,777 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:52,777 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:52,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 02:25:52,777 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:52,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:52,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1094248106, now seen corresponding path program 1 times [2022-01-31 02:25:52,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:52,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842054827] [2022-01-31 02:25:52,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:52,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:52,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:52,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:52,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842054827] [2022-01-31 02:25:52,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842054827] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:52,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:52,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 02:25:52,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489130171] [2022-01-31 02:25:52,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:52,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:52,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:52,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:52,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:52,850 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-01-31 02:25:53,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:53,413 INFO L93 Difference]: Finished difference Result 321 states and 388 transitions. [2022-01-31 02:25:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 02:25:53,413 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-01-31 02:25:53,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:53,414 INFO L225 Difference]: With dead ends: 321 [2022-01-31 02:25:53,414 INFO L226 Difference]: Without dead ends: 319 [2022-01-31 02:25:53,415 INFO L932 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-01-31 02:25:53,415 INFO L933 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-01-31 02:25:53,415 INFO L934 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-01-31 02:25:53,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-01-31 02:25:53,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 298. [2022-01-31 02:25:53,420 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-01-31 02:25:53,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 363 transitions. [2022-01-31 02:25:53,421 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 363 transitions. Word has length 19 [2022-01-31 02:25:53,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:53,421 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 363 transitions. [2022-01-31 02:25:53,421 INFO L471 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-01-31 02:25:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 363 transitions. [2022-01-31 02:25:53,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 02:25:53,421 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:53,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:53,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 02:25:53,422 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:53,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:53,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1750216322, now seen corresponding path program 1 times [2022-01-31 02:25:53,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:53,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511996079] [2022-01-31 02:25:53,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:53,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:53,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:53,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:53,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:53,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511996079] [2022-01-31 02:25:53,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511996079] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:53,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:53,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 02:25:53,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543008892] [2022-01-31 02:25:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:53,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 02:25:53,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:53,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 02:25:53,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:25:53,487 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-01-31 02:25:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:53,835 INFO L93 Difference]: Finished difference Result 298 states and 363 transitions. [2022-01-31 02:25:53,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:25:53,835 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-01-31 02:25:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:53,836 INFO L225 Difference]: With dead ends: 298 [2022-01-31 02:25:53,836 INFO L226 Difference]: Without dead ends: 296 [2022-01-31 02:25:53,837 INFO L932 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-01-31 02:25:53,837 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 569 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-01-31 02:25:53,837 INFO L934 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-01-31 02:25:53,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-31 02:25:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-31 02:25:53,842 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-01-31 02:25:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 361 transitions. [2022-01-31 02:25:53,848 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 361 transitions. Word has length 20 [2022-01-31 02:25:53,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:53,848 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 361 transitions. [2022-01-31 02:25:53,848 INFO L471 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-01-31 02:25:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 361 transitions. [2022-01-31 02:25:53,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 02:25:53,849 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:53,849 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:53,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 02:25:53,849 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:53,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:53,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1577872003, now seen corresponding path program 1 times [2022-01-31 02:25:53,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:53,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989797713] [2022-01-31 02:25:53,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:53,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:53,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:53,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:53,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:53,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989797713] [2022-01-31 02:25:53,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989797713] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:53,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:53,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 02:25:53,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528554687] [2022-01-31 02:25:53,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:53,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 02:25:53,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:53,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 02:25:53,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:25:53,890 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-01-31 02:25:54,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:54,380 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2022-01-31 02:25:54,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:25:54,380 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-01-31 02:25:54,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:54,381 INFO L225 Difference]: With dead ends: 296 [2022-01-31 02:25:54,382 INFO L226 Difference]: Without dead ends: 292 [2022-01-31 02:25:54,382 INFO L932 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-01-31 02:25:54,382 INFO L933 BasicCegarLoop]: 334 mSDtfsCounter, 245 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:54,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 397 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 02:25:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-01-31 02:25:54,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-01-31 02:25:54,389 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-01-31 02:25:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 357 transitions. [2022-01-31 02:25:54,390 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 357 transitions. Word has length 21 [2022-01-31 02:25:54,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:54,390 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 357 transitions. [2022-01-31 02:25:54,390 INFO L471 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-01-31 02:25:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2022-01-31 02:25:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 02:25:54,390 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:54,391 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:54,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 02:25:54,393 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:54,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:54,394 INFO L85 PathProgramCache]: Analyzing trace with hash -383054022, now seen corresponding path program 1 times [2022-01-31 02:25:54,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:54,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107515036] [2022-01-31 02:25:54,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:54,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:54,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:54,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:54,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107515036] [2022-01-31 02:25:54,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107515036] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:54,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:54,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 02:25:54,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156059276] [2022-01-31 02:25:54,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:54,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:54,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:54,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:54,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:54,471 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-01-31 02:25:55,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:55,074 INFO L93 Difference]: Finished difference Result 292 states and 357 transitions. [2022-01-31 02:25:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 02:25:55,075 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-01-31 02:25:55,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:55,076 INFO L225 Difference]: With dead ends: 292 [2022-01-31 02:25:55,076 INFO L226 Difference]: Without dead ends: 290 [2022-01-31 02:25:55,077 INFO L932 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-01-31 02:25:55,077 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 871 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:55,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [871 Valid, 107 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 02:25:55,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-01-31 02:25:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2022-01-31 02:25:55,084 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-01-31 02:25:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 352 transitions. [2022-01-31 02:25:55,085 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 352 transitions. Word has length 21 [2022-01-31 02:25:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:55,086 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 352 transitions. [2022-01-31 02:25:55,086 INFO L471 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-01-31 02:25:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 352 transitions. [2022-01-31 02:25:55,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 02:25:55,086 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:55,086 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:55,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 02:25:55,087 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:55,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:55,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1682632114, now seen corresponding path program 1 times [2022-01-31 02:25:55,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:55,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005080961] [2022-01-31 02:25:55,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:55,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:55,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:55,144 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:55,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005080961] [2022-01-31 02:25:55,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005080961] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:55,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:55,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 02:25:55,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407605919] [2022-01-31 02:25:55,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:55,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:55,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:55,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:55,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:55,145 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-01-31 02:25:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:55,749 INFO L93 Difference]: Finished difference Result 302 states and 369 transitions. [2022-01-31 02:25:55,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 02:25:55,750 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-01-31 02:25:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:55,751 INFO L225 Difference]: With dead ends: 302 [2022-01-31 02:25:55,751 INFO L226 Difference]: Without dead ends: 300 [2022-01-31 02:25:55,752 INFO L932 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-01-31 02:25:55,752 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 662 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:55,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [662 Valid, 126 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 02:25:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-01-31 02:25:55,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 282. [2022-01-31 02:25:55,758 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-01-31 02:25:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 347 transitions. [2022-01-31 02:25:55,765 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 347 transitions. Word has length 22 [2022-01-31 02:25:55,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:55,765 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 347 transitions. [2022-01-31 02:25:55,766 INFO L471 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-01-31 02:25:55,766 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 347 transitions. [2022-01-31 02:25:55,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 02:25:55,766 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:55,766 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:55,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 02:25:55,767 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:55,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:55,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1297761964, now seen corresponding path program 1 times [2022-01-31 02:25:55,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:55,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483152787] [2022-01-31 02:25:55,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:55,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:55,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:55,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:55,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483152787] [2022-01-31 02:25:55,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483152787] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:55,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:55,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 02:25:55,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844705014] [2022-01-31 02:25:55,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:55,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:55,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:55,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:55,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:55,840 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-01-31 02:25:56,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:56,371 INFO L93 Difference]: Finished difference Result 294 states and 361 transitions. [2022-01-31 02:25:56,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 02:25:56,372 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-01-31 02:25:56,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:56,373 INFO L225 Difference]: With dead ends: 294 [2022-01-31 02:25:56,373 INFO L226 Difference]: Without dead ends: 292 [2022-01-31 02:25:56,373 INFO L932 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-01-31 02:25:56,374 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 655 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:56,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [655 Valid, 120 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 02:25:56,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-01-31 02:25:56,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 277. [2022-01-31 02:25:56,379 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-01-31 02:25:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 341 transitions. [2022-01-31 02:25:56,380 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 341 transitions. Word has length 22 [2022-01-31 02:25:56,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:56,380 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 341 transitions. [2022-01-31 02:25:56,380 INFO L471 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-01-31 02:25:56,380 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 341 transitions. [2022-01-31 02:25:56,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 02:25:56,381 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:56,381 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:56,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 02:25:56,381 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:56,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:56,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1345477214, now seen corresponding path program 1 times [2022-01-31 02:25:56,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:56,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473206208] [2022-01-31 02:25:56,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:56,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:56,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:56,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:56,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473206208] [2022-01-31 02:25:56,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473206208] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:56,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:56,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 02:25:56,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618885543] [2022-01-31 02:25:56,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:56,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:25:56,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:56,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:25:56,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:25:56,458 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-01-31 02:25:57,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:57,009 INFO L93 Difference]: Finished difference Result 277 states and 341 transitions. [2022-01-31 02:25:57,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 02:25:57,009 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-01-31 02:25:57,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:57,010 INFO L225 Difference]: With dead ends: 277 [2022-01-31 02:25:57,010 INFO L226 Difference]: Without dead ends: 254 [2022-01-31 02:25:57,011 INFO L932 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-01-31 02:25:57,011 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 638 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:57,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [638 Valid, 110 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 02:25:57,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-01-31 02:25:57,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2022-01-31 02:25:57,016 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-01-31 02:25:57,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2022-01-31 02:25:57,017 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 22 [2022-01-31 02:25:57,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:57,017 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2022-01-31 02:25:57,017 INFO L471 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-01-31 02:25:57,018 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2022-01-31 02:25:57,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-01-31 02:25:57,022 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:57,022 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:57,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 02:25:57,024 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:25:57,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:57,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1242952801, now seen corresponding path program 1 times [2022-01-31 02:25:57,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:57,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539355408] [2022-01-31 02:25:57,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:57,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:58,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:25:58,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:58,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539355408] [2022-01-31 02:25:58,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539355408] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:58,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:58,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-01-31 02:25:58,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093718589] [2022-01-31 02:25:58,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:58,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-01-31 02:25:58,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:58,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-01-31 02:25:58,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1836, Invalid=2196, Unknown=0, NotChecked=0, Total=4032 [2022-01-31 02:25:58,606 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-01-31 02:26:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:26:00,699 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2022-01-31 02:26:00,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-31 02:26:00,699 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-01-31 02:26:00,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:26:00,700 INFO L225 Difference]: With dead ends: 255 [2022-01-31 02:26:00,701 INFO L226 Difference]: Without dead ends: 253 [2022-01-31 02:26:00,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=5560, Invalid=9940, Unknown=0, NotChecked=0, Total=15500 [2022-01-31 02:26:00,706 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 825 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 02:26:00,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [825 Valid, 46 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 02:26:00,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-01-31 02:26:00,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2022-01-31 02:26:00,713 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-01-31 02:26:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2022-01-31 02:26:00,714 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2022-01-31 02:26:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:26:00,714 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2022-01-31 02:26:00,714 INFO L471 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-01-31 02:26:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2022-01-31 02:26:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-01-31 02:26:00,716 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:26:00,716 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:26:00,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 02:26:00,716 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:26:00,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:26:00,716 INFO L85 PathProgramCache]: Analyzing trace with hash 123173085, now seen corresponding path program 1 times [2022-01-31 02:26:00,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:26:00,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996853603] [2022-01-31 02:26:00,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:26:00,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:26:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:00,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:26:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 02:26:01,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:26:01,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996853603] [2022-01-31 02:26:01,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996853603] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:26:01,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:26:01,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 02:26:01,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212653679] [2022-01-31 02:26:01,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:26:01,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 02:26:01,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:26:01,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 02:26:01,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-31 02:26:01,003 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 6 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-01-31 02:26:01,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:26:01,468 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2022-01-31 02:26:01,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 02:26:01,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 6 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-01-31 02:26:01,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:26:01,469 INFO L225 Difference]: With dead ends: 254 [2022-01-31 02:26:01,469 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 02:26:01,470 INFO L932 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-01-31 02:26:01,470 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 605 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 02:26:01,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [605 Valid, 26 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 02:26:01,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 02:26:01,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 02:26:01,471 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-01-31 02:26:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 02:26:01,471 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 249 [2022-01-31 02:26:01,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:26:01,471 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 02:26:01,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 6 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-01-31 02:26:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 02:26:01,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 02:26:01,473 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-01-31 02:26:01,473 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-01-31 02:26:01,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-01-31 02:26:01,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-01-31 02:26:01,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-01-31 02:26:01,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-01-31 02:26:01,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-01-31 02:26:01,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-01-31 02:26:01,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-01-31 02:26:01,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-01-31 02:26:01,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-01-31 02:26:01,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-01-31 02:26:01,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-01-31 02:26:01,474 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-01-31 02:26:01,475 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-01-31 02:26:01,475 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-01-31 02:26:01,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 02:26:01,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 02:26:02,540 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-01-31 02:26:02,540 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-01-31 02:26:02,540 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-01-31 02:26:02,540 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-01-31 02:26:02,540 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-01-31 02:26:02,540 INFO L858 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-01-31 02:26:02,540 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-01-31 02:26:02,540 INFO L858 garLoopResultBuilder]: For program point mainEXIT(lines 16 3008) no Hoare annotation was computed. [2022-01-31 02:26:02,541 INFO L858 garLoopResultBuilder]: For program point L1555(lines 1555 2805) no Hoare annotation was computed. [2022-01-31 02:26:02,541 INFO L858 garLoopResultBuilder]: For program point L2546(lines 2546 2653) no Hoare annotation was computed. [2022-01-31 02:26:02,541 INFO L858 garLoopResultBuilder]: For program point L2480(lines 2480 2663) no Hoare annotation was computed. [2022-01-31 02:26:02,541 INFO L858 garLoopResultBuilder]: For program point L432(lines 432 2978) no Hoare annotation was computed. [2022-01-31 02:26:02,541 INFO L858 garLoopResultBuilder]: For program point L697(lines 697 2937) no Hoare annotation was computed. [2022-01-31 02:26:02,541 INFO L858 garLoopResultBuilder]: For program point L1688(lines 1688 2785) no Hoare annotation was computed. [2022-01-31 02:26:02,541 INFO L858 garLoopResultBuilder]: For program point L1622(lines 1622 2795) no Hoare annotation was computed. [2022-01-31 02:26:02,541 INFO L858 garLoopResultBuilder]: For program point L103(lines 103 125) no Hoare annotation was computed. [2022-01-31 02:26:02,541 INFO L858 garLoopResultBuilder]: For program point L1953(lines 1953 2744) no Hoare annotation was computed. [2022-01-31 02:26:02,541 INFO L858 garLoopResultBuilder]: For program point L830(lines 830 2917) no Hoare annotation was computed. [2022-01-31 02:26:02,541 INFO L858 garLoopResultBuilder]: For program point L764(lines 764 2927) no Hoare annotation was computed. [2022-01-31 02:26:02,541 INFO L858 garLoopResultBuilder]: For program point L2614(lines 2614 2643) no Hoare annotation was computed. [2022-01-31 02:26:02,541 INFO L858 garLoopResultBuilder]: For program point L2218(lines 2218 2703) no Hoare annotation was computed. [2022-01-31 02:26:02,541 INFO L858 garLoopResultBuilder]: For program point L1095(lines 1095 2876) no Hoare annotation was computed. [2022-01-31 02:26:02,541 INFO L858 garLoopResultBuilder]: For program point L1360(lines 1360 2835) no Hoare annotation was computed. [2022-01-31 02:26:02,541 INFO L858 garLoopResultBuilder]: For program point L2351(lines 2351 2683) no Hoare annotation was computed. [2022-01-31 02:26:02,542 INFO L858 garLoopResultBuilder]: For program point L2285(lines 2285 2693) no Hoare annotation was computed. [2022-01-31 02:26:02,542 INFO L858 garLoopResultBuilder]: For program point L171(lines 171 193) no Hoare annotation was computed. [2022-01-31 02:26:02,542 INFO L858 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2022-01-31 02:26:02,542 INFO L858 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2022-01-31 02:26:02,542 INFO L858 garLoopResultBuilder]: For program point L2616(line 2616) no Hoare annotation was computed. [2022-01-31 02:26:02,542 INFO L858 garLoopResultBuilder]: For program point L502(lines 502 2967) no Hoare annotation was computed. [2022-01-31 02:26:02,542 INFO L858 garLoopResultBuilder]: For program point L1493(lines 1493 2815) no Hoare annotation was computed. [2022-01-31 02:26:02,542 INFO L858 garLoopResultBuilder]: For program point L1427(lines 1427 2825) no Hoare annotation was computed. [2022-01-31 02:26:02,542 INFO L858 garLoopResultBuilder]: For program point L1758(lines 1758 2774) no Hoare annotation was computed. [2022-01-31 02:26:02,542 INFO L858 garLoopResultBuilder]: For program point L635(lines 635 2947) no Hoare annotation was computed. [2022-01-31 02:26:02,542 INFO L858 garLoopResultBuilder]: For program point L569(lines 569 2957) no Hoare annotation was computed. [2022-01-31 02:26:02,542 INFO L858 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-01-31 02:26:02,542 INFO L858 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2022-01-31 02:26:02,542 INFO L858 garLoopResultBuilder]: For program point L2023(lines 2023 2733) no Hoare annotation was computed. [2022-01-31 02:26:02,542 INFO L858 garLoopResultBuilder]: For program point L900(lines 900 2906) no Hoare annotation was computed. [2022-01-31 02:26:02,543 INFO L858 garLoopResultBuilder]: For program point L1165(lines 1165 2865) no Hoare annotation was computed. [2022-01-31 02:26:02,543 INFO L858 garLoopResultBuilder]: For program point L2156(lines 2156 2713) no Hoare annotation was computed. [2022-01-31 02:26:02,543 INFO L858 garLoopResultBuilder]: For program point L2090(lines 2090 2723) no Hoare annotation was computed. [2022-01-31 02:26:02,543 INFO L858 garLoopResultBuilder]: For program point L2421(lines 2421 2672) no Hoare annotation was computed. [2022-01-31 02:26:02,543 INFO L858 garLoopResultBuilder]: For program point L307(lines 307 2997) no Hoare annotation was computed. [2022-01-31 02:26:02,543 INFO L858 garLoopResultBuilder]: For program point L1298(lines 1298 2845) no Hoare annotation was computed. [2022-01-31 02:26:02,543 INFO L858 garLoopResultBuilder]: For program point L1232(lines 1232 2855) no Hoare annotation was computed. [2022-01-31 02:26:02,543 INFO L858 garLoopResultBuilder]: For program point L1563(lines 1563 2804) no Hoare annotation was computed. [2022-01-31 02:26:02,543 INFO L858 garLoopResultBuilder]: For program point L440(lines 440 2977) no Hoare annotation was computed. [2022-01-31 02:26:02,543 INFO L858 garLoopResultBuilder]: For program point L374(lines 374 2987) no Hoare annotation was computed. [2022-01-31 02:26:02,543 INFO L858 garLoopResultBuilder]: For program point L1828(lines 1828 2763) no Hoare annotation was computed. [2022-01-31 02:26:02,543 INFO L858 garLoopResultBuilder]: For program point L705(lines 705 2936) no Hoare annotation was computed. [2022-01-31 02:26:02,543 INFO L858 garLoopResultBuilder]: For program point L45(lines 45 55) no Hoare annotation was computed. [2022-01-31 02:26:02,543 INFO L858 garLoopResultBuilder]: For program point L970(lines 970 2895) no Hoare annotation was computed. [2022-01-31 02:26:02,543 INFO L858 garLoopResultBuilder]: For program point L1961(lines 1961 2743) no Hoare annotation was computed. [2022-01-31 02:26:02,543 INFO L858 garLoopResultBuilder]: For program point L1895(lines 1895 2753) no Hoare annotation was computed. [2022-01-31 02:26:02,544 INFO L858 garLoopResultBuilder]: For program point L2226(lines 2226 2702) no Hoare annotation was computed. [2022-01-31 02:26:02,544 INFO L858 garLoopResultBuilder]: For program point L1103(lines 1103 2875) no Hoare annotation was computed. [2022-01-31 02:26:02,544 INFO L858 garLoopResultBuilder]: For program point L1037(lines 1037 2885) no Hoare annotation was computed. [2022-01-31 02:26:02,544 INFO L858 garLoopResultBuilder]: For program point L2623(lines 2623 2642) no Hoare annotation was computed. [2022-01-31 02:26:02,544 INFO L858 garLoopResultBuilder]: For program point L2491(lines 2491 2661) no Hoare annotation was computed. [2022-01-31 02:26:02,544 INFO L858 garLoopResultBuilder]: For program point L1368(lines 1368 2834) no Hoare annotation was computed. [2022-01-31 02:26:02,544 INFO L858 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-01-31 02:26:02,544 INFO L858 garLoopResultBuilder]: For program point L1633(lines 1633 2793) no Hoare annotation was computed. [2022-01-31 02:26:02,544 INFO L858 garLoopResultBuilder]: For program point L2558(lines 2558 2651) no Hoare annotation was computed. [2022-01-31 02:26:02,544 INFO L858 garLoopResultBuilder]: For program point L510(lines 510 2966) no Hoare annotation was computed. [2022-01-31 02:26:02,544 INFO L858 garLoopResultBuilder]: For program point L246(lines 246 281) no Hoare annotation was computed. [2022-01-31 02:26:02,544 INFO L858 garLoopResultBuilder]: For program point L775(lines 775 2925) no Hoare annotation was computed. [2022-01-31 02:26:02,544 INFO L858 garLoopResultBuilder]: For program point L1766(lines 1766 2773) no Hoare annotation was computed. [2022-01-31 02:26:02,544 INFO L858 garLoopResultBuilder]: For program point L1700(lines 1700 2783) no Hoare annotation was computed. [2022-01-31 02:26:02,545 INFO L854 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-01-31 02:26:02,545 INFO L858 garLoopResultBuilder]: For program point L115(lines 115 123) no Hoare annotation was computed. [2022-01-31 02:26:02,545 INFO L858 garLoopResultBuilder]: For program point L2031(lines 2031 2732) no Hoare annotation was computed. [2022-01-31 02:26:02,545 INFO L858 garLoopResultBuilder]: For program point L908(lines 908 2905) no Hoare annotation was computed. [2022-01-31 02:26:02,545 INFO L858 garLoopResultBuilder]: For program point L842(lines 842 2915) no Hoare annotation was computed. [2022-01-31 02:26:02,545 INFO L858 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2022-01-31 02:26:02,545 INFO L858 garLoopResultBuilder]: For program point L2296(lines 2296 2691) no Hoare annotation was computed. [2022-01-31 02:26:02,545 INFO L858 garLoopResultBuilder]: For program point L1173(lines 1173 2864) no Hoare annotation was computed. [2022-01-31 02:26:02,545 INFO L858 garLoopResultBuilder]: For program point L1438(lines 1438 2823) no Hoare annotation was computed. [2022-01-31 02:26:02,545 INFO L858 garLoopResultBuilder]: For program point L2429(lines 2429 2671) no Hoare annotation was computed. [2022-01-31 02:26:02,545 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 2996) no Hoare annotation was computed. [2022-01-31 02:26:02,545 INFO L858 garLoopResultBuilder]: For program point L2363(lines 2363 2681) no Hoare annotation was computed. [2022-01-31 02:26:02,545 INFO L858 garLoopResultBuilder]: For program point L183(lines 183 191) no Hoare annotation was computed. [2022-01-31 02:26:02,545 INFO L858 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-01-31 02:26:02,545 INFO L858 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2022-01-31 02:26:02,545 INFO L858 garLoopResultBuilder]: For program point L580(lines 580 2955) no Hoare annotation was computed. [2022-01-31 02:26:02,546 INFO L858 garLoopResultBuilder]: For program point L1571(lines 1571 2803) no Hoare annotation was computed. [2022-01-31 02:26:02,546 INFO L858 garLoopResultBuilder]: For program point L1505(lines 1505 2813) no Hoare annotation was computed. [2022-01-31 02:26:02,546 INFO L858 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) no Hoare annotation was computed. [2022-01-31 02:26:02,546 INFO L858 garLoopResultBuilder]: For program point L1836(lines 1836 2762) no Hoare annotation was computed. [2022-01-31 02:26:02,546 INFO L858 garLoopResultBuilder]: For program point L713(lines 713 2935) no Hoare annotation was computed. [2022-01-31 02:26:02,546 INFO L858 garLoopResultBuilder]: For program point L647(lines 647 2945) no Hoare annotation was computed. [2022-01-31 02:26:02,546 INFO L858 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-01-31 02:26:02,546 INFO L858 garLoopResultBuilder]: For program point L2101(lines 2101 2721) no Hoare annotation was computed. [2022-01-31 02:26:02,546 INFO L858 garLoopResultBuilder]: For program point L978(lines 978 2894) no Hoare annotation was computed. [2022-01-31 02:26:02,546 INFO L858 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 2604) no Hoare annotation was computed. [2022-01-31 02:26:02,546 INFO L858 garLoopResultBuilder]: For program point L1243(lines 1243 2853) no Hoare annotation was computed. [2022-01-31 02:26:02,546 INFO L858 garLoopResultBuilder]: For program point L2234(lines 2234 2701) no Hoare annotation was computed. [2022-01-31 02:26:02,546 INFO L858 garLoopResultBuilder]: For program point L2168(lines 2168 2711) no Hoare annotation was computed. [2022-01-31 02:26:02,546 INFO L858 garLoopResultBuilder]: For program point L2631(lines 2631 2641) no Hoare annotation was computed. [2022-01-31 02:26:02,546 INFO L858 garLoopResultBuilder]: For program point L2499(lines 2499 2660) no Hoare annotation was computed. [2022-01-31 02:26:02,547 INFO L858 garLoopResultBuilder]: For program point L385(lines 385 2985) no Hoare annotation was computed. [2022-01-31 02:26:02,547 INFO L858 garLoopResultBuilder]: For program point L1376(lines 1376 2833) no Hoare annotation was computed. [2022-01-31 02:26:02,547 INFO L858 garLoopResultBuilder]: For program point L1310(lines 1310 2843) no Hoare annotation was computed. [2022-01-31 02:26:02,547 INFO L858 garLoopResultBuilder]: For program point L253(lines 253 275) no Hoare annotation was computed. [2022-01-31 02:26:02,547 INFO L858 garLoopResultBuilder]: For program point L1641(lines 1641 2792) no Hoare annotation was computed. [2022-01-31 02:26:02,547 INFO L858 garLoopResultBuilder]: For program point L518(lines 518 2965) no Hoare annotation was computed. [2022-01-31 02:26:02,548 INFO L858 garLoopResultBuilder]: For program point L452(lines 452 2975) no Hoare annotation was computed. [2022-01-31 02:26:02,548 INFO L858 garLoopResultBuilder]: For program point L1906(lines 1906 2751) no Hoare annotation was computed. [2022-01-31 02:26:02,549 INFO L858 garLoopResultBuilder]: For program point L783(lines 783 2924) no Hoare annotation was computed. [2022-01-31 02:26:02,549 INFO L858 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2022-01-31 02:26:02,549 INFO L858 garLoopResultBuilder]: For program point L1048(lines 1048 2883) no Hoare annotation was computed. [2022-01-31 02:26:02,549 INFO L858 garLoopResultBuilder]: For program point L2039(lines 2039 2731) no Hoare annotation was computed. [2022-01-31 02:26:02,549 INFO L858 garLoopResultBuilder]: For program point L1973(lines 1973 2741) no Hoare annotation was computed. [2022-01-31 02:26:02,549 INFO L854 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-01-31 02:26:02,549 INFO L858 garLoopResultBuilder]: For program point L2304(lines 2304 2690) no Hoare annotation was computed. [2022-01-31 02:26:02,549 INFO L858 garLoopResultBuilder]: For program point L1181(lines 1181 2863) no Hoare annotation was computed. [2022-01-31 02:26:02,549 INFO L858 garLoopResultBuilder]: For program point L1115(lines 1115 2873) no Hoare annotation was computed. [2022-01-31 02:26:02,549 INFO L858 garLoopResultBuilder]: For program point L2569(lines 2569 2649) no Hoare annotation was computed. [2022-01-31 02:26:02,549 INFO L858 garLoopResultBuilder]: For program point L1446(lines 1446 2822) no Hoare annotation was computed. [2022-01-31 02:26:02,549 INFO L858 garLoopResultBuilder]: For program point L323(lines 323 2995) no Hoare annotation was computed. [2022-01-31 02:26:02,549 INFO L858 garLoopResultBuilder]: For program point L1711(lines 1711 2781) no Hoare annotation was computed. [2022-01-31 02:26:02,549 INFO L858 garLoopResultBuilder]: For program point L588(lines 588 2954) no Hoare annotation was computed. [2022-01-31 02:26:02,549 INFO L858 garLoopResultBuilder]: For program point L853(lines 853 2913) no Hoare annotation was computed. [2022-01-31 02:26:02,549 INFO L858 garLoopResultBuilder]: For program point L1844(lines 1844 2761) no Hoare annotation was computed. [2022-01-31 02:26:02,550 INFO L858 garLoopResultBuilder]: For program point L1778(lines 1778 2771) no Hoare annotation was computed. [2022-01-31 02:26:02,550 INFO L858 garLoopResultBuilder]: For program point L2109(lines 2109 2720) no Hoare annotation was computed. [2022-01-31 02:26:02,550 INFO L858 garLoopResultBuilder]: For program point L986(lines 986 2893) no Hoare annotation was computed. [2022-01-31 02:26:02,550 INFO L858 garLoopResultBuilder]: For program point L920(lines 920 2903) no Hoare annotation was computed. [2022-01-31 02:26:02,550 INFO L858 garLoopResultBuilder]: For program point L2374(lines 2374 2679) no Hoare annotation was computed. [2022-01-31 02:26:02,550 INFO L858 garLoopResultBuilder]: For program point L1251(lines 1251 2852) no Hoare annotation was computed. [2022-01-31 02:26:02,550 INFO L858 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2022-01-31 02:26:02,550 INFO L858 garLoopResultBuilder]: For program point L1516(lines 1516 2811) no Hoare annotation was computed. [2022-01-31 02:26:02,550 INFO L858 garLoopResultBuilder]: For program point L2507(lines 2507 2659) no Hoare annotation was computed. [2022-01-31 02:26:02,550 INFO L858 garLoopResultBuilder]: For program point L393(lines 393 2984) no Hoare annotation was computed. [2022-01-31 02:26:02,550 INFO L858 garLoopResultBuilder]: For program point L2441(lines 2441 2669) no Hoare annotation was computed. [2022-01-31 02:26:02,550 INFO L858 garLoopResultBuilder]: For program point L658(lines 658 2943) no Hoare annotation was computed. [2022-01-31 02:26:02,550 INFO L858 garLoopResultBuilder]: For program point L1649(lines 1649 2791) no Hoare annotation was computed. [2022-01-31 02:26:02,550 INFO L854 garLoopResultBuilder]: At program point L2640(lines 2591 2647) the Hoare annotation is: (and (<= 59 main_~main__t~0) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) [2022-01-31 02:26:02,551 INFO L858 garLoopResultBuilder]: For program point L1583(lines 1583 2801) no Hoare annotation was computed. [2022-01-31 02:26:02,551 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 3001) no Hoare annotation was computed. [2022-01-31 02:26:02,551 INFO L858 garLoopResultBuilder]: For program point L1914(lines 1914 2750) no Hoare annotation was computed. [2022-01-31 02:26:02,551 INFO L858 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-01-31 02:26:02,551 INFO L858 garLoopResultBuilder]: For program point L791(lines 791 2923) no Hoare annotation was computed. [2022-01-31 02:26:02,551 INFO L858 garLoopResultBuilder]: For program point L725(lines 725 2933) no Hoare annotation was computed. [2022-01-31 02:26:02,551 INFO L858 garLoopResultBuilder]: For program point L2179(lines 2179 2709) no Hoare annotation was computed. [2022-01-31 02:26:02,551 INFO L858 garLoopResultBuilder]: For program point L1056(lines 1056 2882) no Hoare annotation was computed. [2022-01-31 02:26:02,551 INFO L858 garLoopResultBuilder]: For program point L1321(lines 1321 2841) no Hoare annotation was computed. [2022-01-31 02:26:02,551 INFO L858 garLoopResultBuilder]: For program point L2312(lines 2312 2689) no Hoare annotation was computed. [2022-01-31 02:26:02,551 INFO L858 garLoopResultBuilder]: For program point L2246(lines 2246 2699) no Hoare annotation was computed. [2022-01-31 02:26:02,551 INFO L858 garLoopResultBuilder]: For program point L132(lines 132 282) no Hoare annotation was computed. [2022-01-31 02:26:02,551 INFO L858 garLoopResultBuilder]: For program point L2577(lines 2577 2648) no Hoare annotation was computed. [2022-01-31 02:26:02,551 INFO L858 garLoopResultBuilder]: For program point L463(lines 463 2973) no Hoare annotation was computed. [2022-01-31 02:26:02,551 INFO L858 garLoopResultBuilder]: For program point L1454(lines 1454 2821) no Hoare annotation was computed. [2022-01-31 02:26:02,551 INFO L858 garLoopResultBuilder]: For program point L1388(lines 1388 2831) no Hoare annotation was computed. [2022-01-31 02:26:02,551 INFO L858 garLoopResultBuilder]: For program point L265(lines 265 273) no Hoare annotation was computed. [2022-01-31 02:26:02,552 INFO L858 garLoopResultBuilder]: For program point L1719(lines 1719 2780) no Hoare annotation was computed. [2022-01-31 02:26:02,552 INFO L858 garLoopResultBuilder]: For program point L596(lines 596 2953) no Hoare annotation was computed. [2022-01-31 02:26:02,552 INFO L858 garLoopResultBuilder]: For program point L530(lines 530 2963) no Hoare annotation was computed. [2022-01-31 02:26:02,552 INFO L858 garLoopResultBuilder]: For program point L1984(lines 1984 2739) no Hoare annotation was computed. [2022-01-31 02:26:02,552 INFO L858 garLoopResultBuilder]: For program point L861(lines 861 2912) no Hoare annotation was computed. [2022-01-31 02:26:02,552 INFO L858 garLoopResultBuilder]: For program point L267(line 267) no Hoare annotation was computed. [2022-01-31 02:26:02,552 INFO L858 garLoopResultBuilder]: For program point L1126(lines 1126 2871) no Hoare annotation was computed. [2022-01-31 02:26:02,552 INFO L858 garLoopResultBuilder]: For program point L2117(lines 2117 2719) no Hoare annotation was computed. [2022-01-31 02:26:02,552 INFO L858 garLoopResultBuilder]: For program point L2051(lines 2051 2729) no Hoare annotation was computed. [2022-01-31 02:26:02,552 INFO L858 garLoopResultBuilder]: For program point L2382(lines 2382 2678) no Hoare annotation was computed. [2022-01-31 02:26:02,552 INFO L858 garLoopResultBuilder]: For program point L1259(lines 1259 2851) no Hoare annotation was computed. [2022-01-31 02:26:02,552 INFO L858 garLoopResultBuilder]: For program point L1193(lines 1193 2861) no Hoare annotation was computed. [2022-01-31 02:26:02,552 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 240) no Hoare annotation was computed. [2022-01-31 02:26:02,552 INFO L858 garLoopResultBuilder]: For program point L1524(lines 1524 2810) no Hoare annotation was computed. [2022-01-31 02:26:02,552 INFO L858 garLoopResultBuilder]: For program point L401(lines 401 2983) no Hoare annotation was computed. [2022-01-31 02:26:02,552 INFO L858 garLoopResultBuilder]: For program point L335(lines 335 2993) no Hoare annotation was computed. [2022-01-31 02:26:02,553 INFO L858 garLoopResultBuilder]: For program point mainFINAL(lines 16 3008) no Hoare annotation was computed. [2022-01-31 02:26:02,553 INFO L858 garLoopResultBuilder]: For program point L1789(lines 1789 2769) no Hoare annotation was computed. [2022-01-31 02:26:02,553 INFO L858 garLoopResultBuilder]: For program point L666(lines 666 2942) no Hoare annotation was computed. [2022-01-31 02:26:02,553 INFO L858 garLoopResultBuilder]: For program point L931(lines 931 2901) no Hoare annotation was computed. [2022-01-31 02:26:02,553 INFO L858 garLoopResultBuilder]: For program point L1922(lines 1922 2749) no Hoare annotation was computed. [2022-01-31 02:26:02,553 INFO L858 garLoopResultBuilder]: For program point L1856(lines 1856 2759) no Hoare annotation was computed. [2022-01-31 02:26:02,553 INFO L858 garLoopResultBuilder]: For program point L205(lines 205 229) no Hoare annotation was computed. [2022-01-31 02:26:02,553 INFO L858 garLoopResultBuilder]: For program point L2187(lines 2187 2708) no Hoare annotation was computed. [2022-01-31 02:26:02,553 INFO L858 garLoopResultBuilder]: For program point L1064(lines 1064 2881) no Hoare annotation was computed. [2022-01-31 02:26:02,553 INFO L858 garLoopResultBuilder]: For program point L998(lines 998 2891) no Hoare annotation was computed. [2022-01-31 02:26:02,553 INFO L858 garLoopResultBuilder]: For program point L2452(lines 2452 2667) no Hoare annotation was computed. [2022-01-31 02:26:02,553 INFO L858 garLoopResultBuilder]: For program point L1329(lines 1329 2840) no Hoare annotation was computed. [2022-01-31 02:26:02,553 INFO L858 garLoopResultBuilder]: For program point L74(lines 74 286) no Hoare annotation was computed. [2022-01-31 02:26:02,553 INFO L858 garLoopResultBuilder]: For program point L1594(lines 1594 2799) no Hoare annotation was computed. [2022-01-31 02:26:02,553 INFO L858 garLoopResultBuilder]: For program point L2585(lines 2585 2647) no Hoare annotation was computed. [2022-01-31 02:26:02,553 INFO L858 garLoopResultBuilder]: For program point L471(lines 471 2972) no Hoare annotation was computed. [2022-01-31 02:26:02,553 INFO L858 garLoopResultBuilder]: For program point L2519(lines 2519 2657) no Hoare annotation was computed. [2022-01-31 02:26:02,554 INFO L858 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-01-31 02:26:02,554 INFO L858 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2022-01-31 02:26:02,554 INFO L858 garLoopResultBuilder]: For program point L736(lines 736 2931) no Hoare annotation was computed. [2022-01-31 02:26:02,554 INFO L858 garLoopResultBuilder]: For program point L1727(lines 1727 2779) no Hoare annotation was computed. [2022-01-31 02:26:02,554 INFO L858 garLoopResultBuilder]: For program point L1661(lines 1661 2789) no Hoare annotation was computed. [2022-01-31 02:26:02,554 INFO L858 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-01-31 02:26:02,554 INFO L858 garLoopResultBuilder]: For program point L1992(lines 1992 2738) no Hoare annotation was computed. [2022-01-31 02:26:02,554 INFO L858 garLoopResultBuilder]: For program point L869(lines 869 2911) no Hoare annotation was computed. [2022-01-31 02:26:02,554 INFO L858 garLoopResultBuilder]: For program point L803(lines 803 2921) no Hoare annotation was computed. [2022-01-31 02:26:02,554 INFO L858 garLoopResultBuilder]: For program point L2257(lines 2257 2697) no Hoare annotation was computed. [2022-01-31 02:26:02,554 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 234) no Hoare annotation was computed. [2022-01-31 02:26:02,554 INFO L858 garLoopResultBuilder]: For program point L1134(lines 1134 2870) no Hoare annotation was computed. [2022-01-31 02:26:02,554 INFO L858 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2022-01-31 02:26:02,554 INFO L858 garLoopResultBuilder]: For program point L1399(lines 1399 2829) no Hoare annotation was computed. [2022-01-31 02:26:02,554 INFO L858 garLoopResultBuilder]: For program point L2390(lines 2390 2677) no Hoare annotation was computed. [2022-01-31 02:26:02,554 INFO L858 garLoopResultBuilder]: For program point L2324(lines 2324 2687) no Hoare annotation was computed. [2022-01-31 02:26:02,555 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 2961) no Hoare annotation was computed. [2022-01-31 02:26:02,555 INFO L858 garLoopResultBuilder]: For program point L1532(lines 1532 2809) no Hoare annotation was computed. [2022-01-31 02:26:02,555 INFO L858 garLoopResultBuilder]: For program point L1466(lines 1466 2819) no Hoare annotation was computed. [2022-01-31 02:26:02,555 INFO L858 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-01-31 02:26:02,555 INFO L858 garLoopResultBuilder]: For program point L1797(lines 1797 2768) no Hoare annotation was computed. [2022-01-31 02:26:02,555 INFO L858 garLoopResultBuilder]: For program point L674(lines 674 2941) no Hoare annotation was computed. [2022-01-31 02:26:02,555 INFO L858 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 35) no Hoare annotation was computed. [2022-01-31 02:26:02,555 INFO L858 garLoopResultBuilder]: For program point L608(lines 608 2951) no Hoare annotation was computed. [2022-01-31 02:26:02,555 INFO L858 garLoopResultBuilder]: For program point L2062(lines 2062 2727) no Hoare annotation was computed. [2022-01-31 02:26:02,555 INFO L858 garLoopResultBuilder]: For program point L939(lines 939 2900) no Hoare annotation was computed. [2022-01-31 02:26:02,555 INFO L858 garLoopResultBuilder]: For program point L1204(lines 1204 2859) no Hoare annotation was computed. [2022-01-31 02:26:02,555 INFO L858 garLoopResultBuilder]: For program point L2195(lines 2195 2707) no Hoare annotation was computed. [2022-01-31 02:26:02,555 INFO L858 garLoopResultBuilder]: For program point L2129(lines 2129 2717) no Hoare annotation was computed. [2022-01-31 02:26:02,555 INFO L858 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2022-01-31 02:26:02,555 INFO L858 garLoopResultBuilder]: For program point L2460(lines 2460 2666) no Hoare annotation was computed. [2022-01-31 02:26:02,555 INFO L858 garLoopResultBuilder]: For program point L346(lines 346 2991) no Hoare annotation was computed. [2022-01-31 02:26:02,556 INFO L858 garLoopResultBuilder]: For program point L1337(lines 1337 2839) no Hoare annotation was computed. [2022-01-31 02:26:02,556 INFO L854 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-01-31 02:26:02,556 INFO L858 garLoopResultBuilder]: For program point L1271(lines 1271 2849) no Hoare annotation was computed. [2022-01-31 02:26:02,556 INFO L858 garLoopResultBuilder]: For program point L1602(lines 1602 2798) no Hoare annotation was computed. [2022-01-31 02:26:02,556 INFO L858 garLoopResultBuilder]: For program point L479(lines 479 2971) no Hoare annotation was computed. [2022-01-31 02:26:02,556 INFO L858 garLoopResultBuilder]: For program point L413(lines 413 2981) no Hoare annotation was computed. [2022-01-31 02:26:02,556 INFO L858 garLoopResultBuilder]: For program point L1867(lines 1867 2757) no Hoare annotation was computed. [2022-01-31 02:26:02,556 INFO L858 garLoopResultBuilder]: For program point L744(lines 744 2930) no Hoare annotation was computed. [2022-01-31 02:26:02,556 INFO L858 garLoopResultBuilder]: For program point L1009(lines 1009 2889) no Hoare annotation was computed. [2022-01-31 02:26:02,556 INFO L858 garLoopResultBuilder]: For program point L2000(lines 2000 2737) no Hoare annotation was computed. [2022-01-31 02:26:02,556 INFO L858 garLoopResultBuilder]: For program point L1934(lines 1934 2747) no Hoare annotation was computed. [2022-01-31 02:26:02,556 INFO L858 garLoopResultBuilder]: For program point L217(lines 217 227) no Hoare annotation was computed. [2022-01-31 02:26:02,556 INFO L858 garLoopResultBuilder]: For program point L2265(lines 2265 2696) no Hoare annotation was computed. [2022-01-31 02:26:02,556 INFO L858 garLoopResultBuilder]: For program point L1142(lines 1142 2869) no Hoare annotation was computed. [2022-01-31 02:26:02,556 INFO L858 garLoopResultBuilder]: For program point L1076(lines 1076 2879) no Hoare annotation was computed. [2022-01-31 02:26:02,556 INFO L858 garLoopResultBuilder]: For program point L2530(lines 2530 2655) no Hoare annotation was computed. [2022-01-31 02:26:02,557 INFO L858 garLoopResultBuilder]: For program point L1407(lines 1407 2828) no Hoare annotation was computed. [2022-01-31 02:26:02,557 INFO L858 garLoopResultBuilder]: For program point L86(lines 86 284) no Hoare annotation was computed. [2022-01-31 02:26:02,557 INFO L858 garLoopResultBuilder]: For program point L1672(lines 1672 2787) no Hoare annotation was computed. [2022-01-31 02:26:02,557 INFO L858 garLoopResultBuilder]: For program point L549(lines 549 2960) no Hoare annotation was computed. [2022-01-31 02:26:02,557 INFO L858 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-01-31 02:26:02,557 INFO L858 garLoopResultBuilder]: For program point L21(lines 21 3007) no Hoare annotation was computed. [2022-01-31 02:26:02,557 INFO L858 garLoopResultBuilder]: For program point L814(lines 814 2919) no Hoare annotation was computed. [2022-01-31 02:26:02,557 INFO L858 garLoopResultBuilder]: For program point L1805(lines 1805 2767) no Hoare annotation was computed. [2022-01-31 02:26:02,557 INFO L858 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2022-01-31 02:26:02,557 INFO L858 garLoopResultBuilder]: For program point L1739(lines 1739 2777) no Hoare annotation was computed. [2022-01-31 02:26:02,557 INFO L858 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2022-01-31 02:26:02,557 INFO L858 garLoopResultBuilder]: For program point L2070(lines 2070 2726) no Hoare annotation was computed. [2022-01-31 02:26:02,557 INFO L858 garLoopResultBuilder]: For program point L947(lines 947 2899) no Hoare annotation was computed. [2022-01-31 02:26:02,557 INFO L858 garLoopResultBuilder]: For program point L881(lines 881 2909) no Hoare annotation was computed. [2022-01-31 02:26:02,557 INFO L858 garLoopResultBuilder]: For program point L2335(lines 2335 2685) no Hoare annotation was computed. [2022-01-31 02:26:02,557 INFO L858 garLoopResultBuilder]: For program point L1212(lines 1212 2858) no Hoare annotation was computed. [2022-01-31 02:26:02,557 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 232) no Hoare annotation was computed. [2022-01-31 02:26:02,558 INFO L858 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 2616) no Hoare annotation was computed. [2022-01-31 02:26:02,558 INFO L858 garLoopResultBuilder]: For program point L1477(lines 1477 2817) no Hoare annotation was computed. [2022-01-31 02:26:02,558 INFO L858 garLoopResultBuilder]: For program point L2468(lines 2468 2665) no Hoare annotation was computed. [2022-01-31 02:26:02,558 INFO L858 garLoopResultBuilder]: For program point L2402(lines 2402 2675) no Hoare annotation was computed. [2022-01-31 02:26:02,558 INFO L858 garLoopResultBuilder]: For program point L354(lines 354 2990) no Hoare annotation was computed. [2022-01-31 02:26:02,558 INFO L858 garLoopResultBuilder]: For program point L619(lines 619 2949) no Hoare annotation was computed. [2022-01-31 02:26:02,558 INFO L858 garLoopResultBuilder]: For program point L1610(lines 1610 2797) no Hoare annotation was computed. [2022-01-31 02:26:02,558 INFO L858 garLoopResultBuilder]: For program point L1544(lines 1544 2807) no Hoare annotation was computed. [2022-01-31 02:26:02,558 INFO L858 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-01-31 02:26:02,558 INFO L858 garLoopResultBuilder]: For program point L25(lines 25 3002) no Hoare annotation was computed. [2022-01-31 02:26:02,558 INFO L858 garLoopResultBuilder]: For program point L1875(lines 1875 2756) no Hoare annotation was computed. [2022-01-31 02:26:02,558 INFO L858 garLoopResultBuilder]: For program point L752(lines 752 2929) no Hoare annotation was computed. [2022-01-31 02:26:02,558 INFO L858 garLoopResultBuilder]: For program point L686(lines 686 2939) no Hoare annotation was computed. [2022-01-31 02:26:02,558 INFO L858 garLoopResultBuilder]: For program point L2602(lines 2602 2645) no Hoare annotation was computed. [2022-01-31 02:26:02,558 INFO L858 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2022-01-31 02:26:02,558 INFO L858 garLoopResultBuilder]: For program point L2140(lines 2140 2715) no Hoare annotation was computed. [2022-01-31 02:26:02,559 INFO L858 garLoopResultBuilder]: For program point L1017(lines 1017 2888) no Hoare annotation was computed. [2022-01-31 02:26:02,559 INFO L858 garLoopResultBuilder]: For program point L1282(lines 1282 2847) no Hoare annotation was computed. [2022-01-31 02:26:02,559 INFO L858 garLoopResultBuilder]: For program point L2273(lines 2273 2695) no Hoare annotation was computed. [2022-01-31 02:26:02,559 INFO L858 garLoopResultBuilder]: For program point L2207(lines 2207 2705) no Hoare annotation was computed. [2022-01-31 02:26:02,559 INFO L858 garLoopResultBuilder]: For program point L2604(line 2604) no Hoare annotation was computed. [2022-01-31 02:26:02,571 INFO L858 garLoopResultBuilder]: For program point L2538(lines 2538 2654) no Hoare annotation was computed. [2022-01-31 02:26:02,571 INFO L858 garLoopResultBuilder]: For program point L424(lines 424 2979) no Hoare annotation was computed. [2022-01-31 02:26:02,571 INFO L858 garLoopResultBuilder]: For program point L1415(lines 1415 2827) no Hoare annotation was computed. [2022-01-31 02:26:02,571 INFO L858 garLoopResultBuilder]: For program point L1349(lines 1349 2837) no Hoare annotation was computed. [2022-01-31 02:26:02,571 INFO L854 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-01-31 02:26:02,572 INFO L858 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-01-31 02:26:02,572 INFO L858 garLoopResultBuilder]: For program point L1680(lines 1680 2786) no Hoare annotation was computed. [2022-01-31 02:26:02,572 INFO L858 garLoopResultBuilder]: For program point L557(lines 557 2959) no Hoare annotation was computed. [2022-01-31 02:26:02,572 INFO L858 garLoopResultBuilder]: For program point L491(lines 491 2969) no Hoare annotation was computed. [2022-01-31 02:26:02,572 INFO L858 garLoopResultBuilder]: For program point L1945(lines 1945 2745) no Hoare annotation was computed. [2022-01-31 02:26:02,572 INFO L858 garLoopResultBuilder]: For program point L822(lines 822 2918) no Hoare annotation was computed. [2022-01-31 02:26:02,572 INFO L858 garLoopResultBuilder]: For program point L1087(lines 1087 2877) no Hoare annotation was computed. [2022-01-31 02:26:02,572 INFO L858 garLoopResultBuilder]: For program point L2078(lines 2078 2725) no Hoare annotation was computed. [2022-01-31 02:26:02,587 INFO L854 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-01-31 02:26:02,587 INFO L858 garLoopResultBuilder]: For program point L2012(lines 2012 2735) no Hoare annotation was computed. [2022-01-31 02:26:02,587 INFO L858 garLoopResultBuilder]: For program point L2343(lines 2343 2684) no Hoare annotation was computed. [2022-01-31 02:26:02,587 INFO L858 garLoopResultBuilder]: For program point L1220(lines 1220 2857) no Hoare annotation was computed. [2022-01-31 02:26:02,587 INFO L858 garLoopResultBuilder]: For program point L1154(lines 1154 2867) no Hoare annotation was computed. [2022-01-31 02:26:02,587 INFO L858 garLoopResultBuilder]: For program point L1485(lines 1485 2816) no Hoare annotation was computed. [2022-01-31 02:26:02,587 INFO L858 garLoopResultBuilder]: For program point L362(lines 362 2989) no Hoare annotation was computed. [2022-01-31 02:26:02,587 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 2999) no Hoare annotation was computed. [2022-01-31 02:26:02,587 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 231) no Hoare annotation was computed. [2022-01-31 02:26:02,587 INFO L858 garLoopResultBuilder]: For program point L1750(lines 1750 2775) no Hoare annotation was computed. [2022-01-31 02:26:02,588 INFO L858 garLoopResultBuilder]: For program point L627(lines 627 2948) no Hoare annotation was computed. [2022-01-31 02:26:02,588 INFO L858 garLoopResultBuilder]: For program point L33(lines 33 57) no Hoare annotation was computed. [2022-01-31 02:26:02,588 INFO L854 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-01-31 02:26:02,588 INFO L858 garLoopResultBuilder]: For program point L892(lines 892 2907) no Hoare annotation was computed. [2022-01-31 02:26:02,588 INFO L858 garLoopResultBuilder]: For program point L1883(lines 1883 2755) no Hoare annotation was computed. [2022-01-31 02:26:02,588 INFO L858 garLoopResultBuilder]: For program point L1817(lines 1817 2765) no Hoare annotation was computed. [2022-01-31 02:26:02,588 INFO L858 garLoopResultBuilder]: For program point L2148(lines 2148 2714) no Hoare annotation was computed. [2022-01-31 02:26:02,588 INFO L858 garLoopResultBuilder]: For program point L1025(lines 1025 2887) no Hoare annotation was computed. [2022-01-31 02:26:02,588 INFO L858 garLoopResultBuilder]: For program point L959(lines 959 2897) no Hoare annotation was computed. [2022-01-31 02:26:02,588 INFO L858 garLoopResultBuilder]: For program point L2413(lines 2413 2673) no Hoare annotation was computed. [2022-01-31 02:26:02,588 INFO L858 garLoopResultBuilder]: For program point L1290(lines 1290 2846) no Hoare annotation was computed. [2022-01-31 02:26:02,588 INFO L858 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-01-31 02:26:02,588 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-01-31 02:26:02,588 INFO L854 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-01-31 02:26:02,589 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-01-31 02:26:02,589 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-31 02:26:02,589 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 02:26:02,589 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 02:26:02,589 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-31 02:26:02,592 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:26:02,595 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 02:26:02,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:26:02 BoogieIcfgContainer [2022-01-31 02:26:02,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 02:26:02,613 INFO L158 Benchmark]: Toolchain (without parser) took 21757.10ms. Allocated memory was 229.6MB in the beginning and 524.3MB in the end (delta: 294.6MB). Free memory was 173.4MB in the beginning and 450.0MB in the end (delta: -276.6MB). Peak memory consumption was 234.2MB. Max. memory is 8.0GB. [2022-01-31 02:26:02,613 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 229.6MB. Free memory is still 191.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 02:26:02,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 722.35ms. Allocated memory was 229.6MB in the beginning and 275.8MB in the end (delta: 46.1MB). Free memory was 173.2MB in the beginning and 220.2MB in the end (delta: -47.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-31 02:26:02,616 INFO L158 Benchmark]: Boogie Preprocessor took 123.77ms. Allocated memory is still 275.8MB. Free memory was 220.2MB in the beginning and 215.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-31 02:26:02,616 INFO L158 Benchmark]: RCFGBuilder took 1217.54ms. Allocated memory is still 275.8MB. Free memory was 215.5MB in the beginning and 122.7MB in the end (delta: 92.8MB). Peak memory consumption was 93.3MB. Max. memory is 8.0GB. [2022-01-31 02:26:02,617 INFO L158 Benchmark]: TraceAbstraction took 19688.77ms. Allocated memory was 275.8MB in the beginning and 524.3MB in the end (delta: 248.5MB). Free memory was 122.7MB in the beginning and 450.0MB in the end (delta: -327.3MB). Peak memory consumption was 137.7MB. Max. memory is 8.0GB. [2022-01-31 02:26:02,619 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.12ms. Allocated memory is still 229.6MB. Free memory is still 191.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 722.35ms. Allocated memory was 229.6MB in the beginning and 275.8MB in the end (delta: 46.1MB). Free memory was 173.2MB in the beginning and 220.2MB in the end (delta: -47.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 123.77ms. Allocated memory is still 275.8MB. Free memory was 220.2MB in the beginning and 215.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1217.54ms. Allocated memory is still 275.8MB. Free memory was 215.5MB in the beginning and 122.7MB in the end (delta: 92.8MB). Peak memory consumption was 93.3MB. Max. memory is 8.0GB. * TraceAbstraction took 19688.77ms. Allocated memory was 275.8MB in the beginning and 524.3MB in the end (delta: 248.5MB). Free memory was 122.7MB in the beginning and 450.0MB in the end (delta: -327.3MB). Peak memory consumption was 137.7MB. 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: 19.6s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10320 SdHoareTripleChecker+Valid, 11.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10320 mSDsluCounter, 5285 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1308 mSDsCounter, 2176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19601 IncrementalHoareTripleChecker+Invalid, 21777 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2176 mSolverCounterUnsat, 3977 mSDtfsCounter, 19601 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2081 ImplicationChecksByTransitivity, 3.9s 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.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 161 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 17 NumberOfFragments, 112 HoareAnnotationTreeSize, 10 FomulaSimplifications, 2144 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 10 FomulaSimplificationsInter, 15394 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 828 NumberOfCodeBlocks, 828 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 807 ConstructedInterpolants, 0 QuantifiedInterpolants, 2486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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__tagbuf_len <= main__t) - 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) RESULT: Ultimate proved your program to be correct! [2022-01-31 02:26:02,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...