/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+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 02:25:45,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 02:25:45,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 02:25:46,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 02:25:46,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 02:25:46,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 02:25:46,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 02:25:46,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 02:25:46,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 02:25:46,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 02:25:46,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 02:25:46,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 02:25:46,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 02:25:46,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 02:25:46,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 02:25:46,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 02:25:46,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 02:25:46,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 02:25:46,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 02:25:46,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 02:25:46,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 02:25:46,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 02:25:46,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 02:25:46,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 02:25:46,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 02:25:46,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 02:25:46,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 02:25:46,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 02:25:46,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 02:25:46,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 02:25:46,071 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 02:25:46,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 02:25:46,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 02:25:46,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 02:25:46,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 02:25:46,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 02:25:46,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 02:25:46,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 02:25:46,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 02:25:46,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 02:25:46,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 02:25:46,082 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:46,105 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 02:25:46,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 02:25:46,105 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-31 02:25:46,105 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-31 02:25:46,106 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-31 02:25:46,106 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-31 02:25:46,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-31 02:25:46,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-31 02:25:46,107 INFO L138 SettingsManager]: * Use SBE=true [2022-01-31 02:25:46,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 02:25:46,108 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 02:25:46,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 02:25:46,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 02:25:46,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 02:25:46,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 02:25:46,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 02:25:46,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 02:25:46,108 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 02:25:46,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 02:25:46,108 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 02:25:46,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 02:25:46,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 02:25:46,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 02:25:46,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 02:25:46,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 02:25:46,109 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 02:25:46,109 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-31 02:25:46,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-31 02:25:46,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 02:25:46,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-31 02:25:46,110 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-31 02:25:46,110 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-31 02:25:46,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 02:25:46,110 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:46,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 02:25:46,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 02:25:46,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 02:25:46,337 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 02:25:46,337 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 02:25:46,338 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+sep-reducer.c [2022-01-31 02:25:46,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/523bab25b/69f26f25563640ca92dff2abf1644ff0/FLAGef8a3ff15 [2022-01-31 02:25:46,876 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 02:25:46,877 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2022-01-31 02:25:46,894 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/523bab25b/69f26f25563640ca92dff2abf1644ff0/FLAGef8a3ff15 [2022-01-31 02:25:46,910 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/523bab25b/69f26f25563640ca92dff2abf1644ff0 [2022-01-31 02:25:46,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 02:25:46,914 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 02:25:46,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 02:25:46,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 02:25:46,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 02:25:46,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 02:25:46" (1/1) ... [2022-01-31 02:25:46,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@742b3781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:46, skipping insertion in model container [2022-01-31 02:25:46,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 02:25:46" (1/1) ... [2022-01-31 02:25:46,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 02:25:47,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 02:25:47,201 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+sep-reducer.c[1000,1013] [2022-01-31 02:25:47,205 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+sep-reducer.c[1215,1228] [2022-01-31 02:25:47,510 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+sep-reducer.c[83573,83586] [2022-01-31 02:25:47,514 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+sep-reducer.c[83794,83807] [2022-01-31 02:25:47,518 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+sep-reducer.c[84257,84270] [2022-01-31 02:25:47,521 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+sep-reducer.c[84478,84491] [2022-01-31 02:25:47,524 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+sep-reducer.c[84801,84814] [2022-01-31 02:25:47,527 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+sep-reducer.c[85022,85035] [2022-01-31 02:25:47,531 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+sep-reducer.c[85521,85534] [2022-01-31 02:25:47,534 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+sep-reducer.c[85742,85755] [2022-01-31 02:25:47,538 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+sep-reducer.c[86050,86063] [2022-01-31 02:25:47,541 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+sep-reducer.c[86271,86284] [2022-01-31 02:25:47,544 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+sep-reducer.c[86594,86607] [2022-01-31 02:25:47,549 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+sep-reducer.c[86815,86828] [2022-01-31 02:25:47,552 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+sep-reducer.c[87258,87271] [2022-01-31 02:25:47,554 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+sep-reducer.c[87479,87492] [2022-01-31 02:25:47,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 02:25:47,576 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 02:25:47,595 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+sep-reducer.c[1000,1013] [2022-01-31 02:25:47,596 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+sep-reducer.c[1215,1228] [2022-01-31 02:25:47,741 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+sep-reducer.c[83573,83586] [2022-01-31 02:25:47,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[83794,83807] [2022-01-31 02:25:47,746 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84257,84270] [2022-01-31 02:25:47,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[84478,84491] [2022-01-31 02:25:47,751 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+sep-reducer.c[84801,84814] [2022-01-31 02:25:47,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85022,85035] [2022-01-31 02:25:47,756 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+sep-reducer.c[85521,85534] [2022-01-31 02:25:47,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c[85742,85755] [2022-01-31 02:25:47,761 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+sep-reducer.c[86050,86063] [2022-01-31 02:25:47,764 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+sep-reducer.c[86271,86284] [2022-01-31 02:25:47,766 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+sep-reducer.c[86594,86607] [2022-01-31 02:25:47,768 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+sep-reducer.c[86815,86828] [2022-01-31 02:25:47,770 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+sep-reducer.c[87258,87271] [2022-01-31 02:25:47,772 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+sep-reducer.c[87479,87492] [2022-01-31 02:25:47,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 02:25:47,786 INFO L208 MainTranslator]: Completed translation [2022-01-31 02:25:47,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:47 WrapperNode [2022-01-31 02:25:47,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 02:25:47,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 02:25:47,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 02:25:47,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 02:25:47,795 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:47" (1/1) ... [2022-01-31 02:25:47,795 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:47" (1/1) ... [2022-01-31 02:25:47,813 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:47" (1/1) ... [2022-01-31 02:25:47,813 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:47" (1/1) ... [2022-01-31 02:25:47,843 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:47" (1/1) ... [2022-01-31 02:25:47,858 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:47" (1/1) ... [2022-01-31 02:25:47,863 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:47" (1/1) ... [2022-01-31 02:25:47,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 02:25:47,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 02:25:47,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 02:25:47,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 02:25:47,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:47" (1/1) ... [2022-01-31 02:25:47,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 02:25:47,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 02:25:47,952 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:47,970 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:47,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 02:25:47,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 02:25:47,981 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 02:25:47,982 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 02:25:47,982 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 02:25:47,982 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 02:25:47,982 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 02:25:47,982 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 02:25:47,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 02:25:47,982 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 02:25:47,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 02:25:47,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 02:25:47,982 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 02:25:47,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 02:25:47,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 02:25:47,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 02:25:47,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 02:25:47,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 02:25:47,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 02:25:48,163 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 02:25:48,164 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 02:25:48,967 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 02:25:48,976 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 02:25:48,976 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-31 02:25:48,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:25:48 BoogieIcfgContainer [2022-01-31 02:25:48,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 02:25:48,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 02:25:48,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 02:25:48,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 02:25:48,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 02:25:46" (1/3) ... [2022-01-31 02:25:48,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a19978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:25:48, skipping insertion in model container [2022-01-31 02:25:48,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 02:25:47" (2/3) ... [2022-01-31 02:25:48,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a19978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:25:48, skipping insertion in model container [2022-01-31 02:25:48,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:25:48" (3/3) ... [2022-01-31 02:25:48,984 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2022-01-31 02:25:48,987 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-31 02:25:48,987 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-01-31 02:25:49,018 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 02:25:49,028 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:49,028 INFO L340 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-01-31 02:25:49,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 480 states, 459 states have (on average 1.9651416122004357) internal successors, (902), 475 states have internal predecessors, (902), 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:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-31 02:25:49,058 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:49,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:49,059 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:49,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:49,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1237974134, now seen corresponding path program 1 times [2022-01-31 02:25:49,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:49,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888468030] [2022-01-31 02:25:49,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:49,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:49,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:49,355 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,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:49,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888468030] [2022-01-31 02:25:49,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888468030] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:49,356 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:49,356 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 02:25:49,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900861387] [2022-01-31 02:25:49,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:49,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 02:25:49,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:49,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 02:25:49,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:25:49,400 INFO L87 Difference]: Start difference. First operand has 480 states, 459 states have (on average 1.9651416122004357) internal successors, (902), 475 states have internal predecessors, (902), 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:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:50,683 INFO L93 Difference]: Finished difference Result 499 states and 926 transitions. [2022-01-31 02:25:50,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:50,685 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:50,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:50,693 INFO L225 Difference]: With dead ends: 499 [2022-01-31 02:25:50,693 INFO L226 Difference]: Without dead ends: 306 [2022-01-31 02:25:50,696 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:50,699 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 1402 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:50,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1402 Valid, 199 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1795 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 02:25:50,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-01-31 02:25:50,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 301. [2022-01-31 02:25:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 283 states have (on average 1.2756183745583038) internal successors, (361), 297 states have internal predecessors, (361), 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,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 364 transitions. [2022-01-31 02:25:50,740 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 364 transitions. Word has length 11 [2022-01-31 02:25:50,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:50,740 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 364 transitions. [2022-01-31 02:25:50,740 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:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 364 transitions. [2022-01-31 02:25:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-31 02:25:50,741 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:50,741 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:25:50,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 02:25:50,741 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:50,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:50,742 INFO L85 PathProgramCache]: Analyzing trace with hash 277510576, now seen corresponding path program 1 times [2022-01-31 02:25:50,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:50,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127325337] [2022-01-31 02:25:50,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:50,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:50,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:50,857 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,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:50,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127325337] [2022-01-31 02:25:50,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127325337] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:50,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:50,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 02:25:50,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224479204] [2022-01-31 02:25:50,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:50,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 02:25:50,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:50,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 02:25:50,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 02:25:50,860 INFO L87 Difference]: Start difference. First operand 301 states and 364 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:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:51,403 INFO L93 Difference]: Finished difference Result 304 states and 367 transitions. [2022-01-31 02:25:51,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 02:25:51,404 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:51,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:51,405 INFO L225 Difference]: With dead ends: 304 [2022-01-31 02:25:51,405 INFO L226 Difference]: Without dead ends: 296 [2022-01-31 02:25:51,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-31 02:25:51,407 INFO L933 BasicCegarLoop]: 353 mSDtfsCounter, 318 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:51,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 473 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 02:25:51,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-31 02:25:51,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2022-01-31 02:25:51,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 279 states have (on average 1.060931899641577) internal successors, (296), 292 states have internal predecessors, (296), 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,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 299 transitions. [2022-01-31 02:25:51,417 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 299 transitions. Word has length 12 [2022-01-31 02:25:51,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:51,417 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 299 transitions. [2022-01-31 02:25:51,418 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:51,418 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 299 transitions. [2022-01-31 02:25:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-01-31 02:25:51,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:51,430 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:51,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 02:25:51,431 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:51,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:51,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1447054415, now seen corresponding path program 1 times [2022-01-31 02:25:51,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:51,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695494627] [2022-01-31 02:25:51,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:51,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:53,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:53,098 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,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:53,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695494627] [2022-01-31 02:25:53,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695494627] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:53,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:53,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-01-31 02:25:53,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864655024] [2022-01-31 02:25:53,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:53,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-01-31 02:25:53,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:53,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-01-31 02:25:53,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1836, Invalid=2196, Unknown=0, NotChecked=0, Total=4032 [2022-01-31 02:25:53,103 INFO L87 Difference]: Start difference. First operand 296 states and 299 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:25:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:55,727 INFO L93 Difference]: Finished difference Result 297 states and 300 transitions. [2022-01-31 02:25:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-31 02:25:55,727 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:25:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:55,729 INFO L225 Difference]: With dead ends: 297 [2022-01-31 02:25:55,729 INFO L226 Difference]: Without dead ends: 295 [2022-01-31 02:25:55,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5560, Invalid=9940, Unknown=0, NotChecked=0, Total=15500 [2022-01-31 02:25:55,734 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 976 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1681 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:55,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [976 Valid, 107 Invalid, 1948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1681 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 02:25:55,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-01-31 02:25:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 294. [2022-01-31 02:25:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 278 states have (on average 1.0575539568345325) internal successors, (294), 290 states have internal predecessors, (294), 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,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 297 transitions. [2022-01-31 02:25:55,742 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 297 transitions. Word has length 248 [2022-01-31 02:25:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:55,742 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 297 transitions. [2022-01-31 02:25:55,743 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:25:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 297 transitions. [2022-01-31 02:25:55,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-01-31 02:25:55,745 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:55,745 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:25:55,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 02:25:55,746 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:55,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:55,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1909018743, now seen corresponding path program 1 times [2022-01-31 02:25:55,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:55,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422445431] [2022-01-31 02:25:55,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:55,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:56,451 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,456 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,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:56,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422445431] [2022-01-31 02:25:56,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422445431] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:56,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:56,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 02:25:56,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918194533] [2022-01-31 02:25:56,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:56,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 02:25:56,458 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 8 interpolants. [2022-01-31 02:25:56,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 02:25:56,458 INFO L87 Difference]: Start difference. First operand 294 states and 297 transitions. Second operand has 8 states, 8 states have (on average 30.75) internal successors, (246), 7 states have internal predecessors, (246), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:25:56,970 INFO L93 Difference]: Finished difference Result 296 states and 299 transitions. [2022-01-31 02:25:56,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 02:25:56,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 30.75) internal successors, (246), 7 states have internal predecessors, (246), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 249 [2022-01-31 02:25:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:25:56,972 INFO L225 Difference]: With dead ends: 296 [2022-01-31 02:25:56,972 INFO L226 Difference]: Without dead ends: 294 [2022-01-31 02:25:56,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 02:25:56,975 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 558 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 02:25:56,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [558 Valid, 88 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 02:25:56,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-01-31 02:25:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2022-01-31 02:25:56,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 277 states have (on average 1.0541516245487366) internal successors, (292), 288 states have internal predecessors, (292), 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,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 295 transitions. [2022-01-31 02:25:56,981 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 295 transitions. Word has length 249 [2022-01-31 02:25:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:25:56,982 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 295 transitions. [2022-01-31 02:25:56,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.75) internal successors, (246), 7 states have internal predecessors, (246), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 02:25:56,982 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 295 transitions. [2022-01-31 02:25:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-01-31 02:25:56,984 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:25:56,984 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, 1, 1, 1] [2022-01-31 02:25:56,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 02:25:56,985 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:56,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:25:56,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1920182904, now seen corresponding path program 1 times [2022-01-31 02:25:56,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:25:56,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812343194] [2022-01-31 02:25:56,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:25:56,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:25:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:58,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:25:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:25:58,394 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,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:25:58,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812343194] [2022-01-31 02:25:58,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812343194] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:25:58,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:25:58,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-01-31 02:25:58,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833486150] [2022-01-31 02:25:58,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:25:58,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-01-31 02:25:58,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:25:58,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-01-31 02:25:58,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1897, Invalid=2263, Unknown=0, NotChecked=0, Total=4160 [2022-01-31 02:25:58,397 INFO L87 Difference]: Start difference. First operand 292 states and 295 transitions. Second operand has 65 states, 65 states have (on average 3.830769230769231) internal successors, (249), 64 states have internal predecessors, (249), 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,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:26:01,067 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2022-01-31 02:26:01,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-01-31 02:26:01,067 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.830769230769231) internal successors, (249), 64 states have internal predecessors, (249), 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 252 [2022-01-31 02:26:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:26:01,069 INFO L225 Difference]: With dead ends: 295 [2022-01-31 02:26:01,069 INFO L226 Difference]: Without dead ends: 293 [2022-01-31 02:26:01,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2007 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5622, Invalid=10128, Unknown=0, NotChecked=0, Total=15750 [2022-01-31 02:26:01,072 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 1062 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 1830 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 02:26:01,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1062 Valid, 115 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1830 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 02:26:01,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-01-31 02:26:01,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2022-01-31 02:26:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 276 states have (on average 1.0507246376811594) internal successors, (290), 286 states have internal predecessors, (290), 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:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 293 transitions. [2022-01-31 02:26:01,077 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 293 transitions. Word has length 252 [2022-01-31 02:26:01,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:26:01,078 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 293 transitions. [2022-01-31 02:26:01,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.830769230769231) internal successors, (249), 64 states have internal predecessors, (249), 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,078 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 293 transitions. [2022-01-31 02:26:01,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-01-31 02:26:01,082 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:26:01,082 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, 1, 1, 1, 1] [2022-01-31 02:26:01,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 02:26:01,083 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:26:01,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:26:01,084 INFO L85 PathProgramCache]: Analyzing trace with hash -603867262, now seen corresponding path program 1 times [2022-01-31 02:26:01,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:26:01,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143448738] [2022-01-31 02:26:01,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:26:01,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:26:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:01,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:26:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:01,539 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,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:26:01,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143448738] [2022-01-31 02:26:01,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143448738] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:26:01,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:26:01,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 02:26:01,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818567082] [2022-01-31 02:26:01,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:26:01,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 02:26:01,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:26:01,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 02:26:01,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 02:26:01,543 INFO L87 Difference]: Start difference. First operand 290 states and 293 transitions. Second operand has 8 states, 8 states have (on average 31.25) internal successors, (250), 7 states have internal predecessors, (250), 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,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:26:01,996 INFO L93 Difference]: Finished difference Result 290 states and 293 transitions. [2022-01-31 02:26:01,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 02:26:01,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 31.25) internal successors, (250), 7 states have internal predecessors, (250), 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 253 [2022-01-31 02:26:01,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:26:01,998 INFO L225 Difference]: With dead ends: 290 [2022-01-31 02:26:01,998 INFO L226 Difference]: Without dead ends: 288 [2022-01-31 02:26:01,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 02:26:01,999 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 698 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 02:26:01,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [698 Valid, 67 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 02:26:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-01-31 02:26:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-01-31 02:26:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 275 states have (on average 1.0472727272727274) internal successors, (288), 284 states have internal predecessors, (288), 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:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 291 transitions. [2022-01-31 02:26:02,004 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 291 transitions. Word has length 253 [2022-01-31 02:26:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:26:02,005 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 291 transitions. [2022-01-31 02:26:02,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.25) internal successors, (250), 7 states have internal predecessors, (250), 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:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 291 transitions. [2022-01-31 02:26:02,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-01-31 02:26:02,007 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:26:02,007 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, 1, 1, 1, 1, 1, 1] [2022-01-31 02:26:02,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 02:26:02,007 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:26:02,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:26:02,008 INFO L85 PathProgramCache]: Analyzing trace with hash -495700154, now seen corresponding path program 1 times [2022-01-31 02:26:02,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:26:02,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934398812] [2022-01-31 02:26:02,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:26:02,008 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:26:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:02,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:26:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:02,134 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:02,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:26:02,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934398812] [2022-01-31 02:26:02,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934398812] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:26:02,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:26:02,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 02:26:02,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90829864] [2022-01-31 02:26:02,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:26:02,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 02:26:02,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:26:02,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 02:26:02,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:26:02,136 INFO L87 Difference]: Start difference. First operand 288 states and 291 transitions. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 4 states have internal predecessors, (252), 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:02,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:26:02,455 INFO L93 Difference]: Finished difference Result 288 states and 291 transitions. [2022-01-31 02:26:02,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:26:02,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 4 states have internal predecessors, (252), 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 255 [2022-01-31 02:26:02,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:26:02,457 INFO L225 Difference]: With dead ends: 288 [2022-01-31 02:26:02,457 INFO L226 Difference]: Without dead ends: 286 [2022-01-31 02:26:02,457 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:26:02,458 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 279 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 02:26:02,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 200 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 02:26:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2022-01-31 02:26:02,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2022-01-31 02:26:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 274 states have (on average 1.0437956204379562) internal successors, (286), 282 states have internal predecessors, (286), 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:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 289 transitions. [2022-01-31 02:26:02,463 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 289 transitions. Word has length 255 [2022-01-31 02:26:02,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:26:02,463 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 289 transitions. [2022-01-31 02:26:02,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 4 states have internal predecessors, (252), 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:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 289 transitions. [2022-01-31 02:26:02,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-01-31 02:26:02,465 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:26:02,465 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, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:26:02,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 02:26:02,465 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:26:02,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:26:02,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1813169284, now seen corresponding path program 1 times [2022-01-31 02:26:02,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:26:02,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196490776] [2022-01-31 02:26:02,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:26:02,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:26:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:02,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:26:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:02,592 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:02,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:26:02,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196490776] [2022-01-31 02:26:02,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196490776] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:26:02,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:26:02,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 02:26:02,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608087685] [2022-01-31 02:26:02,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:26:02,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 02:26:02,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:26:02,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 02:26:02,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:26:02,593 INFO L87 Difference]: Start difference. First operand 286 states and 289 transitions. Second operand has 5 states, 5 states have (on average 50.6) internal successors, (253), 4 states have internal predecessors, (253), 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:03,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:26:03,026 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2022-01-31 02:26:03,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:26:03,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 4 states have internal predecessors, (253), 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 256 [2022-01-31 02:26:03,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:26:03,028 INFO L225 Difference]: With dead ends: 286 [2022-01-31 02:26:03,028 INFO L226 Difference]: Without dead ends: 282 [2022-01-31 02:26:03,028 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:26:03,029 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 247 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 02:26:03,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 350 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 02:26:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-01-31 02:26:03,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-01-31 02:26:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 271 states have (on average 1.040590405904059) internal successors, (282), 278 states have internal predecessors, (282), 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:03,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 285 transitions. [2022-01-31 02:26:03,033 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 285 transitions. Word has length 256 [2022-01-31 02:26:03,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:26:03,034 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 285 transitions. [2022-01-31 02:26:03,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.6) internal successors, (253), 4 states have internal predecessors, (253), 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:03,034 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 285 transitions. [2022-01-31 02:26:03,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-01-31 02:26:03,035 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:26:03,035 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:26:03,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 02:26:03,036 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:26:03,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:26:03,036 INFO L85 PathProgramCache]: Analyzing trace with hash 386942775, now seen corresponding path program 1 times [2022-01-31 02:26:03,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:26:03,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852702212] [2022-01-31 02:26:03,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:26:03,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:26:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:04,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:26:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:04,440 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:04,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:26:04,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852702212] [2022-01-31 02:26:04,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852702212] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:26:04,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:26:04,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-01-31 02:26:04,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858916153] [2022-01-31 02:26:04,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:26:04,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-01-31 02:26:04,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:26:04,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-01-31 02:26:04,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1959, Invalid=2331, Unknown=0, NotChecked=0, Total=4290 [2022-01-31 02:26:04,444 INFO L87 Difference]: Start difference. First operand 282 states and 285 transitions. Second operand has 66 states, 66 states have (on average 3.8484848484848486) internal successors, (254), 65 states have internal predecessors, (254), 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:07,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:26:07,055 INFO L93 Difference]: Finished difference Result 309 states and 315 transitions. [2022-01-31 02:26:07,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-01-31 02:26:07,056 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 3.8484848484848486) internal successors, (254), 65 states have internal predecessors, (254), 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 257 [2022-01-31 02:26:07,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:26:07,057 INFO L225 Difference]: With dead ends: 309 [2022-01-31 02:26:07,057 INFO L226 Difference]: Without dead ends: 307 [2022-01-31 02:26:07,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5685, Invalid=10317, Unknown=0, NotChecked=0, Total=16002 [2022-01-31 02:26:07,060 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 1074 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 02:26:07,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1074 Valid, 114 Invalid, 1951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 02:26:07,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-01-31 02:26:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 280. [2022-01-31 02:26:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 270 states have (on average 1.037037037037037) internal successors, (280), 276 states have internal predecessors, (280), 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:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 283 transitions. [2022-01-31 02:26:07,065 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 283 transitions. Word has length 257 [2022-01-31 02:26:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:26:07,066 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 283 transitions. [2022-01-31 02:26:07,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.8484848484848486) internal successors, (254), 65 states have internal predecessors, (254), 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:07,066 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 283 transitions. [2022-01-31 02:26:07,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-01-31 02:26:07,068 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:26:07,068 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:26:07,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 02:26:07,068 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:26:07,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:26:07,068 INFO L85 PathProgramCache]: Analyzing trace with hash 388481975, now seen corresponding path program 1 times [2022-01-31 02:26:07,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:26:07,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668815535] [2022-01-31 02:26:07,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:26:07,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:26:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:08,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:26:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:08,425 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:08,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:26:08,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668815535] [2022-01-31 02:26:08,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668815535] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:26:08,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:26:08,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-01-31 02:26:08,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958039248] [2022-01-31 02:26:08,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:26:08,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-01-31 02:26:08,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:26:08,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-01-31 02:26:08,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1959, Invalid=2331, Unknown=0, NotChecked=0, Total=4290 [2022-01-31 02:26:08,428 INFO L87 Difference]: Start difference. First operand 280 states and 283 transitions. Second operand has 66 states, 66 states have (on average 3.8484848484848486) internal successors, (254), 65 states have internal predecessors, (254), 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:11,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:26:11,023 INFO L93 Difference]: Finished difference Result 290 states and 294 transitions. [2022-01-31 02:26:11,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-01-31 02:26:11,024 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 3.8484848484848486) internal successors, (254), 65 states have internal predecessors, (254), 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 257 [2022-01-31 02:26:11,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:26:11,025 INFO L225 Difference]: With dead ends: 290 [2022-01-31 02:26:11,025 INFO L226 Difference]: Without dead ends: 288 [2022-01-31 02:26:11,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5685, Invalid=10317, Unknown=0, NotChecked=0, Total=16002 [2022-01-31 02:26:11,028 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 1200 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 02:26:11,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1200 Valid, 103 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 02:26:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-01-31 02:26:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 278. [2022-01-31 02:26:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 269 states have (on average 1.033457249070632) internal successors, (278), 274 states have internal predecessors, (278), 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:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 281 transitions. [2022-01-31 02:26:11,033 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 281 transitions. Word has length 257 [2022-01-31 02:26:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:26:11,033 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 281 transitions. [2022-01-31 02:26:11,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.8484848484848486) internal successors, (254), 65 states have internal predecessors, (254), 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:11,033 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 281 transitions. [2022-01-31 02:26:11,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-01-31 02:26:11,035 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:26:11,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:26:11,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 02:26:11,035 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:26:11,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:26:11,036 INFO L85 PathProgramCache]: Analyzing trace with hash -888720637, now seen corresponding path program 1 times [2022-01-31 02:26:11,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:26:11,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075422092] [2022-01-31 02:26:11,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:26:11,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:26:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:12,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:26:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:12,400 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:12,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:26:12,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075422092] [2022-01-31 02:26:12,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075422092] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:26:12,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:26:12,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-01-31 02:26:12,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844990229] [2022-01-31 02:26:12,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:26:12,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-01-31 02:26:12,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:26:12,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-01-31 02:26:12,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1959, Invalid=2331, Unknown=0, NotChecked=0, Total=4290 [2022-01-31 02:26:12,403 INFO L87 Difference]: Start difference. First operand 278 states and 281 transitions. Second operand has 66 states, 66 states have (on average 3.8636363636363638) internal successors, (255), 65 states have internal predecessors, (255), 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:15,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:26:15,098 INFO L93 Difference]: Finished difference Result 308 states and 314 transitions. [2022-01-31 02:26:15,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-01-31 02:26:15,098 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 3.8636363636363638) internal successors, (255), 65 states have internal predecessors, (255), 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 258 [2022-01-31 02:26:15,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:26:15,100 INFO L225 Difference]: With dead ends: 308 [2022-01-31 02:26:15,100 INFO L226 Difference]: Without dead ends: 306 [2022-01-31 02:26:15,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2069 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5685, Invalid=10317, Unknown=0, NotChecked=0, Total=16002 [2022-01-31 02:26:15,101 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 930 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 2236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 02:26:15,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [930 Valid, 111 Invalid, 2236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 02:26:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-01-31 02:26:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 276. [2022-01-31 02:26:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 268 states have (on average 1.0298507462686568) internal successors, (276), 272 states have internal predecessors, (276), 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:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 279 transitions. [2022-01-31 02:26:15,106 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 279 transitions. Word has length 258 [2022-01-31 02:26:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:26:15,106 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 279 transitions. [2022-01-31 02:26:15,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.8636363636363638) internal successors, (255), 65 states have internal predecessors, (255), 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:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 279 transitions. [2022-01-31 02:26:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-01-31 02:26:15,109 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:26:15,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:26:15,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 02:26:15,109 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:26:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:26:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash -889670969, now seen corresponding path program 1 times [2022-01-31 02:26:15,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:26:15,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617203919] [2022-01-31 02:26:15,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:26:15,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:26:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:15,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:26:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:15,572 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:15,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:26:15,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617203919] [2022-01-31 02:26:15,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617203919] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:26:15,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:26:15,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 02:26:15,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257159174] [2022-01-31 02:26:15,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:26:15,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 02:26:15,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:26:15,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 02:26:15,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 02:26:15,574 INFO L87 Difference]: Start difference. First operand 276 states and 279 transitions. Second operand has 8 states, 8 states have (on average 31.875) internal successors, (255), 7 states have internal predecessors, (255), 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:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:26:16,123 INFO L93 Difference]: Finished difference Result 290 states and 295 transitions. [2022-01-31 02:26:16,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 02:26:16,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 31.875) internal successors, (255), 7 states have internal predecessors, (255), 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 258 [2022-01-31 02:26:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:26:16,125 INFO L225 Difference]: With dead ends: 290 [2022-01-31 02:26:16,125 INFO L226 Difference]: Without dead ends: 288 [2022-01-31 02:26:16,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 02:26:16,126 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 660 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 02:26:16,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [660 Valid, 59 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 02:26:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-01-31 02:26:16,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 274. [2022-01-31 02:26:16,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 267 states have (on average 1.0262172284644195) internal successors, (274), 270 states have internal predecessors, (274), 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:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 277 transitions. [2022-01-31 02:26:16,130 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 277 transitions. Word has length 258 [2022-01-31 02:26:16,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:26:16,130 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 277 transitions. [2022-01-31 02:26:16,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.875) internal successors, (255), 7 states have internal predecessors, (255), 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:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 277 transitions. [2022-01-31 02:26:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-01-31 02:26:16,131 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:26:16,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:26:16,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 02:26:16,132 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:26:16,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:26:16,132 INFO L85 PathProgramCache]: Analyzing trace with hash -841955719, now seen corresponding path program 1 times [2022-01-31 02:26:16,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:26:16,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296145082] [2022-01-31 02:26:16,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:26:16,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:26:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:16,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:26:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:16,517 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:16,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:26:16,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296145082] [2022-01-31 02:26:16,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296145082] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:26:16,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:26:16,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 02:26:16,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173319779] [2022-01-31 02:26:16,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:26:16,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 02:26:16,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:26:16,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 02:26:16,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 02:26:16,520 INFO L87 Difference]: Start difference. First operand 274 states and 277 transitions. Second operand has 8 states, 8 states have (on average 31.875) internal successors, (255), 7 states have internal predecessors, (255), 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:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:26:16,956 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2022-01-31 02:26:16,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 02:26:16,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 31.875) internal successors, (255), 7 states have internal predecessors, (255), 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 258 [2022-01-31 02:26:16,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:26:16,958 INFO L225 Difference]: With dead ends: 274 [2022-01-31 02:26:16,958 INFO L226 Difference]: Without dead ends: 270 [2022-01-31 02:26:16,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-31 02:26:16,958 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 518 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 02:26:16,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 64 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 02:26:16,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-01-31 02:26:16,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-01-31 02:26:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 264 states have (on average 1.0227272727272727) internal successors, (270), 266 states have internal predecessors, (270), 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:16,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 273 transitions. [2022-01-31 02:26:16,963 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 273 transitions. Word has length 258 [2022-01-31 02:26:16,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:26:16,963 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 273 transitions. [2022-01-31 02:26:16,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.875) internal successors, (255), 7 states have internal predecessors, (255), 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:16,963 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 273 transitions. [2022-01-31 02:26:16,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-01-31 02:26:16,964 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:26:16,964 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:26:16,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 02:26:16,965 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:26:16,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:26:16,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1780531044, now seen corresponding path program 1 times [2022-01-31 02:26:16,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:26:16,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602226477] [2022-01-31 02:26:16,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:26:16,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:26:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:17,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:26:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:17,403 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:17,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:26:17,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602226477] [2022-01-31 02:26:17,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602226477] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:26:17,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:26:17,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 02:26:17,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976691640] [2022-01-31 02:26:17,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:26:17,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 02:26:17,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:26:17,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 02:26:17,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 02:26:17,405 INFO L87 Difference]: Start difference. First operand 270 states and 273 transitions. Second operand has 8 states, 8 states have (on average 32.0) internal successors, (256), 7 states have internal predecessors, (256), 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:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:26:17,868 INFO L93 Difference]: Finished difference Result 285 states and 290 transitions. [2022-01-31 02:26:17,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 02:26:17,868 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.0) internal successors, (256), 7 states have internal predecessors, (256), 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 259 [2022-01-31 02:26:17,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:26:17,870 INFO L225 Difference]: With dead ends: 285 [2022-01-31 02:26:17,870 INFO L226 Difference]: Without dead ends: 283 [2022-01-31 02:26:17,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 02:26:17,870 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 655 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 02:26:17,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [655 Valid, 59 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 02:26:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-01-31 02:26:17,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 268. [2022-01-31 02:26:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.0190114068441065) internal successors, (268), 264 states have internal predecessors, (268), 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:17,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 271 transitions. [2022-01-31 02:26:17,875 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 271 transitions. Word has length 259 [2022-01-31 02:26:17,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:26:17,876 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 271 transitions. [2022-01-31 02:26:17,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.0) internal successors, (256), 7 states have internal predecessors, (256), 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:17,876 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 271 transitions. [2022-01-31 02:26:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-01-31 02:26:17,877 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:26:17,877 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:26:17,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 02:26:17,877 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:26:17,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:26:17,878 INFO L85 PathProgramCache]: Analyzing trace with hash -275155478, now seen corresponding path program 1 times [2022-01-31 02:26:17,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:26:17,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401626890] [2022-01-31 02:26:17,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:26:17,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:26:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:17,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:26:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:17,978 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:17,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:26:17,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401626890] [2022-01-31 02:26:17,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401626890] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:26:17,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:26:17,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 02:26:17,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009995003] [2022-01-31 02:26:17,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:26:17,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 02:26:17,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:26:17,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 02:26:17,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:26:17,980 INFO L87 Difference]: Start difference. First operand 268 states and 271 transitions. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 4 states have internal predecessors, (257), 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:18,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:26:18,256 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2022-01-31 02:26:18,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:26:18,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 4 states have internal predecessors, (257), 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 260 [2022-01-31 02:26:18,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:26:18,258 INFO L225 Difference]: With dead ends: 268 [2022-01-31 02:26:18,258 INFO L226 Difference]: Without dead ends: 266 [2022-01-31 02:26:18,258 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:26:18,258 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 254 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 02:26:18,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 166 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 02:26:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-01-31 02:26:18,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-01-31 02:26:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 262 states have (on average 1.015267175572519) internal successors, (266), 262 states have internal predecessors, (266), 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:18,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 269 transitions. [2022-01-31 02:26:18,262 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 269 transitions. Word has length 260 [2022-01-31 02:26:18,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:26:18,263 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 269 transitions. [2022-01-31 02:26:18,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 4 states have internal predecessors, (257), 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:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 269 transitions. [2022-01-31 02:26:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2022-01-31 02:26:18,264 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 02:26:18,264 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:26:18,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 02:26:18,264 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-01-31 02:26:18,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 02:26:18,265 INFO L85 PathProgramCache]: Analyzing trace with hash 60119683, now seen corresponding path program 1 times [2022-01-31 02:26:18,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 02:26:18,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213346044] [2022-01-31 02:26:18,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 02:26:18,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 02:26:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:18,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 02:26:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 02:26:18,380 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:18,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 02:26:18,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213346044] [2022-01-31 02:26:18,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213346044] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 02:26:18,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 02:26:18,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 02:26:18,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672673669] [2022-01-31 02:26:18,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 02:26:18,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 02:26:18,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 02:26:18,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 02:26:18,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 02:26:18,383 INFO L87 Difference]: Start difference. First operand 266 states and 269 transitions. Second operand has 5 states, 5 states have (on average 51.6) internal successors, (258), 4 states have internal predecessors, (258), 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:18,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 02:26:18,660 INFO L93 Difference]: Finished difference Result 266 states and 269 transitions. [2022-01-31 02:26:18,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 02:26:18,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.6) internal successors, (258), 4 states have internal predecessors, (258), 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 261 [2022-01-31 02:26:18,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 02:26:18,661 INFO L225 Difference]: With dead ends: 266 [2022-01-31 02:26:18,661 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 02:26:18,663 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:26:18,664 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 242 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 02:26:18,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 300 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 02:26:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 02:26:18,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 02:26:18,670 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:18,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 02:26:18,670 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 261 [2022-01-31 02:26:18,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 02:26:18,671 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 02:26:18,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.6) internal successors, (258), 4 states have internal predecessors, (258), 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:18,671 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 02:26:18,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 02:26:18,674 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-01-31 02:26:18,674 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-01-31 02:26:18,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-01-31 02:26:18,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-01-31 02:26:18,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-01-31 02:26:18,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-01-31 02:26:18,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-01-31 02:26:18,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-01-31 02:26:18,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-01-31 02:26:18,675 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-01-31 02:26:18,676 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-01-31 02:26:18,676 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-01-31 02:26:18,676 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-01-31 02:26:18,676 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-01-31 02:26:18,676 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-01-31 02:26:18,676 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-01-31 02:26:18,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 02:26:18,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 02:26:18,974 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-01-31 02:26:18,974 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-01-31 02:26:18,974 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-01-31 02:26:18,974 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-01-31 02:26:18,974 INFO L858 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-01-31 02:26:18,974 INFO L858 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-01-31 02:26:18,974 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-01-31 02:26:18,974 INFO L858 garLoopResultBuilder]: For program point L1951(lines 1951 5176) no Hoare annotation was computed. [2022-01-31 02:26:18,975 INFO L858 garLoopResultBuilder]: For program point L2744(lines 2744 2755) no Hoare annotation was computed. [2022-01-31 02:26:18,975 INFO L858 garLoopResultBuilder]: For program point mainEXIT(lines 22 5301) no Hoare annotation was computed. [2022-01-31 02:26:18,975 INFO L858 garLoopResultBuilder]: For program point L4726(line 4726) no Hoare annotation was computed. [2022-01-31 02:26:18,975 INFO L858 garLoopResultBuilder]: For program point L564(lines 564 598) no Hoare annotation was computed. [2022-01-31 02:26:18,975 INFO L858 garLoopResultBuilder]: For program point L3141(lines 3141 3165) no Hoare annotation was computed. [2022-01-31 02:26:18,975 INFO L858 garLoopResultBuilder]: For program point L3934(lines 3934 5000) no Hoare annotation was computed. [2022-01-31 02:26:18,975 INFO L858 garLoopResultBuilder]: For program point L829(lines 829 853) no Hoare annotation was computed. [2022-01-31 02:26:18,975 INFO L858 garLoopResultBuilder]: For program point L3670(lines 3670 5023) no Hoare annotation was computed. [2022-01-31 02:26:18,975 INFO L858 garLoopResultBuilder]: For program point L4793(lines 4793 4838) no Hoare annotation was computed. [2022-01-31 02:26:18,975 INFO L858 garLoopResultBuilder]: For program point L1622(lines 1622 5204) no Hoare annotation was computed. [2022-01-31 02:26:18,975 INFO L858 garLoopResultBuilder]: For program point L3406(lines 3406 5046) no Hoare annotation was computed. [2022-01-31 02:26:18,975 INFO L858 garLoopResultBuilder]: For program point L1358(lines 1358 5227) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L301(lines 301 321) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L4331(lines 4331 4966) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L1094(lines 1094 5250) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L2019(lines 2019 5170) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L2812(lines 2812 2823) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L434(lines 434 467) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L3209(lines 3209 3233) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L4002(lines 4002 4994) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L897(lines 897 921) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L4795(line 4795) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L3738(lines 3738 5017) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L1690(lines 1690 5198) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L3474(lines 3474 5040) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L1426(lines 1426 5221) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L4399(lines 4399 4960) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 257) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 4783) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L1162(lines 1162 5244) no Hoare annotation was computed. [2022-01-31 02:26:18,976 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 61) no Hoare annotation was computed. [2022-01-31 02:26:18,977 INFO L858 garLoopResultBuilder]: For program point L2087(lines 2087 5164) no Hoare annotation was computed. [2022-01-31 02:26:18,977 INFO L858 garLoopResultBuilder]: For program point L2880(lines 2880 2891) no Hoare annotation was computed. [2022-01-31 02:26:18,977 INFO L858 garLoopResultBuilder]: For program point L370(lines 370 553) no Hoare annotation was computed. [2022-01-31 02:26:18,977 INFO L858 garLoopResultBuilder]: For program point L3277(lines 3277 3301) no Hoare annotation was computed. [2022-01-31 02:26:18,977 INFO L858 garLoopResultBuilder]: For program point L4070(lines 4070 4988) no Hoare annotation was computed. [2022-01-31 02:26:18,977 INFO L858 garLoopResultBuilder]: For program point L965(lines 965 989) no Hoare annotation was computed. [2022-01-31 02:26:18,977 INFO L858 garLoopResultBuilder]: For program point L3806(lines 3806 5011) no Hoare annotation was computed. [2022-01-31 02:26:18,977 INFO L858 garLoopResultBuilder]: For program point L1758(lines 1758 5192) no Hoare annotation was computed. [2022-01-31 02:26:18,977 INFO L858 garLoopResultBuilder]: For program point L3542(lines 3542 5034) no Hoare annotation was computed. [2022-01-31 02:26:18,977 INFO L858 garLoopResultBuilder]: For program point L1494(lines 1494 5215) no Hoare annotation was computed. [2022-01-31 02:26:18,978 INFO L858 garLoopResultBuilder]: For program point L4467(lines 4467 4954) no Hoare annotation was computed. [2022-01-31 02:26:18,978 INFO L858 garLoopResultBuilder]: For program point L1230(lines 1230 5238) no Hoare annotation was computed. [2022-01-31 02:26:18,978 INFO L858 garLoopResultBuilder]: For program point L2155(lines 2155 5158) no Hoare annotation was computed. [2022-01-31 02:26:18,978 INFO L858 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 4811) no Hoare annotation was computed. [2022-01-31 02:26:18,978 INFO L858 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-01-31 02:26:18,978 INFO L858 garLoopResultBuilder]: For program point L2948(lines 2948 2959) no Hoare annotation was computed. [2022-01-31 02:26:18,978 INFO L858 garLoopResultBuilder]: For program point L4864(lines 4864 4874) no Hoare annotation was computed. [2022-01-31 02:26:18,978 INFO L858 garLoopResultBuilder]: For program point L3345(lines 3345 3369) no Hoare annotation was computed. [2022-01-31 02:26:18,978 INFO L858 garLoopResultBuilder]: For program point L4138(lines 4138 4982) no Hoare annotation was computed. [2022-01-31 02:26:18,978 INFO L858 garLoopResultBuilder]: For program point L1033(lines 1033 1057) no Hoare annotation was computed. [2022-01-31 02:26:18,978 INFO L854 garLoopResultBuilder]: At program point L4931(lines 4665 4938) the Hoare annotation is: (and (<= 59 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 02:26:18,978 INFO L858 garLoopResultBuilder]: For program point L3874(lines 3874 5005) no Hoare annotation was computed. [2022-01-31 02:26:18,978 INFO L858 garLoopResultBuilder]: For program point L1826(lines 1826 5186) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L571(lines 571 591) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L3610(lines 3610 5028) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L1562(lines 1562 5209) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L4535(lines 4535 4948) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L1298(lines 1298 5232) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L2223(lines 2223 5152) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L3016(lines 3016 3027) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L4866(line 4866) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L704(lines 704 715) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L854 garLoopResultBuilder]: At program point L506(lines 360 554) the Hoare annotation is: (<= 0 main_~main__t~0) [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L3413(lines 3413 3437) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 183) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L4206(lines 4206 4976) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L1101(lines 1101 1125) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L3942(lines 3942 4999) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L1894(lines 1894 5180) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L3678(lines 3678 5022) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L1630(lines 1630 5203) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L4603(lines 4603 4942) no Hoare annotation was computed. [2022-01-31 02:26:18,979 INFO L858 garLoopResultBuilder]: For program point L441(lines 441 461) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L1366(lines 1366 5226) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L2291(lines 2291 5146) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L3084(lines 3084 3095) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L772(lines 772 783) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L4802(lines 4802 4837) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L3481(lines 3481 3505) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L4274(lines 4274 4970) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L1169(lines 1169 1193) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 119) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L4010(lines 4010 4993) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L1962(lines 1962 5174) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L3746(lines 3746 5016) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L1698(lines 1698 5197) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L1434(lines 1434 5220) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L377(lines 377 397) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L2359(lines 2359 5140) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L3152(lines 3152 3163) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L840(lines 840 851) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L3549(lines 3549 3573) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L312(lines 312 319) no Hoare annotation was computed. [2022-01-31 02:26:18,980 INFO L858 garLoopResultBuilder]: For program point L4342(lines 4342 4964) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point L1237(lines 1237 1261) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point L4078(lines 4078 4987) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point L2030(lines 2030 5168) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point L3814(lines 3814 5010) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point L1766(lines 1766 5191) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L854 garLoopResultBuilder]: At program point L643(lines 128 645) the Hoare annotation is: (and (= ~__tmp_148_0~0 |old(~__tmp_148_0~0)|) (= |old(~__tmp_179_1~0)| ~__tmp_179_1~0) (= |old(~__tmp_218_0~0)| ~__tmp_218_0~0) (<= 0 main_~main__t~0) (= ~__tmp_2390_0~0 |old(~__tmp_2390_0~0)|) (= |old(~__tmp_179_2~0)| ~__tmp_179_2~0) (= ~__tmp_109_1~0 |old(~__tmp_109_1~0)|) (= ~__tmp_109_0~0 |old(~__tmp_109_0~0)|) (= |old(~__return_2583~0)| ~__return_2583~0) (= ~__tmp_2390_1~0 |old(~__tmp_2390_1~0)|) (= |old(~__tmp_179_0~0)| ~__tmp_179_0~0)) [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point L1502(lines 1502 5214) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point L2427(lines 2427 5134) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point L3220(lines 3220 3231) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point L908(lines 908 919) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 53) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point L3617(lines 3617 3641) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point L4410(lines 4410 4958) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point L1305(lines 1305 1329) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point L248(lines 248 255) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point L2098(lines 2098 5162) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point L4146(lines 4146 4981) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point L3882(lines 3882 5004) no Hoare annotation was computed. [2022-01-31 02:26:18,981 INFO L858 garLoopResultBuilder]: For program point L1834(lines 1834 5185) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L854 garLoopResultBuilder]: At program point L4873(lines 4730 4922) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~273 0)) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~__VERIFIER_assert__cond~270 0)) (not (= main_~__VERIFIER_assert__cond~271 0)) (<= 61 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~272 0))) [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point L4741(lines 4741 4763) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point L1570(lines 1570 5208) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point L2495(lines 2495 5128) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point L3288(lines 3288 3299) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point L51(lines 51 59) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 4854) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point L976(lines 976 987) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point L3685(lines 3685 3709) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point L4676(lines 4676 4936) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point L4478(lines 4478 4952) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4690) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point L1373(lines 1373 1397) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point L4214(lines 4214 4975) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point L2166(lines 2166 5156) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point L3950(lines 3950 4998) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point L1902(lines 1902 5179) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point L4743(line 4743) no Hoare annotation was computed. [2022-01-31 02:26:18,982 INFO L858 garLoopResultBuilder]: For program point L4809(lines 4809 4831) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L1638(lines 1638 5202) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L2563(lines 2563 5122) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L3356(lines 3356 3367) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L1044(lines 1044 1055) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 4893) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L3753(lines 3753 3777) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L4678(line 4678) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L582(lines 582 589) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L4546(lines 4546 4946) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L1441(lines 1441 1465) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L4282(lines 4282 4969) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L2234(lines 2234 5150) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L4018(lines 4018 4992) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L1970(lines 1970 5173) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L4811(line 4811) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L1706(lines 1706 5196) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L2631(lines 2631 5116) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L517(lines 517 551) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L3424(lines 3424 3435) no Hoare annotation was computed. [2022-01-31 02:26:18,983 INFO L858 garLoopResultBuilder]: For program point L1112(lines 1112 1123) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L3821(lines 3821 3845) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L4614(lines 4614 4940) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L1509(lines 1509 1533) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L452(lines 452 459) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L4350(lines 4350 4963) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L2302(lines 2302 5144) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L4086(lines 4086 4986) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L2038(lines 2038 5167) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L1774(lines 1774 5190) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L2699(lines 2699 5110) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L3492(lines 3492 3503) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L1180(lines 1180 1191) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L3889(lines 3889 3913) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L1577(lines 1577 1601) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 395) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L4418(lines 4418 4957) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L2370(lines 2370 5138) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L2106(lines 2106 5161) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L4154(lines 4154 4980) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L1842(lines 1842 5184) no Hoare annotation was computed. [2022-01-31 02:26:18,984 INFO L858 garLoopResultBuilder]: For program point L2767(lines 2767 5104) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L3560(lines 3560 3571) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L1248(lines 1248 1259) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L3957(lines 3957 3981) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L1645(lines 1645 1669) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L4486(lines 4486 4951) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L2438(lines 2438 5132) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L4222(lines 4222 4974) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L2174(lines 2174 5155) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L1910(lines 1910 5178) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L2835(lines 2835 5098) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L3628(lines 3628 3639) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L1316(lines 1316 1327) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L4025(lines 4025 4049) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L4884(lines 4884 4919) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L1713(lines 1713 1737) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L524(lines 524 544) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L4554(lines 4554 4945) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L2506(lines 2506 5126) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L4290(lines 4290 4968) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L2242(lines 2242 5149) no Hoare annotation was computed. [2022-01-31 02:26:18,985 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 645) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L1978(lines 1978 5172) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4726) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L2903(lines 2903 5092) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L3696(lines 3696 3707) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L4753(lines 4753 4761) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L1384(lines 1384 1395) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L4093(lines 4093 4117) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L1781(lines 1781 1805) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L4622(lines 4622 4939) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L2574(lines 2574 5120) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L4688(lines 4688 4934) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L4358(lines 4358 4962) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L2310(lines 2310 5143) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L2046(lines 2046 5166) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L2971(lines 2971 5086) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 4755) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L3764(lines 3764 3775) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L4755(line 4755) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L659(lines 659 5290) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L4821(lines 4821 4829) no Hoare annotation was computed. [2022-01-31 02:26:18,986 INFO L858 garLoopResultBuilder]: For program point L1452(lines 1452 1463) no Hoare annotation was computed. [2022-01-31 02:26:18,987 INFO L858 garLoopResultBuilder]: For program point L4161(lines 4161 4185) no Hoare annotation was computed. [2022-01-31 02:26:18,987 INFO L858 garLoopResultBuilder]: For program point L1849(lines 1849 1873) no Hoare annotation was computed. [2022-01-31 02:26:18,987 INFO L858 garLoopResultBuilder]: For program point L4690(line 4690) no Hoare annotation was computed. [2022-01-31 02:26:18,987 INFO L858 garLoopResultBuilder]: For program point L2642(lines 2642 5114) no Hoare annotation was computed. [2022-01-31 02:26:18,987 INFO L858 garLoopResultBuilder]: For program point L4426(lines 4426 4956) no Hoare annotation was computed. [2022-01-31 02:26:18,987 INFO L858 garLoopResultBuilder]: For program point L2378(lines 2378 5137) no Hoare annotation was computed. [2022-01-31 02:26:18,987 INFO L858 garLoopResultBuilder]: For program point L264(lines 264 599) no Hoare annotation was computed. [2022-01-31 02:26:18,987 INFO L858 garLoopResultBuilder]: For program point L132(lines 132 605) no Hoare annotation was computed. [2022-01-31 02:26:18,987 INFO L858 garLoopResultBuilder]: For program point L2114(lines 2114 5160) no Hoare annotation was computed. [2022-01-31 02:26:18,987 INFO L858 garLoopResultBuilder]: For program point L3039(lines 3039 5080) no Hoare annotation was computed. [2022-01-31 02:26:18,987 INFO L858 garLoopResultBuilder]: For program point L3832(lines 3832 3843) no Hoare annotation was computed. [2022-01-31 02:26:18,987 INFO L858 garLoopResultBuilder]: For program point L4823(line 4823) no Hoare annotation was computed. [2022-01-31 02:26:18,987 INFO L858 garLoopResultBuilder]: For program point L727(lines 727 5284) no Hoare annotation was computed. [2022-01-31 02:26:18,987 INFO L858 garLoopResultBuilder]: For program point L1520(lines 1520 1531) no Hoare annotation was computed. [2022-01-31 02:26:18,988 INFO L858 garLoopResultBuilder]: For program point L4229(lines 4229 4253) no Hoare annotation was computed. [2022-01-31 02:26:18,988 INFO L858 garLoopResultBuilder]: For program point L1917(lines 1917 1941) no Hoare annotation was computed. [2022-01-31 02:26:18,988 INFO L858 garLoopResultBuilder]: For program point L2710(lines 2710 5108) no Hoare annotation was computed. [2022-01-31 02:26:18,988 INFO L858 garLoopResultBuilder]: For program point L4494(lines 4494 4950) no Hoare annotation was computed. [2022-01-31 02:26:18,988 INFO L858 garLoopResultBuilder]: For program point L2446(lines 2446 5131) no Hoare annotation was computed. [2022-01-31 02:26:18,988 INFO L858 garLoopResultBuilder]: For program point L2182(lines 2182 5154) no Hoare annotation was computed. [2022-01-31 02:26:18,988 INFO L858 garLoopResultBuilder]: For program point L68(lines 68 5292) no Hoare annotation was computed. [2022-01-31 02:26:18,988 INFO L858 garLoopResultBuilder]: For program point L3107(lines 3107 5074) no Hoare annotation was computed. [2022-01-31 02:26:18,988 INFO L858 garLoopResultBuilder]: For program point L3900(lines 3900 3911) no Hoare annotation was computed. [2022-01-31 02:26:18,988 INFO L858 garLoopResultBuilder]: For program point L4891(lines 4891 4913) no Hoare annotation was computed. [2022-01-31 02:26:18,988 INFO L858 garLoopResultBuilder]: For program point L795(lines 795 5278) no Hoare annotation was computed. [2022-01-31 02:26:18,988 INFO L854 garLoopResultBuilder]: At program point L597(lines 264 599) the Hoare annotation is: (<= 0 main_~main__t~0) [2022-01-31 02:26:18,988 INFO L858 garLoopResultBuilder]: For program point L1588(lines 1588 1599) no Hoare annotation was computed. [2022-01-31 02:26:18,988 INFO L858 garLoopResultBuilder]: For program point L4297(lines 4297 4321) no Hoare annotation was computed. [2022-01-31 02:26:18,989 INFO L858 garLoopResultBuilder]: For program point L1985(lines 1985 2009) no Hoare annotation was computed. [2022-01-31 02:26:18,989 INFO L858 garLoopResultBuilder]: For program point L2778(lines 2778 5102) no Hoare annotation was computed. [2022-01-31 02:26:18,990 INFO L858 garLoopResultBuilder]: For program point L4562(lines 4562 4944) no Hoare annotation was computed. [2022-01-31 02:26:18,990 INFO L858 garLoopResultBuilder]: For program point L2514(lines 2514 5125) no Hoare annotation was computed. [2022-01-31 02:26:18,990 INFO L858 garLoopResultBuilder]: For program point L268(lines 268 558) no Hoare annotation was computed. [2022-01-31 02:26:18,990 INFO L858 garLoopResultBuilder]: For program point L2250(lines 2250 5148) no Hoare annotation was computed. [2022-01-31 02:26:18,990 INFO L858 garLoopResultBuilder]: For program point L3175(lines 3175 5068) no Hoare annotation was computed. [2022-01-31 02:26:18,990 INFO L858 garLoopResultBuilder]: For program point L3968(lines 3968 3979) no Hoare annotation was computed. [2022-01-31 02:26:18,990 INFO L858 garLoopResultBuilder]: For program point L863(lines 863 5272) no Hoare annotation was computed. [2022-01-31 02:26:18,990 INFO L858 garLoopResultBuilder]: For program point L4893(line 4893) no Hoare annotation was computed. [2022-01-31 02:26:18,990 INFO L858 garLoopResultBuilder]: For program point L1656(lines 1656 1667) no Hoare annotation was computed. [2022-01-31 02:26:18,990 INFO L854 garLoopResultBuilder]: At program point L335(lines 268 558) the Hoare annotation is: (<= 0 main_~main__t~0) [2022-01-31 02:26:18,990 INFO L858 garLoopResultBuilder]: For program point mainFINAL(lines 22 5301) no Hoare annotation was computed. [2022-01-31 02:26:18,990 INFO L858 garLoopResultBuilder]: For program point L4365(lines 4365 4389) no Hoare annotation was computed. [2022-01-31 02:26:18,990 INFO L858 garLoopResultBuilder]: For program point L2053(lines 2053 2077) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L2846(lines 2846 5096) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L4630(lines 4630 4938) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L2582(lines 2582 5119) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L2318(lines 2318 5142) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L3243(lines 3243 5062) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L4036(lines 4036 4047) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L931(lines 931 5266) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L1724(lines 1724 1735) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L535(lines 535 542) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L4697(lines 4697 4933) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L4433(lines 4433 4457) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 194) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L2121(lines 2121 2145) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L2914(lines 2914 5090) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L2650(lines 2650 5113) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L404(lines 404 552) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L2386(lines 2386 5136) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 603) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L3311(lines 3311 5056) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L4104(lines 4104 4115) no Hoare annotation was computed. [2022-01-31 02:26:18,991 INFO L858 garLoopResultBuilder]: For program point L999(lines 999 5260) no Hoare annotation was computed. [2022-01-31 02:26:18,992 INFO L858 garLoopResultBuilder]: For program point L1792(lines 1792 1803) no Hoare annotation was computed. [2022-01-31 02:26:18,992 INFO L854 garLoopResultBuilder]: At program point L4699(lines 31 5293) the Hoare annotation is: (and (<= 0 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-01-31 02:26:18,992 INFO L858 garLoopResultBuilder]: For program point L4501(lines 4501 4525) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 4795) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point L2189(lines 2189 2213) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point L75(lines 75 649) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point L2982(lines 2982 5084) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point L2718(lines 2718 5107) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point L670(lines 670 5288) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point L2454(lines 2454 5130) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point L3379(lines 3379 5050) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point L4172(lines 4172 4183) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point L1067(lines 1067 5254) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point L1860(lines 1860 1871) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point L4569(lines 4569 4593) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point L275(lines 275 330) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point L2257(lines 2257 2281) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point L3050(lines 3050 5078) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 4823) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point L2786(lines 2786 5101) no Hoare annotation was computed. [2022-01-31 02:26:18,993 INFO L858 garLoopResultBuilder]: For program point L738(lines 738 5282) no Hoare annotation was computed. [2022-01-31 02:26:18,994 INFO L858 garLoopResultBuilder]: For program point L2522(lines 2522 5124) no Hoare annotation was computed. [2022-01-31 02:26:18,994 INFO L858 garLoopResultBuilder]: For program point L408(lines 408 511) no Hoare annotation was computed. [2022-01-31 02:26:18,994 INFO L858 garLoopResultBuilder]: For program point L3447(lines 3447 5044) no Hoare annotation was computed. [2022-01-31 02:26:18,994 INFO L858 garLoopResultBuilder]: For program point L1135(lines 1135 5248) no Hoare annotation was computed. [2022-01-31 02:26:18,994 INFO L854 garLoopResultBuilder]: At program point L5297(lines 27 5300) the Hoare annotation is: (or (<= 0 main_~main__t~0) (and (= ~__tmp_148_0~0 |old(~__tmp_148_0~0)|) (= |old(~__tmp_179_1~0)| ~__tmp_179_1~0) (= |old(~__tmp_218_0~0)| ~__tmp_218_0~0) (= ~__tmp_2390_0~0 |old(~__tmp_2390_0~0)|) (= |old(~__tmp_179_2~0)| ~__tmp_179_2~0) (= ~__tmp_109_1~0 |old(~__tmp_109_1~0)|) (= ~__tmp_109_0~0 |old(~__tmp_109_0~0)|) (= |old(~__return_2583~0)| ~__return_2583~0) (= ~__tmp_2390_1~0 |old(~__tmp_2390_1~0)|) (= |old(~__tmp_179_0~0)| ~__tmp_179_0~0))) [2022-01-31 02:26:18,994 INFO L858 garLoopResultBuilder]: For program point L4240(lines 4240 4251) no Hoare annotation was computed. [2022-01-31 02:26:18,994 INFO L858 garLoopResultBuilder]: For program point L1928(lines 1928 1939) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L854 garLoopResultBuilder]: At program point L475(lines 408 511) the Hoare annotation is: (<= 0 main_~main__t~0) [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L4637(lines 4637 4661) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L2325(lines 2325 2349) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L3118(lines 3118 5072) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L2854(lines 2854 5095) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L806(lines 806 5276) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L4770(lines 4770 4920) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 41) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L2590(lines 2590 5118) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L3515(lines 3515 5038) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 556) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L1203(lines 1203 5242) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L4308(lines 4308 4319) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L1996(lines 1996 2007) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L4903(lines 4903 4911) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L4705(lines 4705 4932) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L2393(lines 2393 2417) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L3186(lines 3186 5066) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L2922(lines 2922 5089) no Hoare annotation was computed. [2022-01-31 02:26:18,995 INFO L858 garLoopResultBuilder]: For program point L874(lines 874 5270) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L2658(lines 2658 5112) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4678) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L3583(lines 3583 5032) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L1271(lines 1271 5236) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L4376(lines 4376 4387) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L2064(lines 2064 2075) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L4905(line 4905) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L611(lines 611 644) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L2461(lines 2461 2485) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L3254(lines 3254 5060) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L2990(lines 2990 5083) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L942(lines 942 5264) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L4774(lines 4774 4878) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L2726(lines 2726 5106) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L678(lines 678 5287) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L3651(lines 3651 5026) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L1339(lines 1339 5230) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L4444(lines 4444 4455) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 192) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L2132(lines 2132 2143) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L2529(lines 2529 2553) no Hoare annotation was computed. [2022-01-31 02:26:18,996 INFO L858 garLoopResultBuilder]: For program point L415(lines 415 470) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L3322(lines 3322 5054) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L217(lines 217 601) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L3058(lines 3058 5077) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L1010(lines 1010 5258) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L2794(lines 2794 5100) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L746(lines 746 5281) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L3719(lines 3719 5020) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L1407(lines 1407 5224) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L4512(lines 4512 4523) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L2200(lines 2200 2211) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L86(lines 86 647) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L2597(lines 2597 2621) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L3390(lines 3390 5048) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L3126(lines 3126 5071) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L1078(lines 1078 5252) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L2862(lines 2862 5094) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L814(lines 814 5275) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 4866) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L858 garLoopResultBuilder]: For program point L3787(lines 3787 5014) no Hoare annotation was computed. [2022-01-31 02:26:18,997 INFO L854 garLoopResultBuilder]: At program point L550(lines 404 552) the Hoare annotation is: (<= 0 main_~main__t~0) [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L4712(lines 4712 4924) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L484(lines 484 509) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L1475(lines 1475 5218) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L4580(lines 4580 4591) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L286(lines 286 328) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L2268(lines 2268 2279) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L2665(lines 2665 2689) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L3458(lines 3458 5042) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L3194(lines 3194 5065) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L1146(lines 1146 5246) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L2930(lines 2930 5088) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L882(lines 882 5269) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L3855(lines 3855 5008) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 4905) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L4714(line 4714) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L618(lines 618 638) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L1543(lines 1543 5212) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L4648(lines 4648 4659) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L2336(lines 2336 2347) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L2733(lines 2733 2757) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L4781(lines 4781 4840) no Hoare annotation was computed. [2022-01-31 02:26:18,998 INFO L858 garLoopResultBuilder]: For program point L3526(lines 3526 5036) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 554) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L3262(lines 3262 5059) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L1214(lines 1214 5240) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L2998(lines 2998 5082) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L950(lines 950 5263) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L3923(lines 3923 5002) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L686(lines 686 5286) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L1611(lines 1611 5206) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L2404(lines 2404 2415) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 191) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4714) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L4783(line 4783) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L2801(lines 2801 2825) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L3594(lines 3594 5030) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L3330(lines 3330 5053) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L1282(lines 1282 5234) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 5300) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L3066(lines 3066 5076) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L1018(lines 1018 5257) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L3991(lines 3991 4996) no Hoare annotation was computed. [2022-01-31 02:26:18,999 INFO L858 garLoopResultBuilder]: For program point L754(lines 754 5280) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point L1679(lines 1679 5200) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point L2472(lines 2472 2483) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 646) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 4743) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point L2869(lines 2869 2893) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point L3662(lines 3662 5024) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point L3398(lines 3398 5047) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point L1350(lines 1350 5228) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point L3134(lines 3134 5070) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point L1086(lines 1086 5251) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point L4059(lines 4059 4990) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L854 garLoopResultBuilder]: At program point L4918(lines 4770 4920) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~273 0)) (not (= main_~__VERIFIER_assert__cond~270 0)) (not (= main_~__VERIFIER_assert__cond~271 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 61 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~272 0))) [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point L822(lines 822 5274) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point L1747(lines 1747 5194) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point L4852(lines 4852 4876) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point L2540(lines 2540 2551) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point L426(lines 426 468) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point L294(lines 294 327) no Hoare annotation was computed. [2022-01-31 02:26:19,000 INFO L854 garLoopResultBuilder]: At program point mainENTRY(lines 22 5301) the Hoare annotation is: (and (= ~__tmp_148_0~0 |old(~__tmp_148_0~0)|) (= |old(~__tmp_179_1~0)| ~__tmp_179_1~0) (= |old(~__tmp_218_0~0)| ~__tmp_218_0~0) (= ~__tmp_2390_0~0 |old(~__tmp_2390_0~0)|) (= |old(~__tmp_179_2~0)| ~__tmp_179_2~0) (= ~__tmp_109_1~0 |old(~__tmp_109_1~0)|) (= ~__tmp_109_0~0 |old(~__tmp_109_0~0)|) (= |old(~__return_2583~0)| ~__return_2583~0) (= ~__tmp_2390_1~0 |old(~__tmp_2390_1~0)|) (= |old(~__tmp_179_0~0)| ~__tmp_179_0~0)) [2022-01-31 02:26:19,000 INFO L858 garLoopResultBuilder]: For program point L2937(lines 2937 2961) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L3730(lines 3730 5018) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L3466(lines 3466 5041) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L1418(lines 1418 5222) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L3202(lines 3202 5064) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L1154(lines 1154 5245) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 5293) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L4127(lines 4127 4984) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L890(lines 890 5268) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L4854(line 4854) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L1815(lines 1815 5188) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L2608(lines 2608 2619) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L230(lines 230 600) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L3005(lines 3005 3029) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L3798(lines 3798 5012) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L693(lines 693 717) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L495(lines 495 507) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L3534(lines 3534 5035) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L1486(lines 1486 5216) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L3270(lines 3270 5058) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L1222(lines 1222 5239) no Hoare annotation was computed. [2022-01-31 02:26:19,001 INFO L858 garLoopResultBuilder]: For program point L165(lines 165 185) no Hoare annotation was computed. [2022-01-31 02:26:19,002 INFO L858 garLoopResultBuilder]: For program point L4195(lines 4195 4978) no Hoare annotation was computed. [2022-01-31 02:26:19,002 INFO L858 garLoopResultBuilder]: For program point L958(lines 958 5262) no Hoare annotation was computed. [2022-01-31 02:26:19,002 INFO L858 garLoopResultBuilder]: For program point L1883(lines 1883 5182) no Hoare annotation was computed. [2022-01-31 02:26:19,002 INFO L858 garLoopResultBuilder]: For program point L2676(lines 2676 2687) no Hoare annotation was computed. [2022-01-31 02:26:19,002 INFO L854 garLoopResultBuilder]: At program point L4658(lines 68 5292) the Hoare annotation is: (<= 0 main_~main__t~0) [2022-01-31 02:26:19,002 INFO L858 garLoopResultBuilder]: For program point L4724(lines 4724 4922) no Hoare annotation was computed. [2022-01-31 02:26:19,002 INFO L858 garLoopResultBuilder]: For program point L3073(lines 3073 3097) no Hoare annotation was computed. [2022-01-31 02:26:19,002 INFO L858 garLoopResultBuilder]: For program point L3866(lines 3866 5006) no Hoare annotation was computed. [2022-01-31 02:26:19,002 INFO L858 garLoopResultBuilder]: For program point L761(lines 761 785) no Hoare annotation was computed. [2022-01-31 02:26:19,002 INFO L858 garLoopResultBuilder]: For program point L629(lines 629 636) no Hoare annotation was computed. [2022-01-31 02:26:19,002 INFO L858 garLoopResultBuilder]: For program point L3602(lines 3602 5029) no Hoare annotation was computed. [2022-01-31 02:26:19,002 INFO L858 garLoopResultBuilder]: For program point L1554(lines 1554 5210) no Hoare annotation was computed. [2022-01-31 02:26:19,002 INFO L858 garLoopResultBuilder]: For program point L3338(lines 3338 5052) no Hoare annotation was computed. [2022-01-31 02:26:19,002 INFO L858 garLoopResultBuilder]: For program point L1290(lines 1290 5233) no Hoare annotation was computed. [2022-01-31 02:26:19,002 INFO L858 garLoopResultBuilder]: For program point L4263(lines 4263 4972) no Hoare annotation was computed. [2022-01-31 02:26:19,002 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 121) no Hoare annotation was computed. [2022-01-31 02:26:19,002 INFO L858 garLoopResultBuilder]: For program point L1026(lines 1026 5256) no Hoare annotation was computed. [2022-01-31 02:26:19,002 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-01-31 02:26:19,003 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__tmp_148_0~0 |old(~__tmp_148_0~0)|) (= |old(~__tmp_179_1~0)| ~__tmp_179_1~0) (= |old(~__tmp_218_0~0)| ~__tmp_218_0~0) (= ~__tmp_2390_0~0 |old(~__tmp_2390_0~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_179_2~0)| ~__tmp_179_2~0) (= ~__tmp_109_1~0 |old(~__tmp_109_1~0)|) (= ~__tmp_109_0~0 |old(~__tmp_109_0~0)|) (= |old(~__return_2583~0)| ~__return_2583~0) (= ~__tmp_2390_1~0 |old(~__tmp_2390_1~0)|) (= |old(~__tmp_179_0~0)| ~__tmp_179_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 02:26:19,003 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-01-31 02:26:19,003 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-31 02:26:19,003 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 02:26:19,003 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 02:26:19,003 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-31 02:26:19,005 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 02:26:19,007 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 02:26:19,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:26:19 BoogieIcfgContainer [2022-01-31 02:26:19,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 02:26:19,038 INFO L158 Benchmark]: Toolchain (without parser) took 32123.50ms. Allocated memory was 192.9MB in the beginning and 521.1MB in the end (delta: 328.2MB). Free memory was 134.4MB in the beginning and 269.3MB in the end (delta: -134.9MB). Peak memory consumption was 193.6MB. Max. memory is 8.0GB. [2022-01-31 02:26:19,038 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 192.9MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 02:26:19,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 871.13ms. Allocated memory was 192.9MB in the beginning and 260.0MB in the end (delta: 67.1MB). Free memory was 134.1MB in the beginning and 158.8MB in the end (delta: -24.6MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. [2022-01-31 02:26:19,038 INFO L158 Benchmark]: Boogie Preprocessor took 85.12ms. Allocated memory is still 260.0MB. Free memory was 158.8MB in the beginning and 150.9MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-01-31 02:26:19,038 INFO L158 Benchmark]: RCFGBuilder took 1105.08ms. Allocated memory is still 260.0MB. Free memory was 150.9MB in the beginning and 108.3MB in the end (delta: 42.6MB). Peak memory consumption was 52.0MB. Max. memory is 8.0GB. [2022-01-31 02:26:19,039 INFO L158 Benchmark]: TraceAbstraction took 30058.52ms. Allocated memory was 260.0MB in the beginning and 521.1MB in the end (delta: 261.1MB). Free memory was 107.8MB in the beginning and 269.3MB in the end (delta: -161.5MB). Peak memory consumption was 100.2MB. Max. memory is 8.0GB. [2022-01-31 02:26:19,039 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 192.9MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 871.13ms. Allocated memory was 192.9MB in the beginning and 260.0MB in the end (delta: 67.1MB). Free memory was 134.1MB in the beginning and 158.8MB in the end (delta: -24.6MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 85.12ms. Allocated memory is still 260.0MB. Free memory was 158.8MB in the beginning and 150.9MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1105.08ms. Allocated memory is still 260.0MB. Free memory was 150.9MB in the beginning and 108.3MB in the end (delta: 42.6MB). Peak memory consumption was 52.0MB. Max. memory is 8.0GB. * TraceAbstraction took 30058.52ms. Allocated memory was 260.0MB in the beginning and 521.1MB in the end (delta: 261.1MB). Free memory was 107.8MB in the beginning and 269.3MB in the end (delta: -161.5MB). Peak memory consumption was 100.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 41]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 53]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4678]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4690]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4714]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4726]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4743]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4755]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4783]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4795]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4811]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4823]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4854]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4866]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4893]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 4905]: 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, 487 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 30.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11073 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11073 mSDsluCounter, 2575 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 959 mSDsCounter, 2617 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16844 IncrementalHoareTripleChecker+Invalid, 19461 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2617 mSolverCounterUnsat, 1616 mSDtfsCounter, 16844 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1345 GetRequests, 636 SyntacticMatches, 5 SemanticMatches, 704 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10250 ImplicationChecksByTransitivity, 16.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=480occurred in iteration=0, InterpolantAutomatonStates: 413, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 107 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 21 NumberOfFragments, 222 HoareAnnotationTreeSize, 16 FomulaSimplifications, 2202 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 2736 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 3604 NumberOfCodeBlocks, 3604 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3588 ConstructedInterpolants, 0 QuantifiedInterpolants, 10824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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: 4770]: Loop Invariant Derived loop invariant: ((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__t < main__tagbuf_len) && 61 <= main__t) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 4730]: Loop Invariant Derived loop invariant: ((((!(__VERIFIER_assert__cond == 0) && main__t < main__tagbuf_len + 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 61 <= main__t) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 268]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 <= main__t || (((((((((__tmp_148_0 == \old(__tmp_148_0) && \old(__tmp_179_1) == __tmp_179_1) && \old(__tmp_218_0) == __tmp_218_0) && __tmp_2390_0 == \old(__tmp_2390_0)) && \old(__tmp_179_2) == __tmp_179_2) && __tmp_109_1 == \old(__tmp_109_1)) && __tmp_109_0 == \old(__tmp_109_0)) && \old(__return_2583) == __return_2583) && __tmp_2390_1 == \old(__tmp_2390_1)) && \old(__tmp_179_0) == __tmp_179_0) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((((((((__tmp_148_0 == \old(__tmp_148_0) && \old(__tmp_179_1) == __tmp_179_1) && \old(__tmp_218_0) == __tmp_218_0) && 0 <= main__t) && __tmp_2390_0 == \old(__tmp_2390_0)) && \old(__tmp_179_2) == __tmp_179_2) && __tmp_109_1 == \old(__tmp_109_1)) && __tmp_109_0 == \old(__tmp_109_0)) && \old(__return_2583) == __return_2583) && __tmp_2390_1 == \old(__tmp_2390_1)) && \old(__tmp_179_0) == __tmp_179_0 - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 4665]: Loop Invariant Derived loop invariant: 59 <= main__t && main__t < main__tagbuf_len - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 0 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: 0 <= main__t RESULT: Ultimate proved your program to be correct! [2022-01-31 02:26:19,077 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...