/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:10:23,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:10:23,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:10:23,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:10:23,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:10:23,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:10:23,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:10:23,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:10:23,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:10:23,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:10:23,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:10:23,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:10:23,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:10:23,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:10:23,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:10:23,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:10:23,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:10:23,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:10:23,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:10:23,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:10:23,966 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:10:23,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:10:23,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:10:23,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:10:23,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:10:23,971 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:10:23,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:10:23,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:10:23,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:10:23,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:10:23,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:10:23,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:10:23,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:10:23,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:10:23,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:10:23,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:10:23,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:10:23,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:10:23,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:10:23,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:10:23,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:10:23,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:10:23,989 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:10:24,002 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:10:24,003 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:10:24,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:10:24,004 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:10:24,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:10:24,004 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:10:24,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:10:24,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:10:24,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:10:24,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:10:24,005 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:10:24,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:10:24,005 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:10:24,006 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:10:24,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:10:24,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:10:24,006 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:10:24,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:10:24,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:10:24,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:10:24,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:10:24,007 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:10:24,007 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:10:24,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:10:24,007 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:10:24,007 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 03:10:24,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:10:24,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:10:24,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:10:24,228 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:10:24,229 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:10:24,230 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.v+nlh-reducer.c [2022-04-28 03:10:24,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbaea7afd/167c497f5a334dae98d7b645c08a655d/FLAG516109534 [2022-04-28 03:10:24,640 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:10:24,641 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2022-04-28 03:10:24,646 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbaea7afd/167c497f5a334dae98d7b645c08a655d/FLAG516109534 [2022-04-28 03:10:24,654 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbaea7afd/167c497f5a334dae98d7b645c08a655d [2022-04-28 03:10:24,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:10:24,656 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:10:24,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:10:24,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:10:24,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:10:24,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:10:24" (1/1) ... [2022-04-28 03:10:24,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a8144e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:24, skipping insertion in model container [2022-04-28 03:10:24,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:10:24" (1/1) ... [2022-04-28 03:10:24,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:10:24,702 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:10:24,837 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.v+nlh-reducer.c[1123,1136] [2022-04-28 03:10:24,839 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.v+nlh-reducer.c[1338,1351] [2022-04-28 03:10:24,840 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.v+nlh-reducer.c[1654,1667] [2022-04-28 03:10:24,841 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.v+nlh-reducer.c[1869,1882] [2022-04-28 03:10:24,843 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.v+nlh-reducer.c[2402,2415] [2022-04-28 03:10:24,844 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.v+nlh-reducer.c[2617,2630] [2022-04-28 03:10:24,845 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.v+nlh-reducer.c[2919,2932] [2022-04-28 03:10:24,846 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.v+nlh-reducer.c[3134,3147] [2022-04-28 03:10:24,854 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.v+nlh-reducer.c[3404,3417] [2022-04-28 03:10:24,856 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.v+nlh-reducer.c[3622,3635] [2022-04-28 03:10:24,857 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.v+nlh-reducer.c[4106,4119] [2022-04-28 03:10:24,858 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.v+nlh-reducer.c[4324,4337] [2022-04-28 03:10:24,862 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.v+nlh-reducer.c[4820,4833] [2022-04-28 03:10:24,863 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.v+nlh-reducer.c[5221,5234] [2022-04-28 03:10:24,864 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.v+nlh-reducer.c[5439,5452] [2022-04-28 03:10:24,866 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.v+nlh-reducer.c[5881,5894] [2022-04-28 03:10:24,866 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.v+nlh-reducer.c[6099,6112] [2022-04-28 03:10:24,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:10:24,875 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:10:24,886 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.v+nlh-reducer.c[1123,1136] [2022-04-28 03:10:24,887 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.v+nlh-reducer.c[1338,1351] [2022-04-28 03:10:24,889 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.v+nlh-reducer.c[1654,1667] [2022-04-28 03:10:24,890 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.v+nlh-reducer.c[1869,1882] [2022-04-28 03:10:24,892 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.v+nlh-reducer.c[2402,2415] [2022-04-28 03:10:24,893 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.v+nlh-reducer.c[2617,2630] [2022-04-28 03:10:24,894 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.v+nlh-reducer.c[2919,2932] [2022-04-28 03:10:24,895 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.v+nlh-reducer.c[3134,3147] [2022-04-28 03:10:24,896 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.v+nlh-reducer.c[3404,3417] [2022-04-28 03:10:24,898 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.v+nlh-reducer.c[3622,3635] [2022-04-28 03:10:24,899 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.v+nlh-reducer.c[4106,4119] [2022-04-28 03:10:24,900 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.v+nlh-reducer.c[4324,4337] [2022-04-28 03:10:24,902 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.v+nlh-reducer.c[4820,4833] [2022-04-28 03:10:24,903 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.v+nlh-reducer.c[5221,5234] [2022-04-28 03:10:24,904 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.v+nlh-reducer.c[5439,5452] [2022-04-28 03:10:24,906 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.v+nlh-reducer.c[5881,5894] [2022-04-28 03:10:24,906 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.v+nlh-reducer.c[6099,6112] [2022-04-28 03:10:24,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:10:24,918 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:10:24,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:24 WrapperNode [2022-04-28 03:10:24,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:10:24,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:10:24,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:10:24,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:10:24,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:24" (1/1) ... [2022-04-28 03:10:24,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:24" (1/1) ... [2022-04-28 03:10:24,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:24" (1/1) ... [2022-04-28 03:10:24,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:24" (1/1) ... [2022-04-28 03:10:24,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:24" (1/1) ... [2022-04-28 03:10:24,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:24" (1/1) ... [2022-04-28 03:10:24,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:24" (1/1) ... [2022-04-28 03:10:24,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:10:24,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:10:24,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:10:24,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:10:24,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:24" (1/1) ... [2022-04-28 03:10:24,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:10:24,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:10:25,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 03:10:25,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 03:10:25,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:10:25,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:10:25,037 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:10:25,037 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:10:25,037 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:10:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:10:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:10:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:10:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:10:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:10:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:10:25,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:10:25,038 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:10:25,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:10:25,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:10:25,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:10:25,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:10:25,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:10:25,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:10:25,107 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:10:25,108 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:10:25,342 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:10:25,347 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:10:25,347 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-28 03:10:25,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:10:25 BoogieIcfgContainer [2022-04-28 03:10:25,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:10:25,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:10:25,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:10:25,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:10:25,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:10:24" (1/3) ... [2022-04-28 03:10:25,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7e0271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:10:25, skipping insertion in model container [2022-04-28 03:10:25,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:10:24" (2/3) ... [2022-04-28 03:10:25,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7e0271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:10:25, skipping insertion in model container [2022-04-28 03:10:25,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:10:25" (3/3) ... [2022-04-28 03:10:25,354 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2022-04-28 03:10:25,363 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:10:25,363 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-04-28 03:10:25,390 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:10:25,394 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2b97d942, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e67e346 [2022-04-28 03:10:25,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-04-28 03:10:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 71 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:10:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:10:25,404 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:25,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:25,405 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:25,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:25,408 INFO L85 PathProgramCache]: Analyzing trace with hash -388107236, now seen corresponding path program 1 times [2022-04-28 03:10:25,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:25,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1788390419] [2022-04-28 03:10:25,422 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:25,422 INFO L85 PathProgramCache]: Analyzing trace with hash -388107236, now seen corresponding path program 2 times [2022-04-28 03:10:25,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:25,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780466002] [2022-04-28 03:10:25,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:25,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:25,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:25,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {86#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {79#true} is VALID [2022-04-28 03:10:25,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {79#true} assume true; {79#true} is VALID [2022-04-28 03:10:25,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79#true} {79#true} #181#return; {79#true} is VALID [2022-04-28 03:10:25,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {79#true} call ULTIMATE.init(); {86#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:25,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {86#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {79#true} is VALID [2022-04-28 03:10:25,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {79#true} assume true; {79#true} is VALID [2022-04-28 03:10:25,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79#true} {79#true} #181#return; {79#true} is VALID [2022-04-28 03:10:25,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {79#true} call #t~ret10 := main(); {79#true} is VALID [2022-04-28 03:10:25,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {79#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {79#true} is VALID [2022-04-28 03:10:25,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {79#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {84#(<= 0 main_~main__t~0)} is VALID [2022-04-28 03:10:25,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {84#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {84#(<= 0 main_~main__t~0)} is VALID [2022-04-28 03:10:25,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {84#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {84#(<= 0 main_~main__t~0)} is VALID [2022-04-28 03:10:25,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {84#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {85#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-28 03:10:25,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {85#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {80#false} is VALID [2022-04-28 03:10:25,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {80#false} assume !false; {80#false} is VALID [2022-04-28 03:10:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:25,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:25,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780466002] [2022-04-28 03:10:25,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780466002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:25,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:25,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:10:25,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:25,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1788390419] [2022-04-28 03:10:25,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1788390419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:25,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:25,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:10:25,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424457970] [2022-04-28 03:10:25,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:25,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:10:25,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:25,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:25,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:25,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:10:25,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:25,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:10:25,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:10:25,711 INFO L87 Difference]: Start difference. First operand has 76 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 71 states have internal predecessors, (99), 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.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:26,161 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2022-04-28 03:10:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:10:26,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:10:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-04-28 03:10:26,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-04-28 03:10:26,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 113 transitions. [2022-04-28 03:10:26,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:26,272 INFO L225 Difference]: With dead ends: 87 [2022-04-28 03:10:26,272 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 03:10:26,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:10:26,276 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 126 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:26,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 89 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 03:10:26,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-28 03:10:26,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:26,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:26,363 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:26,363 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:26,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:26,367 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-28 03:10:26,367 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-28 03:10:26,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:26,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:26,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-28 03:10:26,369 INFO L87 Difference]: Start difference. First operand has 69 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-28 03:10:26,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:26,384 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-28 03:10:26,384 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-28 03:10:26,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:26,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:26,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:26,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.4) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-04-28 03:10:26,389 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2022-04-28 03:10:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:26,389 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-04-28 03:10:26,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:26,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 73 transitions. [2022-04-28 03:10:26,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:26,443 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-28 03:10:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:10:26,443 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:26,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:26,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:10:26,444 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:26,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:26,444 INFO L85 PathProgramCache]: Analyzing trace with hash -384872930, now seen corresponding path program 1 times [2022-04-28 03:10:26,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:26,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [449714974] [2022-04-28 03:10:26,448 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash -384872930, now seen corresponding path program 2 times [2022-04-28 03:10:26,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:26,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693637538] [2022-04-28 03:10:26,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:26,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:26,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:26,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {550#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {543#true} is VALID [2022-04-28 03:10:26,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-28 03:10:26,538 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {543#true} {543#true} #181#return; {543#true} is VALID [2022-04-28 03:10:26,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {543#true} call ULTIMATE.init(); {550#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:26,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {543#true} is VALID [2022-04-28 03:10:26,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-28 03:10:26,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {543#true} {543#true} #181#return; {543#true} is VALID [2022-04-28 03:10:26,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {543#true} call #t~ret10 := main(); {543#true} is VALID [2022-04-28 03:10:26,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {543#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {543#true} is VALID [2022-04-28 03:10:26,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {543#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {548#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-28 03:10:26,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {548#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {548#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-28 03:10:26,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {548#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {548#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-28 03:10:26,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {548#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {549#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-28 03:10:26,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {549#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {544#false} is VALID [2022-04-28 03:10:26,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#false} assume !false; {544#false} is VALID [2022-04-28 03:10:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:26,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:26,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693637538] [2022-04-28 03:10:26,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693637538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:26,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:26,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:10:26,543 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:26,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [449714974] [2022-04-28 03:10:26,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [449714974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:26,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:26,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:10:26,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547424571] [2022-04-28 03:10:26,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:26,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:10:26,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:26,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:26,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:26,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:10:26,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:26,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:10:26,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:10:26,555 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:26,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:26,960 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-04-28 03:10:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:10:26,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:10:26,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:26,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-04-28 03:10:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-04-28 03:10:26,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 117 transitions. [2022-04-28 03:10:27,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:27,046 INFO L225 Difference]: With dead ends: 111 [2022-04-28 03:10:27,046 INFO L226 Difference]: Without dead ends: 109 [2022-04-28 03:10:27,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:10:27,047 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 70 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:27,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 218 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:27,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-28 03:10:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 67. [2022-04-28 03:10:27,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:27,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:27,091 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:27,091 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:27,095 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-04-28 03:10:27,095 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2022-04-28 03:10:27,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:27,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:27,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-28 03:10:27,097 INFO L87 Difference]: Start difference. First operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-28 03:10:27,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:27,099 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-04-28 03:10:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2022-04-28 03:10:27,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:27,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:27,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:27,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-04-28 03:10:27,108 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2022-04-28 03:10:27,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:27,110 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-04-28 03:10:27,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:27,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 71 transitions. [2022-04-28 03:10:27,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:27,169 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-28 03:10:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:10:27,170 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:27,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:27,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:10:27,171 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:27,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:27,172 INFO L85 PathProgramCache]: Analyzing trace with hash 853580642, now seen corresponding path program 1 times [2022-04-28 03:10:27,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:27,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [8815961] [2022-04-28 03:10:27,173 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:27,173 INFO L85 PathProgramCache]: Analyzing trace with hash 853580642, now seen corresponding path program 2 times [2022-04-28 03:10:27,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:27,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031529103] [2022-04-28 03:10:27,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:27,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:27,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:27,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {1140#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1133#true} is VALID [2022-04-28 03:10:27,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {1133#true} assume true; {1133#true} is VALID [2022-04-28 03:10:27,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1133#true} {1133#true} #181#return; {1133#true} is VALID [2022-04-28 03:10:27,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {1133#true} call ULTIMATE.init(); {1140#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:27,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {1140#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1133#true} is VALID [2022-04-28 03:10:27,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {1133#true} assume true; {1133#true} is VALID [2022-04-28 03:10:27,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1133#true} {1133#true} #181#return; {1133#true} is VALID [2022-04-28 03:10:27,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {1133#true} call #t~ret10 := main(); {1133#true} is VALID [2022-04-28 03:10:27,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {1133#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {1133#true} is VALID [2022-04-28 03:10:27,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {1133#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1138#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-28 03:10:27,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {1138#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {1138#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-28 03:10:27,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {1138#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {1138#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-28 03:10:27,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {1138#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1138#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-28 03:10:27,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {1138#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1139#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-28 03:10:27,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {1139#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {1134#false} is VALID [2022-04-28 03:10:27,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {1134#false} assume !false; {1134#false} is VALID [2022-04-28 03:10:27,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:27,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:27,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031529103] [2022-04-28 03:10:27,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031529103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:27,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:27,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:10:27,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:27,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [8815961] [2022-04-28 03:10:27,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [8815961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:27,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:27,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:10:27,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551359147] [2022-04-28 03:10:27,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:27,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:10:27,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:27,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:27,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:27,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:10:27,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:27,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:10:27,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:10:27,271 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:27,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:27,512 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-28 03:10:27,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:10:27,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:10:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-28 03:10:27,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-28 03:10:27,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2022-04-28 03:10:27,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:27,565 INFO L225 Difference]: With dead ends: 73 [2022-04-28 03:10:27,565 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 03:10:27,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:10:27,566 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:27,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 128 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:27,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 03:10:27,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-04-28 03:10:27,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:27,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:27,608 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:27,608 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:27,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:27,610 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-28 03:10:27,610 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-28 03:10:27,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:27,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:27,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 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) Second operand 71 states. [2022-04-28 03:10:27,611 INFO L87 Difference]: Start difference. First operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 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) Second operand 71 states. [2022-04-28 03:10:27,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:27,612 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-28 03:10:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-28 03:10:27,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:27,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:27,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:27,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 66 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-04-28 03:10:27,614 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2022-04-28 03:10:27,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:27,615 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-04-28 03:10:27,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:27,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 74 transitions. [2022-04-28 03:10:27,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-04-28 03:10:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:10:27,681 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:27,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:27,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:10:27,681 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:27,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:27,682 INFO L85 PathProgramCache]: Analyzing trace with hash -47660122, now seen corresponding path program 1 times [2022-04-28 03:10:27,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:27,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1097562993] [2022-04-28 03:10:27,698 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:27,698 INFO L85 PathProgramCache]: Analyzing trace with hash -47660122, now seen corresponding path program 2 times [2022-04-28 03:10:27,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:27,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552931825] [2022-04-28 03:10:27,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:27,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:27,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:27,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {1583#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1575#true} is VALID [2022-04-28 03:10:27,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {1575#true} assume true; {1575#true} is VALID [2022-04-28 03:10:27,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1575#true} {1575#true} #181#return; {1575#true} is VALID [2022-04-28 03:10:27,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {1575#true} call ULTIMATE.init(); {1583#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:27,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {1583#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1575#true} is VALID [2022-04-28 03:10:27,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {1575#true} assume true; {1575#true} is VALID [2022-04-28 03:10:27,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1575#true} {1575#true} #181#return; {1575#true} is VALID [2022-04-28 03:10:27,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {1575#true} call #t~ret10 := main(); {1575#true} is VALID [2022-04-28 03:10:27,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {1575#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {1575#true} is VALID [2022-04-28 03:10:27,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {1575#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1580#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:27,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {1580#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {1580#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:27,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {1580#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {1580#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:27,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {1580#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1580#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:27,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1580#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:27,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {1580#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {1581#(<= 1 main_~main__t~0)} is VALID [2022-04-28 03:10:27,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {1581#(<= 1 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1582#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-28 03:10:27,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {1582#(not (= main_~__VERIFIER_assert__cond~2 0))} assume 0 == ~__VERIFIER_assert__cond~2; {1576#false} is VALID [2022-04-28 03:10:27,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {1576#false} assume !false; {1576#false} is VALID [2022-04-28 03:10:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:27,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:27,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552931825] [2022-04-28 03:10:27,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552931825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:27,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:27,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:10:27,778 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:27,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1097562993] [2022-04-28 03:10:27,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1097562993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:27,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:27,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:10:27,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394740600] [2022-04-28 03:10:27,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:27,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:10:27,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:27,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:27,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:27,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:10:27,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:27,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:10:27,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:10:27,790 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:28,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:28,103 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-28 03:10:28,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:10:28,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:10:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:28,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-28 03:10:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-28 03:10:28,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2022-04-28 03:10:28,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:28,158 INFO L225 Difference]: With dead ends: 71 [2022-04-28 03:10:28,158 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 03:10:28,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:10:28,159 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 64 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:28,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 126 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:28,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 03:10:28,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-28 03:10:28,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:28,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:28,227 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:28,227 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:28,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:28,229 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-28 03:10:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-28 03:10:28,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:28,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:28,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 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) Second operand 69 states. [2022-04-28 03:10:28,230 INFO L87 Difference]: Start difference. First operand has 68 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 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) Second operand 69 states. [2022-04-28 03:10:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:28,231 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-28 03:10:28,231 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-28 03:10:28,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:28,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:28,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:28,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:28,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:28,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-28 03:10:28,233 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2022-04-28 03:10:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:28,233 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-28 03:10:28,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:28,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2022-04-28 03:10:28,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:28,293 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-28 03:10:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:10:28,293 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:28,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:28,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 03:10:28,294 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:28,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:28,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1816251534, now seen corresponding path program 1 times [2022-04-28 03:10:28,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:28,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [326734450] [2022-04-28 03:10:28,295 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:28,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1816251534, now seen corresponding path program 2 times [2022-04-28 03:10:28,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:28,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634807607] [2022-04-28 03:10:28,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:28,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:28,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:28,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {2014#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2006#true} is VALID [2022-04-28 03:10:28,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-28 03:10:28,357 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2006#true} {2006#true} #181#return; {2006#true} is VALID [2022-04-28 03:10:28,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {2006#true} call ULTIMATE.init(); {2014#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:28,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {2014#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2006#true} is VALID [2022-04-28 03:10:28,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {2006#true} assume true; {2006#true} is VALID [2022-04-28 03:10:28,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2006#true} {2006#true} #181#return; {2006#true} is VALID [2022-04-28 03:10:28,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {2006#true} call #t~ret10 := main(); {2006#true} is VALID [2022-04-28 03:10:28,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {2006#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {2006#true} is VALID [2022-04-28 03:10:28,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {2006#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2011#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:28,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {2011#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {2011#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:28,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {2011#(= main_~main__t~0 0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {2011#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:28,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {2011#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {2011#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:28,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {2011#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {2011#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:28,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {2011#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {2012#(<= 1 main_~main__t~0)} is VALID [2022-04-28 03:10:28,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {2012#(<= 1 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {2013#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-28 03:10:28,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {2013#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {2007#false} is VALID [2022-04-28 03:10:28,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {2007#false} assume !false; {2007#false} is VALID [2022-04-28 03:10:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:28,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:28,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634807607] [2022-04-28 03:10:28,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634807607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:28,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:28,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:10:28,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:28,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [326734450] [2022-04-28 03:10:28,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [326734450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:28,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:28,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:10:28,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361698140] [2022-04-28 03:10:28,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:28,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:10:28,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:28,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:28,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:28,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:10:28,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:28,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:10:28,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:10:28,380 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:28,722 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-28 03:10:28,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:10:28,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:10:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:28,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-28 03:10:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-28 03:10:28,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2022-04-28 03:10:28,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:28,776 INFO L225 Difference]: With dead ends: 69 [2022-04-28 03:10:28,776 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 03:10:28,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:10:28,777 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 62 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:28,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 120 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 03:10:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-28 03:10:28,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:28,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 66 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:28,838 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 66 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:28,838 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 66 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:28,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:28,840 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-28 03:10:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-28 03:10:28,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:28,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:28,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 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) Second operand 67 states. [2022-04-28 03:10:28,841 INFO L87 Difference]: Start difference. First operand has 66 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 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) Second operand 67 states. [2022-04-28 03:10:28,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:28,843 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-28 03:10:28,843 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-28 03:10:28,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:28,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:28,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:28,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-04-28 03:10:28,845 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2022-04-28 03:10:28,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:28,845 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-04-28 03:10:28,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:28,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 70 transitions. [2022-04-28 03:10:28,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:28,911 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-28 03:10:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:10:28,912 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:28,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:28,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 03:10:28,912 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:28,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:28,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1477460696, now seen corresponding path program 1 times [2022-04-28 03:10:28,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:28,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1829126400] [2022-04-28 03:10:28,913 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:28,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1477460696, now seen corresponding path program 2 times [2022-04-28 03:10:28,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:28,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980389949] [2022-04-28 03:10:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:28,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:28,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:28,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {2432#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2425#true} is VALID [2022-04-28 03:10:28,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-28 03:10:28,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2425#true} {2425#true} #181#return; {2425#true} is VALID [2022-04-28 03:10:28,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {2425#true} call ULTIMATE.init(); {2432#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:28,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {2432#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2425#true} is VALID [2022-04-28 03:10:28,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {2425#true} assume true; {2425#true} is VALID [2022-04-28 03:10:28,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2425#true} {2425#true} #181#return; {2425#true} is VALID [2022-04-28 03:10:28,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {2425#true} call #t~ret10 := main(); {2425#true} is VALID [2022-04-28 03:10:28,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {2425#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {2425#true} is VALID [2022-04-28 03:10:28,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {2425#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2425#true} is VALID [2022-04-28 03:10:28,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {2425#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {2425#true} is VALID [2022-04-28 03:10:28,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {2425#true} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {2425#true} is VALID [2022-04-28 03:10:28,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {2425#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2425#true} is VALID [2022-04-28 03:10:28,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {2425#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2425#true} is VALID [2022-04-28 03:10:28,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {2425#true} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {2425#true} is VALID [2022-04-28 03:10:28,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {2425#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2430#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:28,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {2430#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2431#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-28 03:10:28,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {2431#(not (= main_~__VERIFIER_assert__cond~3 0))} assume 0 == ~__VERIFIER_assert__cond~3; {2426#false} is VALID [2022-04-28 03:10:28,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {2426#false} assume !false; {2426#false} is VALID [2022-04-28 03:10:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:28,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:28,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980389949] [2022-04-28 03:10:28,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980389949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:28,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:28,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:10:28,995 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:28,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1829126400] [2022-04-28 03:10:28,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1829126400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:28,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:28,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:10:28,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845118507] [2022-04-28 03:10:28,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:28,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:10:28,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:28,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:29,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:29,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:10:29,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:29,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:10:29,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:10:29,007 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:29,249 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-28 03:10:29,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:10:29,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:10:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-28 03:10:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-28 03:10:29,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-28 03:10:29,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:29,294 INFO L225 Difference]: With dead ends: 67 [2022-04-28 03:10:29,294 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 03:10:29,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:10:29,295 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 21 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:29,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 137 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:29,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 03:10:29,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-28 03:10:29,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:29,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:29,363 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:29,363 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:29,365 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-28 03:10:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-28 03:10:29,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:29,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:29,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 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) Second operand 63 states. [2022-04-28 03:10:29,365 INFO L87 Difference]: Start difference. First operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 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) Second operand 63 states. [2022-04-28 03:10:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:29,366 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-28 03:10:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-28 03:10:29,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:29,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:29,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:29,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-04-28 03:10:29,368 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 16 [2022-04-28 03:10:29,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:29,368 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-04-28 03:10:29,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:29,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 66 transitions. [2022-04-28 03:10:29,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-28 03:10:29,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:10:29,418 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:29,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:29,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 03:10:29,418 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:29,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:29,419 INFO L85 PathProgramCache]: Analyzing trace with hash 469655877, now seen corresponding path program 1 times [2022-04-28 03:10:29,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:29,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [353296064] [2022-04-28 03:10:29,419 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:29,419 INFO L85 PathProgramCache]: Analyzing trace with hash 469655877, now seen corresponding path program 2 times [2022-04-28 03:10:29,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:29,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65723416] [2022-04-28 03:10:29,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:29,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:29,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:29,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {2832#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2824#true} is VALID [2022-04-28 03:10:29,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {2824#true} assume true; {2824#true} is VALID [2022-04-28 03:10:29,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2824#true} {2824#true} #181#return; {2824#true} is VALID [2022-04-28 03:10:29,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {2824#true} call ULTIMATE.init(); {2832#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:29,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {2832#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2824#true} is VALID [2022-04-28 03:10:29,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {2824#true} assume true; {2824#true} is VALID [2022-04-28 03:10:29,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2824#true} {2824#true} #181#return; {2824#true} is VALID [2022-04-28 03:10:29,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {2824#true} call #t~ret10 := main(); {2824#true} is VALID [2022-04-28 03:10:29,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {2824#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {2824#true} is VALID [2022-04-28 03:10:29,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {2824#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2829#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:29,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {2829#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {2829#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:29,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {2829#(= main_~main__t~0 0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {2829#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:29,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {2829#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {2829#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:29,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {2829#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {2829#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:29,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {2829#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {2830#(<= 1 main_~main__t~0)} is VALID [2022-04-28 03:10:29,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {2830#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {2830#(<= 1 main_~main__t~0)} is VALID [2022-04-28 03:10:29,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {2830#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {2831#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-28 03:10:29,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {2831#(not (= main_~__VERIFIER_assert__cond~16 0))} assume 0 == ~__VERIFIER_assert__cond~16; {2825#false} is VALID [2022-04-28 03:10:29,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {2825#false} assume !false; {2825#false} is VALID [2022-04-28 03:10:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:29,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:29,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65723416] [2022-04-28 03:10:29,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65723416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:29,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:29,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:10:29,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:29,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [353296064] [2022-04-28 03:10:29,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [353296064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:29,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:29,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:10:29,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302282885] [2022-04-28 03:10:29,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:29,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:10:29,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:29,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:29,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:29,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:10:29,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:29,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:10:29,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:10:29,483 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:29,931 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2022-04-28 03:10:29,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:10:29,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:10:29,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-28 03:10:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-28 03:10:29,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 111 transitions. [2022-04-28 03:10:30,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:30,005 INFO L225 Difference]: With dead ends: 104 [2022-04-28 03:10:30,005 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 03:10:30,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:10:30,006 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 96 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:30,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 157 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:30,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 03:10:30,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 60. [2022-04-28 03:10:30,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:30,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 60 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:30,070 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 60 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:30,070 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 60 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:30,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:30,072 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-04-28 03:10:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-04-28 03:10:30,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:30,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:30,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-28 03:10:30,073 INFO L87 Difference]: Start difference. First operand has 60 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-28 03:10:30,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:30,074 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-04-28 03:10:30,075 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-04-28 03:10:30,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:30,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:30,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:30,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:30,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-04-28 03:10:30,076 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2022-04-28 03:10:30,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:30,076 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-04-28 03:10:30,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:30,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 64 transitions. [2022-04-28 03:10:30,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:30,127 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-28 03:10:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:10:30,127 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:30,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:30,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 03:10:30,128 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:30,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:30,128 INFO L85 PathProgramCache]: Analyzing trace with hash 469225894, now seen corresponding path program 1 times [2022-04-28 03:10:30,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:30,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1700775875] [2022-04-28 03:10:30,128 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:30,128 INFO L85 PathProgramCache]: Analyzing trace with hash 469225894, now seen corresponding path program 2 times [2022-04-28 03:10:30,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:30,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783568463] [2022-04-28 03:10:30,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:30,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:30,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:30,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {3378#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3371#true} is VALID [2022-04-28 03:10:30,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {3371#true} assume true; {3371#true} is VALID [2022-04-28 03:10:30,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3371#true} {3371#true} #181#return; {3371#true} is VALID [2022-04-28 03:10:30,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {3371#true} call ULTIMATE.init(); {3378#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:30,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {3378#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3371#true} is VALID [2022-04-28 03:10:30,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#true} assume true; {3371#true} is VALID [2022-04-28 03:10:30,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3371#true} {3371#true} #181#return; {3371#true} is VALID [2022-04-28 03:10:30,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {3371#true} call #t~ret10 := main(); {3371#true} is VALID [2022-04-28 03:10:30,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {3371#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {3371#true} is VALID [2022-04-28 03:10:30,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {3371#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3371#true} is VALID [2022-04-28 03:10:30,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {3371#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {3371#true} is VALID [2022-04-28 03:10:30,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {3371#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {3371#true} is VALID [2022-04-28 03:10:30,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {3371#true} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {3371#true} is VALID [2022-04-28 03:10:30,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {3371#true} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {3371#true} is VALID [2022-04-28 03:10:30,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {3371#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {3371#true} is VALID [2022-04-28 03:10:30,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {3371#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {3376#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:30,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {3376#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {3377#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-28 03:10:30,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {3377#(not (= main_~__VERIFIER_assert__cond~15 0))} assume 0 == ~__VERIFIER_assert__cond~15; {3372#false} is VALID [2022-04-28 03:10:30,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {3372#false} assume !false; {3372#false} is VALID [2022-04-28 03:10:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:30,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:30,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783568463] [2022-04-28 03:10:30,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783568463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:30,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:30,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:10:30,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:30,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1700775875] [2022-04-28 03:10:30,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1700775875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:30,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:30,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:10:30,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121572260] [2022-04-28 03:10:30,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:30,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:10:30,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:30,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:30,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:30,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:10:30,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:30,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:10:30,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:10:30,216 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:30,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:30,426 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-28 03:10:30,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:10:30,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:10:30,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:30,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-28 03:10:30,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-28 03:10:30,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-04-28 03:10:30,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:30,472 INFO L225 Difference]: With dead ends: 61 [2022-04-28 03:10:30,472 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 03:10:30,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:10:30,473 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 18 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:30,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 125 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:30,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 03:10:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-04-28 03:10:30,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:30,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:30,545 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:30,545 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:30,546 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-28 03:10:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-28 03:10:30,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:30,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:30,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-28 03:10:30,547 INFO L87 Difference]: Start difference. First operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-28 03:10:30,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:30,548 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-28 03:10:30,548 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-28 03:10:30,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:30,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:30,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:30,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-28 03:10:30,549 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2022-04-28 03:10:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:30,549 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-28 03:10:30,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:30,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2022-04-28 03:10:30,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-28 03:10:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:10:30,603 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:30,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:30,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 03:10:30,604 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:30,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:30,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1457581016, now seen corresponding path program 1 times [2022-04-28 03:10:30,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:30,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [306743713] [2022-04-28 03:10:30,604 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:30,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1457581016, now seen corresponding path program 2 times [2022-04-28 03:10:30,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:30,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585008034] [2022-04-28 03:10:30,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:30,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:30,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:30,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {3741#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3733#true} is VALID [2022-04-28 03:10:30,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-28 03:10:30,657 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3733#true} {3733#true} #181#return; {3733#true} is VALID [2022-04-28 03:10:30,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {3733#true} call ULTIMATE.init(); {3741#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:30,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {3741#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3733#true} is VALID [2022-04-28 03:10:30,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-28 03:10:30,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3733#true} {3733#true} #181#return; {3733#true} is VALID [2022-04-28 03:10:30,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {3733#true} call #t~ret10 := main(); {3733#true} is VALID [2022-04-28 03:10:30,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {3733#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {3733#true} is VALID [2022-04-28 03:10:30,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {3733#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3738#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:30,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {3738#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {3738#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:30,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {3738#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {3738#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:30,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {3738#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3738#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:30,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {3738#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3738#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:30,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {3738#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {3739#(<= 1 main_~main__t~0)} is VALID [2022-04-28 03:10:30,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {3739#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {3739#(<= 1 main_~main__t~0)} is VALID [2022-04-28 03:10:30,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {3739#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {3739#(<= 1 main_~main__t~0)} is VALID [2022-04-28 03:10:30,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {3739#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {3740#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-28 03:10:30,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {3740#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {3734#false} is VALID [2022-04-28 03:10:30,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {3734#false} assume !false; {3734#false} is VALID [2022-04-28 03:10:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:30,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:30,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585008034] [2022-04-28 03:10:30,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585008034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:30,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:30,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:10:30,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:30,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [306743713] [2022-04-28 03:10:30,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [306743713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:30,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:30,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:10:30,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928306187] [2022-04-28 03:10:30,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:30,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:10:30,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:30,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:30,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:30,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:10:30,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:30,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:10:30,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:10:30,681 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:31,030 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-04-28 03:10:31,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:10:31,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:10:31,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-28 03:10:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-28 03:10:31,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-28 03:10:31,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:31,095 INFO L225 Difference]: With dead ends: 74 [2022-04-28 03:10:31,095 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 03:10:31,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:10:31,095 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 72 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:31,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 116 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 03:10:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2022-04-28 03:10:31,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:31,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,154 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,154 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:31,155 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-28 03:10:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-28 03:10:31,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:31,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:31,156 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 03:10:31,156 INFO L87 Difference]: Start difference. First operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 03:10:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:31,157 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-28 03:10:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-28 03:10:31,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:31,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:31,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:31,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:31,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-28 03:10:31,159 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2022-04-28 03:10:31,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:31,164 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-28 03:10:31,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 58 transitions. [2022-04-28 03:10:31,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:31,214 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-28 03:10:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:10:31,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:31,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:31,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 03:10:31,214 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:31,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:31,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1459120216, now seen corresponding path program 1 times [2022-04-28 03:10:31,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:31,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1657755045] [2022-04-28 03:10:31,215 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:31,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1459120216, now seen corresponding path program 2 times [2022-04-28 03:10:31,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:31,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141308020] [2022-04-28 03:10:31,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:31,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:31,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:31,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {4156#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4148#true} is VALID [2022-04-28 03:10:31,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 03:10:31,277 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4148#true} {4148#true} #181#return; {4148#true} is VALID [2022-04-28 03:10:31,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {4148#true} call ULTIMATE.init(); {4156#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:31,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {4156#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4148#true} is VALID [2022-04-28 03:10:31,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {4148#true} assume true; {4148#true} is VALID [2022-04-28 03:10:31,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4148#true} {4148#true} #181#return; {4148#true} is VALID [2022-04-28 03:10:31,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {4148#true} call #t~ret10 := main(); {4148#true} is VALID [2022-04-28 03:10:31,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {4148#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {4148#true} is VALID [2022-04-28 03:10:31,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {4148#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4153#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:31,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {4153#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {4153#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:31,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {4153#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {4153#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:31,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {4153#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4153#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:31,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {4153#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4153#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:31,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {4153#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {4154#(<= 1 main_~main__t~0)} is VALID [2022-04-28 03:10:31,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {4154#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {4154#(<= 1 main_~main__t~0)} is VALID [2022-04-28 03:10:31,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {4154#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet8;havoc #t~nondet8; {4154#(<= 1 main_~main__t~0)} is VALID [2022-04-28 03:10:31,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {4154#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4155#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-28 03:10:31,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {4155#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {4149#false} is VALID [2022-04-28 03:10:31,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {4149#false} assume !false; {4149#false} is VALID [2022-04-28 03:10:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:31,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:31,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141308020] [2022-04-28 03:10:31,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141308020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:31,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:31,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:10:31,283 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:31,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1657755045] [2022-04-28 03:10:31,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1657755045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:31,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:31,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:10:31,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534425077] [2022-04-28 03:10:31,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:31,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:10:31,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:31,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:31,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:10:31,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:31,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:10:31,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:10:31,295 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:31,563 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-28 03:10:31,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:10:31,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:10:31,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-28 03:10:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-28 03:10:31,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-28 03:10:31,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:31,629 INFO L225 Difference]: With dead ends: 55 [2022-04-28 03:10:31,629 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 03:10:31,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:10:31,630 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:31,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 90 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:31,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 03:10:31,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-28 03:10:31,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:31,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,678 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,678 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:31,679 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-28 03:10:31,679 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-28 03:10:31,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:31,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:31,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 03:10:31,680 INFO L87 Difference]: Start difference. First operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 03:10:31,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:31,681 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-28 03:10:31,681 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-28 03:10:31,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:31,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:31,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:31,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-28 03:10:31,682 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2022-04-28 03:10:31,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:31,683 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-28 03:10:31,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2022-04-28 03:10:31,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-28 03:10:31,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:10:31,737 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:31,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:31,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 03:10:31,737 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:31,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1674433506, now seen corresponding path program 1 times [2022-04-28 03:10:31,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:31,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [464408602] [2022-04-28 03:10:31,738 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:31,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1674433506, now seen corresponding path program 2 times [2022-04-28 03:10:31,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:31,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493750397] [2022-04-28 03:10:31,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:31,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:31,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:31,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {4492#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4483#true} is VALID [2022-04-28 03:10:31,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {4483#true} assume true; {4483#true} is VALID [2022-04-28 03:10:31,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4483#true} {4483#true} #181#return; {4483#true} is VALID [2022-04-28 03:10:31,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {4483#true} call ULTIMATE.init(); {4492#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:31,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {4492#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4483#true} is VALID [2022-04-28 03:10:31,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {4483#true} assume true; {4483#true} is VALID [2022-04-28 03:10:31,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4483#true} {4483#true} #181#return; {4483#true} is VALID [2022-04-28 03:10:31,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {4483#true} call #t~ret10 := main(); {4483#true} is VALID [2022-04-28 03:10:31,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {4483#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {4483#true} is VALID [2022-04-28 03:10:31,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {4483#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4488#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-28 03:10:31,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {4488#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {4489#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:31,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {4489#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {4489#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:31,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {4489#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {4489#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:31,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {4489#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {4489#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:31,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {4489#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {4490#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:31,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {4490#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {4490#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:31,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {4490#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4490#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:31,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {4490#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {4491#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2022-04-28 03:10:31,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {4491#(not (= main_~__VERIFIER_assert__cond~17 0))} assume 0 == ~__VERIFIER_assert__cond~17; {4484#false} is VALID [2022-04-28 03:10:31,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {4484#false} assume !false; {4484#false} is VALID [2022-04-28 03:10:31,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:31,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:31,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493750397] [2022-04-28 03:10:31,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493750397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:31,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:31,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:31,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:31,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [464408602] [2022-04-28 03:10:31,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [464408602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:31,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:31,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:31,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683780982] [2022-04-28 03:10:31,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:31,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:10:31,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:31,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:31,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:31,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:10:31,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:31,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:10:31,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:10:31,864 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:32,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:32,376 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-04-28 03:10:32,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:10:32,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:10:32,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:32,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-04-28 03:10:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-04-28 03:10:32,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 119 transitions. [2022-04-28 03:10:32,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:32,452 INFO L225 Difference]: With dead ends: 110 [2022-04-28 03:10:32,452 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 03:10:32,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:10:32,452 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 82 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:32,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 203 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 03:10:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 57. [2022-04-28 03:10:32,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:32,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:32,569 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:32,569 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:32,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:32,571 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-04-28 03:10:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-04-28 03:10:32,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:32,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:32,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 108 states. [2022-04-28 03:10:32,572 INFO L87 Difference]: Start difference. First operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 108 states. [2022-04-28 03:10:32,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:32,573 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-04-28 03:10:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-04-28 03:10:32,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:32,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:32,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:32,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:32,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-04-28 03:10:32,575 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 17 [2022-04-28 03:10:32,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:32,575 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-04-28 03:10:32,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:32,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 62 transitions. [2022-04-28 03:10:32,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:32,640 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-28 03:10:32,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:10:32,640 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:32,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:32,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 03:10:32,641 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:32,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:32,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2058260233, now seen corresponding path program 1 times [2022-04-28 03:10:32,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:32,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1496243287] [2022-04-28 03:10:32,642 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:32,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2058260233, now seen corresponding path program 2 times [2022-04-28 03:10:32,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:32,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929905198] [2022-04-28 03:10:32,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:32,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:32,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:32,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {5059#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5051#true} is VALID [2022-04-28 03:10:32,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {5051#true} assume true; {5051#true} is VALID [2022-04-28 03:10:32,694 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5051#true} {5051#true} #181#return; {5051#true} is VALID [2022-04-28 03:10:32,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {5051#true} call ULTIMATE.init(); {5059#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:32,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {5059#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5051#true} is VALID [2022-04-28 03:10:32,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {5051#true} assume true; {5051#true} is VALID [2022-04-28 03:10:32,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5051#true} {5051#true} #181#return; {5051#true} is VALID [2022-04-28 03:10:32,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {5051#true} call #t~ret10 := main(); {5051#true} is VALID [2022-04-28 03:10:32,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {5051#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {5051#true} is VALID [2022-04-28 03:10:32,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {5051#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5056#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:32,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {5056#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {5056#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:32,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {5056#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {5056#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:32,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {5056#(= main_~main__t~0 0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5056#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:32,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {5056#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5056#(= main_~main__t~0 0)} is VALID [2022-04-28 03:10:32,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {5056#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5057#(<= 1 main_~main__t~0)} is VALID [2022-04-28 03:10:32,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {5057#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {5057#(<= 1 main_~main__t~0)} is VALID [2022-04-28 03:10:32,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {5057#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {5057#(<= 1 main_~main__t~0)} is VALID [2022-04-28 03:10:32,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {5057#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_4~0); {5057#(<= 1 main_~main__t~0)} is VALID [2022-04-28 03:10:32,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {5057#(<= 1 main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5058#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-28 03:10:32,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {5058#(not (= main_~__VERIFIER_assert__cond~8 0))} assume 0 == ~__VERIFIER_assert__cond~8; {5052#false} is VALID [2022-04-28 03:10:32,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {5052#false} assume !false; {5052#false} is VALID [2022-04-28 03:10:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:32,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:32,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929905198] [2022-04-28 03:10:32,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929905198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:32,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:32,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:10:32,700 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:32,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1496243287] [2022-04-28 03:10:32,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1496243287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:32,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:32,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:10:32,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042661282] [2022-04-28 03:10:32,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:32,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:10:32,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:32,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:32,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:32,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:10:32,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:32,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:10:32,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:10:32,712 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:33,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:33,083 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-04-28 03:10:33,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:10:33,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:10:33,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-28 03:10:33,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-28 03:10:33,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-28 03:10:33,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:33,142 INFO L225 Difference]: With dead ends: 77 [2022-04-28 03:10:33,142 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 03:10:33,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:10:33,143 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 63 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:33,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 108 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:33,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 03:10:33,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2022-04-28 03:10:33,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:33,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:33,225 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:33,226 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:33,227 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-28 03:10:33,227 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-04-28 03:10:33,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:33,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:33,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-28 03:10:33,227 INFO L87 Difference]: Start difference. First operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-28 03:10:33,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:33,228 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-04-28 03:10:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-04-28 03:10:33,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:33,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:33,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:33,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 51 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-04-28 03:10:33,229 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 18 [2022-04-28 03:10:33,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:33,229 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-04-28 03:10:33,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:33,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 60 transitions. [2022-04-28 03:10:33,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:33,297 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-04-28 03:10:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:10:33,297 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:33,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:33,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 03:10:33,297 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:33,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2059625653, now seen corresponding path program 1 times [2022-04-28 03:10:33,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:33,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2118846743] [2022-04-28 03:10:33,298 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2059625653, now seen corresponding path program 2 times [2022-04-28 03:10:33,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:33,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839968126] [2022-04-28 03:10:33,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:33,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:33,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:33,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {5489#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5480#true} is VALID [2022-04-28 03:10:33,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 03:10:33,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5480#true} {5480#true} #181#return; {5480#true} is VALID [2022-04-28 03:10:33,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {5480#true} call ULTIMATE.init(); {5489#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:33,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {5489#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5480#true} is VALID [2022-04-28 03:10:33,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {5480#true} assume true; {5480#true} is VALID [2022-04-28 03:10:33,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5480#true} {5480#true} #181#return; {5480#true} is VALID [2022-04-28 03:10:33,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {5480#true} call #t~ret10 := main(); {5480#true} is VALID [2022-04-28 03:10:33,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {5480#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {5480#true} is VALID [2022-04-28 03:10:33,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {5480#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5485#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-28 03:10:33,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {5485#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {5486#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:33,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {5486#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {5486#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:33,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {5486#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5486#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:33,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {5486#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5486#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:33,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {5486#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5487#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:33,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {5487#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {5487#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:33,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {5487#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {5487#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:33,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {5487#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5487#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:33,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {5487#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {5488#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-28 03:10:33,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {5488#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {5481#false} is VALID [2022-04-28 03:10:33,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {5481#false} assume !false; {5481#false} is VALID [2022-04-28 03:10:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:33,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:33,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839968126] [2022-04-28 03:10:33,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839968126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:33,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:33,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:33,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:33,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2118846743] [2022-04-28 03:10:33,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2118846743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:33,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:33,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:33,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561335665] [2022-04-28 03:10:33,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:33,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:10:33,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:33,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:33,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:33,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:10:33,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:33,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:10:33,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:10:33,397 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:33,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:33,880 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-04-28 03:10:33,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:10:33,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:10:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-28 03:10:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-28 03:10:33,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-28 03:10:33,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:33,950 INFO L225 Difference]: With dead ends: 92 [2022-04-28 03:10:33,950 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 03:10:33,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:10:33,951 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 61 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:33,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 146 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:33,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 03:10:34,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2022-04-28 03:10:34,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:34,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:34,069 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:34,069 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:34,071 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-04-28 03:10:34,071 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-04-28 03:10:34,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:34,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:34,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 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) Second operand 90 states. [2022-04-28 03:10:34,071 INFO L87 Difference]: Start difference. First operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 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) Second operand 90 states. [2022-04-28 03:10:34,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:34,074 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-04-28 03:10:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-04-28 03:10:34,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:34,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:34,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:34,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.28) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-04-28 03:10:34,075 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 18 [2022-04-28 03:10:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:34,076 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-04-28 03:10:34,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:34,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 67 transitions. [2022-04-28 03:10:34,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:34,161 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-04-28 03:10:34,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:10:34,161 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:34,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:34,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 03:10:34,162 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:34,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:34,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2011910403, now seen corresponding path program 1 times [2022-04-28 03:10:34,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:34,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [224985241] [2022-04-28 03:10:34,163 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2011910403, now seen corresponding path program 2 times [2022-04-28 03:10:34,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:34,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296345798] [2022-04-28 03:10:34,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:34,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:34,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:34,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {5991#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5982#true} is VALID [2022-04-28 03:10:34,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {5982#true} assume true; {5982#true} is VALID [2022-04-28 03:10:34,257 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5982#true} {5982#true} #181#return; {5982#true} is VALID [2022-04-28 03:10:34,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {5982#true} call ULTIMATE.init(); {5991#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:34,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {5991#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5982#true} is VALID [2022-04-28 03:10:34,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {5982#true} assume true; {5982#true} is VALID [2022-04-28 03:10:34,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5982#true} {5982#true} #181#return; {5982#true} is VALID [2022-04-28 03:10:34,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {5982#true} call #t~ret10 := main(); {5982#true} is VALID [2022-04-28 03:10:34,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {5982#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {5982#true} is VALID [2022-04-28 03:10:34,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {5982#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5987#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-28 03:10:34,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {5987#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {5988#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:34,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {5988#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {5988#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:34,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {5988#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5988#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:34,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {5988#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5988#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:34,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {5988#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5989#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:34,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {5989#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {5989#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:34,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {5989#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet8;havoc #t~nondet8; {5989#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:34,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {5989#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {5989#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:34,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {5989#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {5990#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-28 03:10:34,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {5990#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {5983#false} is VALID [2022-04-28 03:10:34,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {5983#false} assume !false; {5983#false} is VALID [2022-04-28 03:10:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:34,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:34,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296345798] [2022-04-28 03:10:34,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296345798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:34,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:34,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:34,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:34,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [224985241] [2022-04-28 03:10:34,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [224985241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:34,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:34,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:34,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554353239] [2022-04-28 03:10:34,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:34,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:10:34,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:34,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:34,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:34,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:10:34,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:34,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:10:34,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:10:34,286 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:34,639 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-28 03:10:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:10:34,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:10:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-28 03:10:34,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-28 03:10:34,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2022-04-28 03:10:34,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:34,696 INFO L225 Difference]: With dead ends: 76 [2022-04-28 03:10:34,697 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 03:10:34,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:10:34,697 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 40 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:34,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 111 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:34,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 03:10:34,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2022-04-28 03:10:34,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:34,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:34,785 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:34,785 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:34,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:34,786 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-28 03:10:34,786 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-04-28 03:10:34,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:34,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:34,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 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) Second operand 72 states. [2022-04-28 03:10:34,786 INFO L87 Difference]: Start difference. First operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 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) Second operand 72 states. [2022-04-28 03:10:34,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:34,787 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-28 03:10:34,787 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-04-28 03:10:34,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:34,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:34,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:34,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:34,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-04-28 03:10:34,788 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 18 [2022-04-28 03:10:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:34,788 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-04-28 03:10:34,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:34,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 68 transitions. [2022-04-28 03:10:34,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-28 03:10:34,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:10:34,867 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:34,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:34,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 03:10:34,867 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:34,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:34,868 INFO L85 PathProgramCache]: Analyzing trace with hash 361585193, now seen corresponding path program 1 times [2022-04-28 03:10:34,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:34,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1262960119] [2022-04-28 03:10:34,868 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:34,868 INFO L85 PathProgramCache]: Analyzing trace with hash 361585193, now seen corresponding path program 2 times [2022-04-28 03:10:34,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:34,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137940018] [2022-04-28 03:10:34,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:34,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:34,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:34,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {6427#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6418#true} is VALID [2022-04-28 03:10:34,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {6418#true} assume true; {6418#true} is VALID [2022-04-28 03:10:34,952 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6418#true} {6418#true} #181#return; {6418#true} is VALID [2022-04-28 03:10:34,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {6418#true} call ULTIMATE.init(); {6427#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:34,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {6427#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6418#true} is VALID [2022-04-28 03:10:34,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {6418#true} assume true; {6418#true} is VALID [2022-04-28 03:10:34,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6418#true} {6418#true} #181#return; {6418#true} is VALID [2022-04-28 03:10:34,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {6418#true} call #t~ret10 := main(); {6418#true} is VALID [2022-04-28 03:10:34,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {6418#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {6418#true} is VALID [2022-04-28 03:10:34,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {6418#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6423#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-28 03:10:34,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {6423#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {6424#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:34,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {6424#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {6424#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:34,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {6424#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {6424#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:34,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {6424#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {6424#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:34,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {6424#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {6425#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:34,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {6425#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {6425#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:34,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {6425#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {6425#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:34,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {6425#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6425#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:34,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {6425#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6426#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-28 03:10:34,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {6426#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {6419#false} is VALID [2022-04-28 03:10:34,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {6419#false} assume !false; {6419#false} is VALID [2022-04-28 03:10:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:34,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:34,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137940018] [2022-04-28 03:10:34,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137940018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:34,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:34,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:34,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:34,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1262960119] [2022-04-28 03:10:34,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1262960119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:34,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:34,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:34,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560423890] [2022-04-28 03:10:34,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:34,959 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:10:34,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:34,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:34,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:34,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:10:34,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:34,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:10:34,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:10:34,971 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:35,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:35,308 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-28 03:10:35,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:10:35,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:10:35,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2022-04-28 03:10:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2022-04-28 03:10:35,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 79 transitions. [2022-04-28 03:10:35,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:35,362 INFO L225 Difference]: With dead ends: 72 [2022-04-28 03:10:35,362 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 03:10:35,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:10:35,363 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 70 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:35,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 96 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 03:10:35,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-04-28 03:10:35,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:35,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:35,458 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:35,458 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:35,459 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-28 03:10:35,459 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-28 03:10:35,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:35,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:35,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-28 03:10:35,460 INFO L87 Difference]: Start difference. First operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-28 03:10:35,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:35,460 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-28 03:10:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-28 03:10:35,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:35,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:35,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:35,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-04-28 03:10:35,462 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 18 [2022-04-28 03:10:35,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:35,462 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-04-28 03:10:35,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:35,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 71 transitions. [2022-04-28 03:10:35,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:35,549 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-28 03:10:35,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:10:35,550 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:35,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:35,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 03:10:35,550 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:35,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash 618445355, now seen corresponding path program 1 times [2022-04-28 03:10:35,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:35,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [726665252] [2022-04-28 03:10:35,552 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:35,553 INFO L85 PathProgramCache]: Analyzing trace with hash 618445355, now seen corresponding path program 2 times [2022-04-28 03:10:35,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:35,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468729363] [2022-04-28 03:10:35,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:35,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:35,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:35,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {6859#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6850#true} is VALID [2022-04-28 03:10:35,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {6850#true} assume true; {6850#true} is VALID [2022-04-28 03:10:35,650 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6850#true} {6850#true} #181#return; {6850#true} is VALID [2022-04-28 03:10:35,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {6850#true} call ULTIMATE.init(); {6859#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:35,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {6859#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6850#true} is VALID [2022-04-28 03:10:35,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {6850#true} assume true; {6850#true} is VALID [2022-04-28 03:10:35,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6850#true} {6850#true} #181#return; {6850#true} is VALID [2022-04-28 03:10:35,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {6850#true} call #t~ret10 := main(); {6850#true} is VALID [2022-04-28 03:10:35,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {6850#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {6850#true} is VALID [2022-04-28 03:10:35,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {6850#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6855#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-28 03:10:35,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {6855#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {6856#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:35,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {6856#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {6856#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:35,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {6856#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6856#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:35,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {6856#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6856#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:35,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {6856#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:35,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:35,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:35,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_4~0); {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:35,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} havoc ~__tmp_9~0;~__tmp_9~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-28 03:10:35,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {6857#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {6858#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-28 03:10:35,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {6858#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {6851#false} is VALID [2022-04-28 03:10:35,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {6851#false} assume !false; {6851#false} is VALID [2022-04-28 03:10:35,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:35,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:35,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468729363] [2022-04-28 03:10:35,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468729363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:35,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:35,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:35,659 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:35,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [726665252] [2022-04-28 03:10:35,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [726665252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:35,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:35,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:35,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744933864] [2022-04-28 03:10:35,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:35,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:10:35,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:35,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:35,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:35,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:10:35,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:35,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:10:35,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:10:35,674 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:36,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:36,140 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-04-28 03:10:36,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:10:36,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:10:36,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:36,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-04-28 03:10:36,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-04-28 03:10:36,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 100 transitions. [2022-04-28 03:10:36,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:36,205 INFO L225 Difference]: With dead ends: 91 [2022-04-28 03:10:36,205 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 03:10:36,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:10:36,206 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 49 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:36,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 199 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:36,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 03:10:36,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-04-28 03:10:36,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:36,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:36,302 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:36,303 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:36,304 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-04-28 03:10:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-04-28 03:10:36,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:36,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:36,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 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) Second operand 89 states. [2022-04-28 03:10:36,304 INFO L87 Difference]: Start difference. First operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 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) Second operand 89 states. [2022-04-28 03:10:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:36,305 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-04-28 03:10:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-04-28 03:10:36,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:36,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:36,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:36,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:36,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 63 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:36,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-04-28 03:10:36,306 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 19 [2022-04-28 03:10:36,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:36,307 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-04-28 03:10:36,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:36,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 74 transitions. [2022-04-28 03:10:36,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:36,405 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-28 03:10:36,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:10:36,405 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:36,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:36,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 03:10:36,405 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:36,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:36,405 INFO L85 PathProgramCache]: Analyzing trace with hash 679767566, now seen corresponding path program 1 times [2022-04-28 03:10:36,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:36,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1411596813] [2022-04-28 03:10:36,406 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:36,406 INFO L85 PathProgramCache]: Analyzing trace with hash 679767566, now seen corresponding path program 2 times [2022-04-28 03:10:36,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:36,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953270536] [2022-04-28 03:10:36,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:36,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:36,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:36,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {7369#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {7362#true} is VALID [2022-04-28 03:10:36,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {7362#true} assume true; {7362#true} is VALID [2022-04-28 03:10:36,465 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7362#true} {7362#true} #181#return; {7362#true} is VALID [2022-04-28 03:10:36,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {7362#true} call ULTIMATE.init(); {7369#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:36,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {7369#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {7362#true} is VALID [2022-04-28 03:10:36,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {7362#true} assume true; {7362#true} is VALID [2022-04-28 03:10:36,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7362#true} {7362#true} #181#return; {7362#true} is VALID [2022-04-28 03:10:36,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {7362#true} call #t~ret10 := main(); {7362#true} is VALID [2022-04-28 03:10:36,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {7362#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {7362#true} is VALID [2022-04-28 03:10:36,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {7362#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:36,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:36,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:36,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:36,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:36,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:36,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:36,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:36,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:36,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:36,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {7367#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:36,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {7367#(<= 0 main_~main__tagbuf_len~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7368#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-28 03:10:36,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {7368#(not (= main_~__VERIFIER_assert__cond~6 0))} assume 0 == ~__VERIFIER_assert__cond~6; {7363#false} is VALID [2022-04-28 03:10:36,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {7363#false} assume !false; {7363#false} is VALID [2022-04-28 03:10:36,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:36,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:36,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953270536] [2022-04-28 03:10:36,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953270536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:36,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:36,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:10:36,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:36,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1411596813] [2022-04-28 03:10:36,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1411596813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:36,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:36,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:10:36,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197266610] [2022-04-28 03:10:36,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:36,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:10:36,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:36,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:36,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:36,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:10:36,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:36,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:10:36,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:10:36,485 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:36,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:36,715 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-28 03:10:36,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:10:36,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:10:36,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:36,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-28 03:10:36,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-28 03:10:36,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-28 03:10:36,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:36,752 INFO L225 Difference]: With dead ends: 67 [2022-04-28 03:10:36,752 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 03:10:36,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:10:36,752 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:36,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 74 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:10:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 03:10:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 03:10:36,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:36,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:36,869 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:36,870 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:36,874 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-28 03:10:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-04-28 03:10:36,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:36,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:36,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 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) Second operand 65 states. [2022-04-28 03:10:36,875 INFO L87 Difference]: Start difference. First operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 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) Second operand 65 states. [2022-04-28 03:10:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:36,876 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-28 03:10:36,876 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-04-28 03:10:36,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:36,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:36,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:36,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 61 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-04-28 03:10:36,877 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 20 [2022-04-28 03:10:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:36,877 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-04-28 03:10:36,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:36,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 72 transitions. [2022-04-28 03:10:36,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:36,972 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-04-28 03:10:36,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:10:36,973 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:36,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:36,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 03:10:36,973 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:36,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:36,973 INFO L85 PathProgramCache]: Analyzing trace with hash -402038812, now seen corresponding path program 1 times [2022-04-28 03:10:36,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:36,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [828789496] [2022-04-28 03:10:36,974 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:36,974 INFO L85 PathProgramCache]: Analyzing trace with hash -402038812, now seen corresponding path program 2 times [2022-04-28 03:10:36,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:36,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289734633] [2022-04-28 03:10:36,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:36,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:37,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:37,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {7777#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {7770#true} is VALID [2022-04-28 03:10:37,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {7770#true} assume true; {7770#true} is VALID [2022-04-28 03:10:37,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7770#true} {7770#true} #181#return; {7770#true} is VALID [2022-04-28 03:10:37,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {7770#true} call ULTIMATE.init(); {7777#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:37,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {7777#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {7770#true} is VALID [2022-04-28 03:10:37,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {7770#true} assume true; {7770#true} is VALID [2022-04-28 03:10:37,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7770#true} {7770#true} #181#return; {7770#true} is VALID [2022-04-28 03:10:37,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {7770#true} call #t~ret10 := main(); {7770#true} is VALID [2022-04-28 03:10:37,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {7770#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {7770#true} is VALID [2022-04-28 03:10:37,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {7770#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {7770#true} is VALID [2022-04-28 03:10:37,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {7770#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {7770#true} is VALID [2022-04-28 03:10:37,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {7770#true} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {7770#true} is VALID [2022-04-28 03:10:37,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {7770#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7770#true} is VALID [2022-04-28 03:10:37,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {7770#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7770#true} is VALID [2022-04-28 03:10:37,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {7770#true} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {7770#true} is VALID [2022-04-28 03:10:37,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {7770#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {7770#true} is VALID [2022-04-28 03:10:37,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {7770#true} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {7770#true} is VALID [2022-04-28 03:10:37,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {7770#true} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7770#true} is VALID [2022-04-28 03:10:37,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {7770#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7770#true} is VALID [2022-04-28 03:10:37,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {7770#true} assume !(0 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {7770#true} is VALID [2022-04-28 03:10:37,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {7770#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7775#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:37,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {7775#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7776#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-28 03:10:37,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {7776#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {7771#false} is VALID [2022-04-28 03:10:37,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {7771#false} assume !false; {7771#false} is VALID [2022-04-28 03:10:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:37,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:37,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289734633] [2022-04-28 03:10:37,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289734633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:37,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:37,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:10:37,031 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:37,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [828789496] [2022-04-28 03:10:37,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [828789496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:37,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:37,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:10:37,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63472180] [2022-04-28 03:10:37,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:37,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:10:37,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:37,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:37,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:37,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:10:37,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:37,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:10:37,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:10:37,044 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:37,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:37,269 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-28 03:10:37,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:10:37,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:10:37,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-28 03:10:37,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-28 03:10:37,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-28 03:10:37,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:37,301 INFO L225 Difference]: With dead ends: 65 [2022-04-28 03:10:37,301 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 03:10:37,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:10:37,301 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:37,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 97 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:10:37,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 03:10:37,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 03:10:37,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:37,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:37,411 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:37,411 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:37,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:37,412 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-28 03:10:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-28 03:10:37,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:37,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:37,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 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) Second operand 61 states. [2022-04-28 03:10:37,413 INFO L87 Difference]: Start difference. First operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 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) Second operand 61 states. [2022-04-28 03:10:37,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:37,413 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-28 03:10:37,413 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-28 03:10:37,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:37,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:37,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:37,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 57 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-04-28 03:10:37,415 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 21 [2022-04-28 03:10:37,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:37,415 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-04-28 03:10:37,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:37,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 68 transitions. [2022-04-28 03:10:37,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-28 03:10:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:10:37,499 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:37,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:37,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 03:10:37,499 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:37,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:37,500 INFO L85 PathProgramCache]: Analyzing trace with hash 434938978, now seen corresponding path program 1 times [2022-04-28 03:10:37,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:37,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [491300520] [2022-04-28 03:10:37,500 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:37,500 INFO L85 PathProgramCache]: Analyzing trace with hash 434938978, now seen corresponding path program 2 times [2022-04-28 03:10:37,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:37,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849326584] [2022-04-28 03:10:37,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:37,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:37,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:37,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {8168#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {8159#true} is VALID [2022-04-28 03:10:37,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {8159#true} assume true; {8159#true} is VALID [2022-04-28 03:10:37,583 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8159#true} {8159#true} #181#return; {8159#true} is VALID [2022-04-28 03:10:37,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {8159#true} call ULTIMATE.init(); {8168#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:37,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {8168#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {8159#true} is VALID [2022-04-28 03:10:37,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {8159#true} assume true; {8159#true} is VALID [2022-04-28 03:10:37,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8159#true} {8159#true} #181#return; {8159#true} is VALID [2022-04-28 03:10:37,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {8159#true} call #t~ret10 := main(); {8159#true} is VALID [2022-04-28 03:10:37,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {8159#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {8159#true} is VALID [2022-04-28 03:10:37,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {8159#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {8159#true} is VALID [2022-04-28 03:10:37,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {8159#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {8159#true} is VALID [2022-04-28 03:10:37,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {8159#true} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {8159#true} is VALID [2022-04-28 03:10:37,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {8159#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8159#true} is VALID [2022-04-28 03:10:37,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {8159#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {8159#true} is VALID [2022-04-28 03:10:37,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {8159#true} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8159#true} is VALID [2022-04-28 03:10:37,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {8159#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {8164#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:37,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {8164#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {8164#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:37,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {8164#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {8164#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:37,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {8164#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {8165#(or (and (= main_~__VERIFIER_assert__cond~5 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-28 03:10:37,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {8165#(or (and (= main_~__VERIFIER_assert__cond~5 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8166#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:37,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {8166#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {8166#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:37,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {8166#(<= main_~main__t~0 main_~main__tagbuf_len~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {8166#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:37,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {8166#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {8167#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-28 03:10:37,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {8167#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {8160#false} is VALID [2022-04-28 03:10:37,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {8160#false} assume !false; {8160#false} is VALID [2022-04-28 03:10:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:37,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:37,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849326584] [2022-04-28 03:10:37,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849326584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:37,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:37,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:37,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:37,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [491300520] [2022-04-28 03:10:37,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [491300520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:37,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:37,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:37,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694111185] [2022-04-28 03:10:37,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:37,592 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 03:10:37,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:37,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:37,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:37,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:10:37,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:37,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:10:37,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:10:37,606 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:38,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:38,004 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-04-28 03:10:38,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:10:38,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 03:10:38,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-28 03:10:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-28 03:10:38,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2022-04-28 03:10:38,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:38,058 INFO L225 Difference]: With dead ends: 76 [2022-04-28 03:10:38,058 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 03:10:38,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:10:38,059 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 103 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:38,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 62 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:38,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 03:10:38,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2022-04-28 03:10:38,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:38,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:38,173 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:38,173 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:38,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:38,174 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-04-28 03:10:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-04-28 03:10:38,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:38,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:38,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-28 03:10:38,174 INFO L87 Difference]: Start difference. First operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-28 03:10:38,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:38,175 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-04-28 03:10:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-04-28 03:10:38,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:38,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:38,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:38,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:38,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-04-28 03:10:38,176 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 22 [2022-04-28 03:10:38,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:38,177 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-04-28 03:10:38,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:38,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 63 transitions. [2022-04-28 03:10:38,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-04-28 03:10:38,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:10:38,255 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:38,255 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:38,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 03:10:38,256 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:38,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:38,256 INFO L85 PathProgramCache]: Analyzing trace with hash -178138558, now seen corresponding path program 1 times [2022-04-28 03:10:38,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:38,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [617244631] [2022-04-28 03:10:38,256 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:38,257 INFO L85 PathProgramCache]: Analyzing trace with hash -178138558, now seen corresponding path program 2 times [2022-04-28 03:10:38,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:38,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685029698] [2022-04-28 03:10:38,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:38,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:38,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:38,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {8605#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {8595#true} is VALID [2022-04-28 03:10:38,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {8595#true} assume true; {8595#true} is VALID [2022-04-28 03:10:38,337 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8595#true} {8595#true} #181#return; {8595#true} is VALID [2022-04-28 03:10:38,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {8595#true} call ULTIMATE.init(); {8605#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:38,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {8605#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {8595#true} is VALID [2022-04-28 03:10:38,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {8595#true} assume true; {8595#true} is VALID [2022-04-28 03:10:38,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8595#true} {8595#true} #181#return; {8595#true} is VALID [2022-04-28 03:10:38,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {8595#true} call #t~ret10 := main(); {8595#true} is VALID [2022-04-28 03:10:38,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {8595#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {8595#true} is VALID [2022-04-28 03:10:38,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {8595#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {8595#true} is VALID [2022-04-28 03:10:38,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {8595#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {8595#true} is VALID [2022-04-28 03:10:38,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {8595#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {8595#true} is VALID [2022-04-28 03:10:38,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {8595#true} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {8595#true} is VALID [2022-04-28 03:10:38,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {8595#true} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {8595#true} is VALID [2022-04-28 03:10:38,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {8595#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8595#true} is VALID [2022-04-28 03:10:38,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {8595#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {8600#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:38,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {8600#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {8600#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:38,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {8600#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {8601#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~17 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2022-04-28 03:10:38,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {8601#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~17 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:38,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:38,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:38,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:38,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {8604#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2022-04-28 03:10:38,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {8604#(not (= main_~__VERIFIER_assert__cond~17 0))} assume 0 == ~__VERIFIER_assert__cond~17; {8596#false} is VALID [2022-04-28 03:10:38,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {8596#false} assume !false; {8596#false} is VALID [2022-04-28 03:10:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:38,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:38,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685029698] [2022-04-28 03:10:38,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685029698] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:10:38,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187741367] [2022-04-28 03:10:38,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:10:38,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:10:38,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:10:38,344 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:10:38,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 03:10:38,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:10:38,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:10:38,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:10:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:38,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:10:39,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {8595#true} call ULTIMATE.init(); {8595#true} is VALID [2022-04-28 03:10:39,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {8595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {8595#true} is VALID [2022-04-28 03:10:39,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {8595#true} assume true; {8595#true} is VALID [2022-04-28 03:10:39,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8595#true} {8595#true} #181#return; {8595#true} is VALID [2022-04-28 03:10:39,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {8595#true} call #t~ret10 := main(); {8595#true} is VALID [2022-04-28 03:10:39,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {8595#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {8595#true} is VALID [2022-04-28 03:10:39,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {8595#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {8627#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} is VALID [2022-04-28 03:10:39,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {8627#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {8631#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} is VALID [2022-04-28 03:10:39,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {8631#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {8631#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} is VALID [2022-04-28 03:10:39,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {8631#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {8631#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} is VALID [2022-04-28 03:10:39,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {8631#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {8631#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} is VALID [2022-04-28 03:10:39,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {8631#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8644#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-28 03:10:39,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {8644#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {8648#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-28 03:10:39,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {8648#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {8648#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-28 03:10:39,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {8648#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {8648#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-28 03:10:39,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {8648#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {8648#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-28 03:10:39,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {8648#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8661#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-28 03:10:39,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {8661#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {8661#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-28 03:10:39,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {8661#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {8661#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-28 03:10:39,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {8661#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {8671#(<= 1 main_~__VERIFIER_assert__cond~17)} is VALID [2022-04-28 03:10:39,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {8671#(<= 1 main_~__VERIFIER_assert__cond~17)} assume 0 == ~__VERIFIER_assert__cond~17; {8596#false} is VALID [2022-04-28 03:10:39,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {8596#false} assume !false; {8596#false} is VALID [2022-04-28 03:10:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:39,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:10:39,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {8596#false} assume !false; {8596#false} is VALID [2022-04-28 03:10:39,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {8671#(<= 1 main_~__VERIFIER_assert__cond~17)} assume 0 == ~__VERIFIER_assert__cond~17; {8596#false} is VALID [2022-04-28 03:10:39,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {8671#(<= 1 main_~__VERIFIER_assert__cond~17)} is VALID [2022-04-28 03:10:39,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:39,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:39,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:39,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:39,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:39,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:39,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:39,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:39,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:39,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:39,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:39,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {8602#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:39,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {8595#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {8603#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:39,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {8595#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {8595#true} is VALID [2022-04-28 03:10:39,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {8595#true} call #t~ret10 := main(); {8595#true} is VALID [2022-04-28 03:10:39,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8595#true} {8595#true} #181#return; {8595#true} is VALID [2022-04-28 03:10:39,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {8595#true} assume true; {8595#true} is VALID [2022-04-28 03:10:39,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {8595#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {8595#true} is VALID [2022-04-28 03:10:39,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {8595#true} call ULTIMATE.init(); {8595#true} is VALID [2022-04-28 03:10:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:10:39,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187741367] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:10:39,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:10:39,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-28 03:10:39,313 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:39,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [617244631] [2022-04-28 03:10:39,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [617244631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:39,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:39,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:10:39,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50231452] [2022-04-28 03:10:39,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:39,314 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 03:10:39,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:39,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:39,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:39,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:10:39,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:39,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:10:39,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:10:39,329 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:39,750 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-04-28 03:10:39,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:10:39,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 03:10:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-28 03:10:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:39,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 69 transitions. [2022-04-28 03:10:39,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 69 transitions. [2022-04-28 03:10:39,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:39,808 INFO L225 Difference]: With dead ends: 72 [2022-04-28 03:10:39,808 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 03:10:39,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:10:39,809 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 81 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:39,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 55 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:39,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 03:10:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2022-04-28 03:10:39,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:39,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:39,955 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:39,955 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:39,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:39,956 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2022-04-28 03:10:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-04-28 03:10:39,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:39,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:39,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-28 03:10:39,956 INFO L87 Difference]: Start difference. First operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-28 03:10:39,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:39,957 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2022-04-28 03:10:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-04-28 03:10:39,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:39,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:39,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:39,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:39,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-28 03:10:39,959 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 22 [2022-04-28 03:10:39,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:39,959 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-28 03:10:39,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:39,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 59 transitions. [2022-04-28 03:10:40,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-28 03:10:40,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:10:40,046 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:40,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:40,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 03:10:40,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:10:40,256 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:40,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash -93650716, now seen corresponding path program 1 times [2022-04-28 03:10:40,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:40,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1250555353] [2022-04-28 03:10:40,256 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash -93650716, now seen corresponding path program 2 times [2022-04-28 03:10:40,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:40,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921951619] [2022-04-28 03:10:40,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:40,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:40,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:40,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {9149#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {9140#true} is VALID [2022-04-28 03:10:40,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {9140#true} assume true; {9140#true} is VALID [2022-04-28 03:10:40,332 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9140#true} {9140#true} #181#return; {9140#true} is VALID [2022-04-28 03:10:40,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {9140#true} call ULTIMATE.init(); {9149#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:40,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {9149#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {9140#true} is VALID [2022-04-28 03:10:40,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {9140#true} assume true; {9140#true} is VALID [2022-04-28 03:10:40,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9140#true} {9140#true} #181#return; {9140#true} is VALID [2022-04-28 03:10:40,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {9140#true} call #t~ret10 := main(); {9140#true} is VALID [2022-04-28 03:10:40,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {9140#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {9140#true} is VALID [2022-04-28 03:10:40,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {9140#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {9140#true} is VALID [2022-04-28 03:10:40,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {9140#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {9140#true} is VALID [2022-04-28 03:10:40,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {9140#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9140#true} is VALID [2022-04-28 03:10:40,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {9140#true} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9140#true} is VALID [2022-04-28 03:10:40,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {9140#true} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {9140#true} is VALID [2022-04-28 03:10:40,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {9140#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9140#true} is VALID [2022-04-28 03:10:40,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {9140#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9145#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:40,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {9145#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {9145#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:40,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {9145#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9145#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:40,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {9145#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9146#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~1 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2022-04-28 03:10:40,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {9146#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~1 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9147#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:40,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {9147#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {9147#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:40,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {9147#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {9147#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:40,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {9147#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {9147#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:40,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {9147#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {9148#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-28 03:10:40,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {9148#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {9141#false} is VALID [2022-04-28 03:10:40,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {9141#false} assume !false; {9141#false} is VALID [2022-04-28 03:10:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:40,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:40,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921951619] [2022-04-28 03:10:40,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921951619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:40,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:40,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:40,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:40,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1250555353] [2022-04-28 03:10:40,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1250555353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:40,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:40,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:40,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300067389] [2022-04-28 03:10:40,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:40,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:10:40,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:40,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:40,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:40,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:10:40,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:40,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:10:40,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:10:40,351 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:40,755 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-04-28 03:10:40,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:10:40,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:10:40,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-28 03:10:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-28 03:10:40,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2022-04-28 03:10:40,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:40,793 INFO L225 Difference]: With dead ends: 64 [2022-04-28 03:10:40,793 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 03:10:40,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:10:40,794 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 67 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:40,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 57 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:40,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 03:10:40,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2022-04-28 03:10:40,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:40,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 47 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:40,891 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 47 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:40,891 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 47 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:40,892 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2022-04-28 03:10:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-04-28 03:10:40,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:40,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:40,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 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) Second operand 62 states. [2022-04-28 03:10:40,893 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 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) Second operand 62 states. [2022-04-28 03:10:40,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:40,893 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2022-04-28 03:10:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-04-28 03:10:40,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:40,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:40,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:40,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:40,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-04-28 03:10:40,895 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 23 [2022-04-28 03:10:40,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:40,895 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-04-28 03:10:40,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:40,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 53 transitions. [2022-04-28 03:10:40,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:40,965 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-28 03:10:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:10:40,965 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:40,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:40,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 03:10:40,965 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:40,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:40,966 INFO L85 PathProgramCache]: Analyzing trace with hash -45935466, now seen corresponding path program 1 times [2022-04-28 03:10:40,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:40,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [635645658] [2022-04-28 03:10:40,966 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:40,966 INFO L85 PathProgramCache]: Analyzing trace with hash -45935466, now seen corresponding path program 2 times [2022-04-28 03:10:40,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:40,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163995822] [2022-04-28 03:10:40,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:40,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:41,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:41,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {9518#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {9509#true} is VALID [2022-04-28 03:10:41,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-28 03:10:41,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9509#true} {9509#true} #181#return; {9509#true} is VALID [2022-04-28 03:10:41,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {9509#true} call ULTIMATE.init(); {9518#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:41,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {9518#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {9509#true} is VALID [2022-04-28 03:10:41,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {9509#true} assume true; {9509#true} is VALID [2022-04-28 03:10:41,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9509#true} {9509#true} #181#return; {9509#true} is VALID [2022-04-28 03:10:41,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {9509#true} call #t~ret10 := main(); {9509#true} is VALID [2022-04-28 03:10:41,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {9509#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {9509#true} is VALID [2022-04-28 03:10:41,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {9509#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {9509#true} is VALID [2022-04-28 03:10:41,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {9509#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {9509#true} is VALID [2022-04-28 03:10:41,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {9509#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9509#true} is VALID [2022-04-28 03:10:41,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {9509#true} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9509#true} is VALID [2022-04-28 03:10:41,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {9509#true} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {9509#true} is VALID [2022-04-28 03:10:41,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {9509#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9509#true} is VALID [2022-04-28 03:10:41,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {9509#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9514#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:41,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {9514#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {9514#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:41,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {9514#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9514#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:41,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {9514#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9515#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~1 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2022-04-28 03:10:41,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {9515#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~1 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9516#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:41,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {9516#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {9516#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:41,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {9516#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet8;havoc #t~nondet8; {9516#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:41,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {9516#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_11~0;~__tmp_11~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {9516#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:41,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {9516#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {9517#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-28 03:10:41,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {9517#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {9510#false} is VALID [2022-04-28 03:10:41,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {9510#false} assume !false; {9510#false} is VALID [2022-04-28 03:10:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:41,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:41,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163995822] [2022-04-28 03:10:41,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163995822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:41,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:41,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:41,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:41,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [635645658] [2022-04-28 03:10:41,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [635645658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:41,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:41,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:10:41,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798450241] [2022-04-28 03:10:41,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:41,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:10:41,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:41,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:41,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:41,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:10:41,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:41,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:10:41,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:10:41,060 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:41,344 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-28 03:10:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:10:41,345 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:10:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-28 03:10:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-28 03:10:41,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-28 03:10:41,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:41,371 INFO L225 Difference]: With dead ends: 47 [2022-04-28 03:10:41,371 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 03:10:41,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:10:41,372 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 69 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:41,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 42 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:10:41,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 03:10:41,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 03:10:41,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:41,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:41,421 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:41,421 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:41,421 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 03:10:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 03:10:41,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:41,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:41,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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) Second operand 24 states. [2022-04-28 03:10:41,422 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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) Second operand 24 states. [2022-04-28 03:10:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:41,422 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 03:10:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 03:10:41,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:41,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:41,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:41,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-28 03:10:41,423 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 23 [2022-04-28 03:10:41,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:41,423 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-28 03:10:41,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:41,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-28 03:10:41,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 03:10:41,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:10:41,458 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:41,458 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:41,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 03:10:41,459 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-28 03:10:41,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:41,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1233573943, now seen corresponding path program 1 times [2022-04-28 03:10:41,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:41,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [296776877] [2022-04-28 03:10:41,459 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:10:41,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1233573943, now seen corresponding path program 2 times [2022-04-28 03:10:41,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:41,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061904285] [2022-04-28 03:10:41,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:41,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:41,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:41,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {9730#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {9720#true} is VALID [2022-04-28 03:10:41,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {9720#true} assume true; {9720#true} is VALID [2022-04-28 03:10:41,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9720#true} {9720#true} #181#return; {9720#true} is VALID [2022-04-28 03:10:41,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {9720#true} call ULTIMATE.init(); {9730#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:41,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {9730#(and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {9720#true} is VALID [2022-04-28 03:10:41,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {9720#true} assume true; {9720#true} is VALID [2022-04-28 03:10:41,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9720#true} {9720#true} #181#return; {9720#true} is VALID [2022-04-28 03:10:41,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {9720#true} call #t~ret10 := main(); {9720#true} is VALID [2022-04-28 03:10:41,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {9720#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {9720#true} is VALID [2022-04-28 03:10:41,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {9720#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {9720#true} is VALID [2022-04-28 03:10:41,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {9720#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {9720#true} is VALID [2022-04-28 03:10:41,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {9720#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9720#true} is VALID [2022-04-28 03:10:41,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {9720#true} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9720#true} is VALID [2022-04-28 03:10:41,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {9720#true} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {9720#true} is VALID [2022-04-28 03:10:41,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {9720#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9720#true} is VALID [2022-04-28 03:10:41,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {9720#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9725#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:41,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {9725#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {9725#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:41,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {9725#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {9726#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~17 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} is VALID [2022-04-28 03:10:41,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {9726#(or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (and (= main_~__VERIFIER_assert__cond~17 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))))} assume !(0 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:41,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:41,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:41,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:41,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:41,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9729#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-28 03:10:41,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {9729#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {9721#false} is VALID [2022-04-28 03:10:41,547 INFO L290 TraceCheckUtils]: 22: Hoare triple {9721#false} assume !false; {9721#false} is VALID [2022-04-28 03:10:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:41,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:41,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061904285] [2022-04-28 03:10:41,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061904285] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:10:41,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064987680] [2022-04-28 03:10:41,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:10:41,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:10:41,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:10:41,549 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:10:41,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 03:10:41,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:10:41,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:10:41,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:10:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:41,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:10:42,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {9720#true} call ULTIMATE.init(); {9720#true} is VALID [2022-04-28 03:10:42,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {9720#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {9720#true} is VALID [2022-04-28 03:10:42,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {9720#true} assume true; {9720#true} is VALID [2022-04-28 03:10:42,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9720#true} {9720#true} #181#return; {9720#true} is VALID [2022-04-28 03:10:42,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {9720#true} call #t~ret10 := main(); {9720#true} is VALID [2022-04-28 03:10:42,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {9720#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {9720#true} is VALID [2022-04-28 03:10:42,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {9720#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {9752#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} is VALID [2022-04-28 03:10:42,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {9752#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {9756#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} is VALID [2022-04-28 03:10:42,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {9756#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9756#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} is VALID [2022-04-28 03:10:42,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {9756#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9756#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} is VALID [2022-04-28 03:10:42,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {9756#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {9756#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} is VALID [2022-04-28 03:10:42,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {9756#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9769#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-28 03:10:42,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {9769#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9773#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-28 03:10:42,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {9773#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {9773#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-28 03:10:42,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {9773#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {9773#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-28 03:10:42,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {9773#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {9773#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2022-04-28 03:10:42,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {9773#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9786#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-28 03:10:42,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {9786#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9786#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-28 03:10:42,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {9786#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} assume !(0 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {9786#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-28 03:10:42,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {9786#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9786#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} is VALID [2022-04-28 03:10:42,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {9786#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9799#(<= 1 main_~__VERIFIER_assert__cond~1)} is VALID [2022-04-28 03:10:42,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {9799#(<= 1 main_~__VERIFIER_assert__cond~1)} assume 0 == ~__VERIFIER_assert__cond~1; {9721#false} is VALID [2022-04-28 03:10:42,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {9721#false} assume !false; {9721#false} is VALID [2022-04-28 03:10:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:42,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:10:42,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {9721#false} assume !false; {9721#false} is VALID [2022-04-28 03:10:42,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {9799#(<= 1 main_~__VERIFIER_assert__cond~1)} assume 0 == ~__VERIFIER_assert__cond~1; {9721#false} is VALID [2022-04-28 03:10:42,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9799#(<= 1 main_~__VERIFIER_assert__cond~1)} is VALID [2022-04-28 03:10:42,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_0~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:42,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:42,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:42,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:42,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~17);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~1; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:42,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:42,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:42,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:42,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:42,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:42,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:42,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:42,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {9727#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-28 03:10:42,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {9720#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {9728#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-28 03:10:42,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {9720#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {9720#true} is VALID [2022-04-28 03:10:42,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {9720#true} call #t~ret10 := main(); {9720#true} is VALID [2022-04-28 03:10:42,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9720#true} {9720#true} #181#return; {9720#true} is VALID [2022-04-28 03:10:42,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {9720#true} assume true; {9720#true} is VALID [2022-04-28 03:10:42,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {9720#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {9720#true} is VALID [2022-04-28 03:10:42,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {9720#true} call ULTIMATE.init(); {9720#true} is VALID [2022-04-28 03:10:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:10:42,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064987680] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:10:42,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:10:42,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-28 03:10:42,294 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:42,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [296776877] [2022-04-28 03:10:42,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [296776877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:42,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:42,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:10:42,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033641651] [2022-04-28 03:10:42,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:42,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:10:42,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:42,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:42,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:42,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:10:42,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:42,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:10:42,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:10:42,310 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:42,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:42,426 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 03:10:42,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:10:42,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:10:42,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2022-04-28 03:10:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 21 transitions. [2022-04-28 03:10:42,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 21 transitions. [2022-04-28 03:10:42,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:42,450 INFO L225 Difference]: With dead ends: 24 [2022-04-28 03:10:42,450 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 03:10:42,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:10:42,451 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:42,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:10:42,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 03:10:42,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 03:10:42,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:42,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:10:42,452 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:10:42,452 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:10:42,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:42,452 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:10:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:10:42,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:42,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:42,453 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-28 03:10:42,453 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-28 03:10:42,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:42,453 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:10:42,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:10:42,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:42,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:42,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:42,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 03:10:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 03:10:42,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-04-28 03:10:42,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:42,453 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 03:10:42,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:42,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 03:10:42,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:42,454 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:10:42,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:42,456 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2022-04-28 03:10:42,456 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 17 remaining) [2022-04-28 03:10:42,456 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (14 of 17 remaining) [2022-04-28 03:10:42,456 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (13 of 17 remaining) [2022-04-28 03:10:42,456 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2022-04-28 03:10:42,456 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (11 of 17 remaining) [2022-04-28 03:10:42,456 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (10 of 17 remaining) [2022-04-28 03:10:42,456 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2022-04-28 03:10:42,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (8 of 17 remaining) [2022-04-28 03:10:42,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2022-04-28 03:10:42,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (6 of 17 remaining) [2022-04-28 03:10:42,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (5 of 17 remaining) [2022-04-28 03:10:42,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (4 of 17 remaining) [2022-04-28 03:10:42,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (3 of 17 remaining) [2022-04-28 03:10:42,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2022-04-28 03:10:42,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (1 of 17 remaining) [2022-04-28 03:10:42,457 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (0 of 17 remaining) [2022-04-28 03:10:42,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 03:10:42,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-28 03:10:42,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 03:11:14,674 WARN L232 SmtUtils]: Spent 23.77s on a formula simplification. DAG size of input: 64 DAG size of output: 65 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 03:11:18,030 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-28 03:11:18,031 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-28 03:11:18,031 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-28 03:11:18,031 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-28 03:11:18,031 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-28 03:11:18,031 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-28 03:11:18,031 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-28 03:11:18,031 INFO L895 garLoopResultBuilder]: At program point L225(line 225) the Hoare annotation is: false [2022-04-28 03:11:18,031 INFO L895 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) the Hoare annotation is: false [2022-04-28 03:11:18,031 INFO L895 garLoopResultBuilder]: At program point L349(lines 349 358) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~17 0)) (not (= main_~__VERIFIER_assert__cond~16 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-28 03:11:18,031 INFO L895 garLoopResultBuilder]: At program point L250(lines 102 252) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-28 03:11:18,032 INFO L895 garLoopResultBuilder]: At program point mainEXIT(lines 15 375) the Hoare annotation is: (or (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) (<= 0 main_~main__t~0)) [2022-04-28 03:11:18,032 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: false [2022-04-28 03:11:18,032 INFO L895 garLoopResultBuilder]: At program point L308(lines 308 316) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~15 0))) [2022-04-28 03:11:18,032 INFO L895 garLoopResultBuilder]: At program point L143(line 143) the Hoare annotation is: false [2022-04-28 03:11:18,032 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: false [2022-04-28 03:11:18,032 INFO L895 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) the Hoare annotation is: false [2022-04-28 03:11:18,032 INFO L895 garLoopResultBuilder]: At program point L102(lines 102 252) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-28 03:11:18,032 INFO L895 garLoopResultBuilder]: At program point L325(lines 325 362) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~17 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse1) (and (<= main_~main__t~0 1) .cse0 (< main_~main__t~0 main_~main__tagbuf_len~0) .cse1))) [2022-04-28 03:11:18,032 INFO L895 garLoopResultBuilder]: At program point L127(line 127) the Hoare annotation is: false [2022-04-28 03:11:18,032 INFO L895 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) the Hoare annotation is: false [2022-04-28 03:11:18,032 INFO L895 garLoopResultBuilder]: At program point L20(lines 20 374) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-04-28 03:11:18,032 INFO L895 garLoopResultBuilder]: At program point L177(line 177) the Hoare annotation is: false [2022-04-28 03:11:18,034 INFO L895 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) the Hoare annotation is: false [2022-04-28 03:11:18,034 INFO L895 garLoopResultBuilder]: At program point L235(lines 235 243) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse4 (<= 1 main_~main__t~0))) (or (and .cse0 .cse1 .cse2 .cse3 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse4) (and .cse0 (<= main_~main__t~0 1) .cse1 (< 0 (+ main_~main__tagbuf_len~0 1)) .cse2 .cse3 (not (= main_~main__tagbuf_len~0 0)) .cse4))) [2022-04-28 03:11:18,034 INFO L895 garLoopResultBuilder]: At program point L351(line 351) the Hoare annotation is: false [2022-04-28 03:11:18,034 INFO L895 garLoopResultBuilder]: At program point L153(lines 153 161) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-28 03:11:18,034 INFO L895 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) the Hoare annotation is: false [2022-04-28 03:11:18,034 INFO L895 garLoopResultBuilder]: At program point L54(lines 54 254) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (let ((.cse0 (let ((.cse1 (not (= main_~__VERIFIER_assert__cond~0 0)))) (or (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0) .cse1) (and (<= 0 main_~main__tagbuf_len~0) .cse1 (= main_~main__t~0 0)))))) (or (and (not (= main_~__VERIFIER_assert__cond~17 0)) .cse0) (and (<= main_~main__t~0 1) .cse0)))) [2022-04-28 03:11:18,034 INFO L895 garLoopResultBuilder]: At program point L310(line 310) the Hoare annotation is: false [2022-04-28 03:11:18,034 INFO L895 garLoopResultBuilder]: At program point L277(lines 277 364) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (not (= main_~__VERIFIER_assert__cond~13 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-04-28 03:11:18,034 INFO L895 garLoopResultBuilder]: At program point mainFINAL(lines 15 375) the Hoare annotation is: (or (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) (<= 0 main_~main__t~0)) [2022-04-28 03:11:18,034 INFO L895 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) the Hoare annotation is: false [2022-04-28 03:11:18,035 INFO L895 garLoopResultBuilder]: At program point L71(lines 71 95) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-28 03:11:18,035 INFO L895 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) the Hoare annotation is: false [2022-04-28 03:11:18,035 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 15 375) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-04-28 03:11:18,035 INFO L895 garLoopResultBuilder]: At program point L187(lines 187 197) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-28 03:11:18,035 INFO L895 garLoopResultBuilder]: At program point L113(lines 113 204) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-28 03:11:18,035 INFO L895 garLoopResultBuilder]: At program point L237(line 237) the Hoare annotation is: false [2022-04-28 03:11:18,035 INFO L895 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) the Hoare annotation is: false [2022-04-28 03:11:18,035 INFO L895 garLoopResultBuilder]: At program point L328(lines 32 368) the Hoare annotation is: (or (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0)))) (or (and (<= main_~main__t~0 1) .cse0) (and .cse0 (not (= main_~__VERIFIER_assert__cond~17 0))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) (and (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))) [2022-04-28 03:11:18,036 INFO L895 garLoopResultBuilder]: At program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) the Hoare annotation is: false [2022-04-28 03:11:18,036 INFO L895 garLoopResultBuilder]: At program point L196(lines 60 254) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-28 03:11:18,036 INFO L895 garLoopResultBuilder]: At program point L155(line 155) the Hoare annotation is: false [2022-04-28 03:11:18,036 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: false [2022-04-28 03:11:18,036 INFO L895 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) the Hoare annotation is: false [2022-04-28 03:11:18,036 INFO L895 garLoopResultBuilder]: At program point L279(line 279) the Hoare annotation is: false [2022-04-28 03:11:18,036 INFO L895 garLoopResultBuilder]: At program point L337(lines 337 360) the Hoare annotation is: (and (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~16 0))) (.cse2 (<= 1 main_~main__t~0))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse1 .cse2) (and (<= main_~main__t~0 1) .cse0 .cse1 .cse2))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) [2022-04-28 03:11:18,037 INFO L895 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) the Hoare annotation is: false [2022-04-28 03:11:18,037 INFO L895 garLoopResultBuilder]: At program point L106(lines 106 210) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-28 03:11:18,038 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: false [2022-04-28 03:11:18,038 INFO L895 garLoopResultBuilder]: At program point L296(lines 296 318) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-28 03:11:18,038 INFO L895 garLoopResultBuilder]: At program point L32(lines 32 368) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-04-28 03:11:18,038 INFO L895 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) the Hoare annotation is: false [2022-04-28 03:11:18,038 INFO L895 garLoopResultBuilder]: At program point L189(line 189) the Hoare annotation is: false [2022-04-28 03:11:18,038 INFO L895 garLoopResultBuilder]: At program point L24(lines 24 369) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= main_~main__t~0 0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-28 03:11:18,038 INFO L895 garLoopResultBuilder]: At program point L115(line 115) the Hoare annotation is: false [2022-04-28 03:11:18,038 INFO L895 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) the Hoare annotation is: false [2022-04-28 03:11:18,039 INFO L895 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) the Hoare annotation is: false [2022-04-28 03:11:18,039 INFO L895 garLoopResultBuilder]: At program point L289(lines 289 363) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (<= 1 main_~main__t~0)) (.cse2 (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse1 .cse2) (and (<= main_~main__t~0 1) .cse0 .cse1 .cse2))) [2022-04-28 03:11:18,039 INFO L895 garLoopResultBuilder]: At program point L223(lines 223 245) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse3 (<= 1 main_~main__t~0))) (or (and .cse0 .cse1 .cse2 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse3) (and .cse0 (<= main_~main__t~0 1) .cse1 (< 0 (+ main_~main__tagbuf_len~0 1)) .cse2 (not (= main_~main__tagbuf_len~0 0)) .cse3))) [2022-04-28 03:11:18,039 INFO L895 garLoopResultBuilder]: At program point L83(lines 83 93) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-28 03:11:18,039 INFO L895 garLoopResultBuilder]: At program point L339(line 339) the Hoare annotation is: false [2022-04-28 03:11:18,039 INFO L895 garLoopResultBuilder]: At program point L141(lines 141 163) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-28 03:11:18,039 INFO L895 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) the Hoare annotation is: false [2022-04-28 03:11:18,039 INFO L895 garLoopResultBuilder]: At program point L42(lines 42 256) the Hoare annotation is: (and (< main_~main__t~0 main_~main__tagbuf_len~0) (let ((.cse0 (let ((.cse1 (not (= main_~__VERIFIER_assert__cond~0 0)))) (or (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0) .cse1) (and (<= 0 main_~main__tagbuf_len~0) .cse1 (= main_~main__t~0 0)))))) (or (and (not (= main_~__VERIFIER_assert__cond~17 0)) .cse0) (and (<= main_~main__t~0 1) .cse0)))) [2022-04-28 03:11:18,039 INFO L895 garLoopResultBuilder]: At program point L298(line 298) the Hoare annotation is: false [2022-04-28 03:11:18,039 INFO L895 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) the Hoare annotation is: false [2022-04-28 03:11:18,040 INFO L895 garLoopResultBuilder]: At program point L125(lines 125 202) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-28 03:11:18,040 INFO L895 garLoopResultBuilder]: At program point L315(lines 32 368) the Hoare annotation is: (<= 0 main_~main__t~0) [2022-04-28 03:11:18,040 INFO L895 garLoopResultBuilder]: At program point L216(lines 216 251) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-28 03:11:18,040 INFO L895 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) the Hoare annotation is: false [2022-04-28 03:11:18,040 INFO L895 garLoopResultBuilder]: At program point L175(lines 175 199) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-28 03:11:18,040 INFO L895 garLoopResultBuilder]: At program point L266(lines 266 366) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-04-28 03:11:18,040 INFO L895 garLoopResultBuilder]: At program point L134(lines 134 201) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-28 03:11:18,040 INFO L895 garLoopResultBuilder]: At program point L357(lines 283 364) the Hoare annotation is: (let ((.cse0 (= main_~main__t~0 0))) (let ((.cse1 (let ((.cse2 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse3 (<= 0 main_~main__t~0))) (or (and .cse2 .cse3 .cse0) (and .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~16 0))))))) (or (and (< main_~main__t~0 main_~main__tagbuf_len~0) .cse0 .cse1) (and (not (= main_~__VERIFIER_assert__cond~17 0)) .cse1 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)))))) [2022-04-28 03:11:18,040 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:11:18,040 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_247_0~0)| ~__tmp_247_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 03:11:18,040 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:11:18,040 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:11:18,040 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 03:11:18,040 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 03:11:18,040 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:11:18,043 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 03:11:18,046 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 03:11:18,048 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:11:18,049 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 03:11:18,049 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 03:11:18,050 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 03:11:18,050 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 03:11:18,051 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-28 03:11:18,105 INFO L163 areAnnotationChecker]: CFG has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 03:11:18,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:11:18 BoogieIcfgContainer [2022-04-28 03:11:18,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 03:11:18,124 INFO L158 Benchmark]: Toolchain (without parser) took 53467.45ms. Allocated memory was 188.7MB in the beginning and 414.2MB in the end (delta: 225.4MB). Free memory was 139.0MB in the beginning and 247.0MB in the end (delta: -108.0MB). Peak memory consumption was 230.6MB. Max. memory is 8.0GB. [2022-04-28 03:11:18,124 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:11:18,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.69ms. Allocated memory is still 188.7MB. Free memory was 138.9MB in the beginning and 158.1MB in the end (delta: -19.3MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-04-28 03:11:18,124 INFO L158 Benchmark]: Boogie Preprocessor took 47.39ms. Allocated memory is still 188.7MB. Free memory was 158.1MB in the beginning and 156.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 03:11:18,125 INFO L158 Benchmark]: RCFGBuilder took 381.40ms. Allocated memory is still 188.7MB. Free memory was 156.0MB in the beginning and 139.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-28 03:11:18,125 INFO L158 Benchmark]: TraceAbstraction took 52772.97ms. Allocated memory was 188.7MB in the beginning and 414.2MB in the end (delta: 225.4MB). Free memory was 138.7MB in the beginning and 247.0MB in the end (delta: -108.3MB). Peak memory consumption was 230.4MB. Max. memory is 8.0GB. [2022-04-28 03:11:18,127 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 155.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.69ms. Allocated memory is still 188.7MB. Free memory was 138.9MB in the beginning and 158.1MB in the end (delta: -19.3MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.39ms. Allocated memory is still 188.7MB. Free memory was 158.1MB in the beginning and 156.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 381.40ms. Allocated memory is still 188.7MB. Free memory was 156.0MB in the beginning and 139.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 52772.97ms. Allocated memory was 188.7MB in the beginning and 414.2MB in the end (delta: 225.4MB). Free memory was 138.7MB in the beginning and 247.0MB in the end (delta: -108.3MB). Peak memory consumption was 230.4MB. 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: 44]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 73]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 127]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 143]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 155]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 225]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 237]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 279]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 298]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 310]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 339]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 351]: 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, 83 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 52.7s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 35.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1383 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1383 mSDsluCounter, 2585 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1559 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3022 IncrementalHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 1026 mSDtfsCounter, 3022 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 329 GetRequests, 146 SyntacticMatches, 10 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 299 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 76 LocationsWithAnnotation, 76 PreInvPairs, 101 NumberOfFragments, 953 HoareAnnotationTreeSize, 76 FomulaSimplifications, 25988 FormulaSimplificationTreeSizeReduction, 33.5s HoareSimplificationTime, 76 FomulaSimplificationsInter, 871907 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && main__t <= main__tagbuf_len - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((main__t < main__tagbuf_len && main__t == 0) && (((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0)))) || ((!(__VERIFIER_assert__cond == 0) && (((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0)))) && !(main__tagbuf_len <= main__t)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) || (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0))) && !(main__tagbuf_len <= main__t)) && 1 <= main__t) || (main__t < main__tagbuf_len && main__t == 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len <= main__t)) && 1 <= main__t - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main: ((\old(__return_305) == __return_305 && \old(__tmp_247_0) == __tmp_247_0) && \old(__tmp_383_0) == __tmp_383_0) || 0 <= main__t RESULT: Ultimate proved your program to be correct! [2022-04-28 03:11:18,161 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...