/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.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-27 21:35:06,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:35:06,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:35:06,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:35:06,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:35:06,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:35:06,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:35:06,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:35:06,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:35:06,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:35:06,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:35:06,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:35:06,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:35:06,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:35:06,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:35:06,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:35:06,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:35:06,592 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:35:06,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:35:06,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:35:06,600 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:35:06,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:35:06,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:35:06,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:35:06,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:35:06,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:35:06,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:35:06,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:35:06,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:35:06,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:35:06,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:35:06,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:35:06,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:35:06,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:35:06,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:35:06,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:35:06,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:35:06,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:35:06,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:35:06,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:35:06,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:35:06,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:35:06,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:35:06,647 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:35:06,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:35:06,648 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:35:06,648 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:35:06,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:35:06,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:35:06,649 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:35:06,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:35:06,650 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:35:06,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:35:06,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:35:06,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:35:06,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:35:06,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:35:06,651 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:35:06,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:35:06,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:35:06,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:35:06,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:35:06,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:35:06,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:35:06,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:35:06,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:35:06,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:35:06,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:35:06,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:35:06,653 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:35:06,653 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:35:06,655 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:35:06,655 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-27 21:35:06,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:35:06,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:35:06,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:35:06,901 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:35:06,902 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:35:06,903 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-27 21:35:06,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa14b39e/13e2a8d842594eec90c5a4be6c6a9f6f/FLAG4bf88fcfd [2022-04-27 21:35:07,270 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:35:07,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2022-04-27 21:35:07,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa14b39e/13e2a8d842594eec90c5a4be6c6a9f6f/FLAG4bf88fcfd [2022-04-27 21:35:07,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa14b39e/13e2a8d842594eec90c5a4be6c6a9f6f [2022-04-27 21:35:07,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:35:07,696 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:35:07,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:35:07,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:35:07,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:35:07,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:35:07" (1/1) ... [2022-04-27 21:35:07,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@622001b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:35:07, skipping insertion in model container [2022-04-27 21:35:07,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:35:07" (1/1) ... [2022-04-27 21:35:07,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:35:07,740 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:35:07,897 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-27 21:35:07,910 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-27 21:35:07,913 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-27 21:35:07,914 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-27 21:35:07,916 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-27 21:35:07,918 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-27 21:35:07,919 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-27 21:35:07,921 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-27 21:35:07,922 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-27 21:35:07,936 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-27 21:35:07,939 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-27 21:35:07,940 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-27 21:35:07,942 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-27 21:35:07,944 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-27 21:35:07,946 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-27 21:35:07,952 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-27 21:35:07,954 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-27 21:35:07,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:35:07,972 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:35:07,992 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-27 21:35:07,993 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-27 21:35:07,994 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-27 21:35:07,995 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-27 21:35:07,996 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-27 21:35:07,997 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-27 21:35:07,998 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-27 21:35:07,999 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-27 21:35:08,000 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-27 21:35:08,002 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-27 21:35:08,004 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-27 21:35:08,004 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-27 21:35:08,006 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-27 21:35:08,007 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-27 21:35:08,011 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-27 21:35:08,013 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-27 21:35:08,013 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-27 21:35:08,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:35:08,039 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:35:08,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:35:08 WrapperNode [2022-04-27 21:35:08,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:35:08,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:35:08,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:35:08,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:35:08,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:35:08" (1/1) ... [2022-04-27 21:35:08,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:35:08" (1/1) ... [2022-04-27 21:35:08,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:35:08" (1/1) ... [2022-04-27 21:35:08,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:35:08" (1/1) ... [2022-04-27 21:35:08,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:35:08" (1/1) ... [2022-04-27 21:35:08,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:35:08" (1/1) ... [2022-04-27 21:35:08,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:35:08" (1/1) ... [2022-04-27 21:35:08,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:35:08,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:35:08,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:35:08,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:35:08,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:35:08" (1/1) ... [2022-04-27 21:35:08,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:35:08,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:35:08,125 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-27 21:35:08,137 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-27 21:35:08,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:35:08,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:35:08,164 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:35:08,164 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:35:08,165 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:35:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:35:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:35:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:35:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:35:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:35:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:35:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:35:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:35:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:35:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:35:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:35:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:35:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:35:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:35:08,260 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:35:08,261 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:35:08,538 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:35:08,544 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:35:08,544 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 21:35:08,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:35:08 BoogieIcfgContainer [2022-04-27 21:35:08,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:35:08,547 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:35:08,547 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:35:08,548 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:35:08,550 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:35:08" (1/1) ... [2022-04-27 21:35:08,552 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:35:08,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:35:08 BasicIcfg [2022-04-27 21:35:08,590 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:35:08,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:35:08,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:35:08,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:35:08,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:35:07" (1/4) ... [2022-04-27 21:35:08,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4b8b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:35:08, skipping insertion in model container [2022-04-27 21:35:08,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:35:08" (2/4) ... [2022-04-27 21:35:08,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4b8b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:35:08, skipping insertion in model container [2022-04-27 21:35:08,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:35:08" (3/4) ... [2022-04-27 21:35:08,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4b8b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:35:08, skipping insertion in model container [2022-04-27 21:35:08,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:35:08" (4/4) ... [2022-04-27 21:35:08,596 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.cqvasr [2022-04-27 21:35:08,608 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:35:08,608 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-04-27 21:35:08,648 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:35:08,653 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4a80910, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2e09c2d4 [2022-04-27 21:35:08,654 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-04-27 21:35:08,661 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-27 21:35:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:35:08,666 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:08,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:08,667 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:08,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:08,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1220864783, now seen corresponding path program 1 times [2022-04-27 21:35:08,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:08,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124181905] [2022-04-27 21:35:08,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:08,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:08,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:08,934 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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {79#true} is VALID [2022-04-27 21:35:08,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {79#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79#true} is VALID [2022-04-27 21:35:08,935 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79#true} {79#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79#true} is VALID [2022-04-27 21:35:08,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {79#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {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-27 21:35:08,939 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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {79#true} is VALID [2022-04-27 21:35:08,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {79#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79#true} is VALID [2022-04-27 21:35:08,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79#true} {79#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79#true} is VALID [2022-04-27 21:35:08,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {79#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79#true} is VALID [2022-04-27 21:35:08,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {79#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {79#true} is VALID [2022-04-27 21:35:08,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {79#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {84#(<= 0 main_~main__t~0)} is VALID [2022-04-27 21:35:08,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {84#(<= 0 main_~main__t~0)} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {84#(<= 0 main_~main__t~0)} is VALID [2022-04-27 21:35:08,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {84#(<= 0 main_~main__t~0)} [195] L32-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_247_0~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_5 0))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[~__tmp_247_0~0] {84#(<= 0 main_~main__t~0)} is VALID [2022-04-27 21:35:08,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {84#(<= 0 main_~main__t~0)} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {85#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 21:35:08,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {85#(not (= main_~__VERIFIER_assert__cond~0 0))} [200] L42-->L44: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {80#false} is VALID [2022-04-27 21:35:08,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {80#false} [204] L44-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {80#false} is VALID [2022-04-27 21:35:08,947 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-27 21:35:08,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:08,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124181905] [2022-04-27 21:35:08,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124181905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:08,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:08,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:35:08,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149012420] [2022-04-27 21:35:08,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:08,956 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-27 21:35:08,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:08,960 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-27 21:35:08,978 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-27 21:35:08,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:35:08,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:09,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:35:09,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:35:09,018 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-27 21:35:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:09,459 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2022-04-27 21:35:09,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:35:09,460 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-27 21:35:09,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:09,462 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-27 21:35:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-04-27 21:35:09,486 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-27 21:35:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-04-27 21:35:09,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 113 transitions. [2022-04-27 21:35:09,606 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-27 21:35:09,614 INFO L225 Difference]: With dead ends: 87 [2022-04-27 21:35:09,614 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 21:35:09,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:35:09,619 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-27 21:35:09,620 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-27 21:35:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 21:35:09,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-27 21:35:09,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:09,650 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-27 21:35:09,651 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-27 21:35:09,651 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-27 21:35:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:09,655 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-27 21:35:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-27 21:35:09,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:09,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:09,657 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-27 21:35:09,657 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-27 21:35:09,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:09,661 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-27 21:35:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-27 21:35:09,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:09,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:09,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:09,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:09,662 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-27 21:35:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-04-27 21:35:09,666 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2022-04-27 21:35:09,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:09,666 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-04-27 21:35:09,667 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-27 21:35:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-27 21:35:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:35:09,667 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:09,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:09,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:35:09,668 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:09,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:09,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1220896562, now seen corresponding path program 1 times [2022-04-27 21:35:09,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:09,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336510776] [2022-04-27 21:35:09,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:09,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:09,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:09,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {412#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {405#true} is VALID [2022-04-27 21:35:09,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID [2022-04-27 21:35:09,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {405#true} {405#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID [2022-04-27 21:35:09,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {405#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {412#(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-27 21:35:09,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {412#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {405#true} is VALID [2022-04-27 21:35:09,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID [2022-04-27 21:35:09,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {405#true} {405#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID [2022-04-27 21:35:09,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {405#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {405#true} is VALID [2022-04-27 21:35:09,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {405#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {405#true} is VALID [2022-04-27 21:35:09,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {410#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:09,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {410#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {410#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:09,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {410#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} [196] L32-->L266: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_3) (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_33) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {410#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:09,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {410#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} [199] L266-->L277: Formula: (and (= (ite (<= v_main_~main__t~0_1 v_main_~main__tagbuf_len~0_1) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_2 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {411#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-27 21:35:09,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {411#(not (= main_~__VERIFIER_assert__cond~13 0))} [202] L277-->L279: Formula: (= v_main_~__VERIFIER_assert__cond~13_3 0) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_3} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_3} AuxVars[] AssignedVars[] {406#false} is VALID [2022-04-27 21:35:09,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {406#false} [208] L279-->mainErr12ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#false} is VALID [2022-04-27 21:35:09,749 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-27 21:35:09,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:09,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336510776] [2022-04-27 21:35:09,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336510776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:09,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:09,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:35:09,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970750992] [2022-04-27 21:35:09,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:09,751 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-27 21:35:09,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:09,751 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-27 21:35:09,762 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-27 21:35:09,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:35:09,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:09,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:35:09,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:35:09,764 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-27 21:35:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:10,208 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-04-27 21:35:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:35:10,208 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-27 21:35:10,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:10,208 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-27 21:35:10,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-04-27 21:35:10,211 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-27 21:35:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-04-27 21:35:10,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 117 transitions. [2022-04-27 21:35:10,291 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-27 21:35:10,293 INFO L225 Difference]: With dead ends: 111 [2022-04-27 21:35:10,293 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 21:35:10,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:35:10,295 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-27 21:35:10,295 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-27 21:35:10,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 21:35:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 67. [2022-04-27 21:35:10,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:10,312 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-27 21:35:10,312 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-27 21:35:10,312 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-27 21:35:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:10,316 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-04-27 21:35:10,316 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2022-04-27 21:35:10,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:10,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:10,317 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-27 21:35:10,318 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-27 21:35:10,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:10,321 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-04-27 21:35:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2022-04-27 21:35:10,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:10,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:10,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:10,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:10,323 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-27 21:35:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-04-27 21:35:10,327 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2022-04-27 21:35:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:10,327 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-04-27 21:35:10,328 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-27 21:35:10,328 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-27 21:35:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 21:35:10,328 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:10,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:10,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:35:10,329 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:10,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:10,329 INFO L85 PathProgramCache]: Analyzing trace with hash -807896157, now seen corresponding path program 1 times [2022-04-27 21:35:10,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:10,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023414247] [2022-04-27 21:35:10,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:10,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:10,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:10,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {844#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {837#true} is VALID [2022-04-27 21:35:10,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {837#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {837#true} is VALID [2022-04-27 21:35:10,393 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {837#true} {837#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {837#true} is VALID [2022-04-27 21:35:10,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {837#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {844#(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-27 21:35:10,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {844#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {837#true} is VALID [2022-04-27 21:35:10,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {837#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {837#true} is VALID [2022-04-27 21:35:10,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {837#true} {837#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {837#true} is VALID [2022-04-27 21:35:10,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {837#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {837#true} is VALID [2022-04-27 21:35:10,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {837#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {837#true} is VALID [2022-04-27 21:35:10,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {837#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {842#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:10,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {842#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {842#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:10,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {842#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} [195] L32-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_247_0~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_5 0))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[~__tmp_247_0~0] {842#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:10,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {842#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {842#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:10,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {842#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {843#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-27 21:35:10,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {843#(not (= main_~__VERIFIER_assert__cond~1 0))} [206] L54-->L56: Formula: (= v_main_~__VERIFIER_assert__cond~1_3 0) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} AuxVars[] AssignedVars[] {838#false} is VALID [2022-04-27 21:35:10,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {838#false} [211] L56-->mainErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {838#false} is VALID [2022-04-27 21:35:10,399 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-27 21:35:10,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:10,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023414247] [2022-04-27 21:35:10,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023414247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:10,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:10,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:35:10,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176037710] [2022-04-27 21:35:10,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:10,401 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-27 21:35:10,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:10,401 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-27 21:35:10,411 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-27 21:35:10,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:35:10,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:10,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:35:10,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:35:10,412 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-27 21:35:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:10,668 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-27 21:35:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:35:10,669 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-27 21:35:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:10,669 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-27 21:35:10,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-27 21:35:10,671 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-27 21:35:10,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-27 21:35:10,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2022-04-27 21:35:10,728 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-27 21:35:10,733 INFO L225 Difference]: With dead ends: 73 [2022-04-27 21:35:10,734 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 21:35:10,734 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-27 21:35:10,737 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-27 21:35:10,742 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-27 21:35:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 21:35:10,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-04-27 21:35:10,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:10,764 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-27 21:35:10,764 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-27 21:35:10,764 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-27 21:35:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:10,766 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-27 21:35:10,766 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-27 21:35:10,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:10,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:10,767 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-27 21:35:10,768 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-27 21:35:10,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:10,770 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-27 21:35:10,770 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-27 21:35:10,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:10,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:10,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:10,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:10,771 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-27 21:35:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-04-27 21:35:10,773 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2022-04-27 21:35:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:10,774 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-04-27 21:35:10,774 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-27 21:35:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-04-27 21:35:10,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 21:35:10,775 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:10,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:10,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 21:35:10,783 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:10,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:10,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1000912364, now seen corresponding path program 1 times [2022-04-27 21:35:10,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:10,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992859482] [2022-04-27 21:35:10,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:10,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:10,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:10,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {1163#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {1155#true} is VALID [2022-04-27 21:35:10,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1155#true} is VALID [2022-04-27 21:35:10,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1155#true} {1155#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1155#true} is VALID [2022-04-27 21:35:10,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {1155#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1163#(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-27 21:35:10,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {1163#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {1155#true} is VALID [2022-04-27 21:35:10,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1155#true} is VALID [2022-04-27 21:35:10,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1155#true} is VALID [2022-04-27 21:35:10,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {1155#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1155#true} is VALID [2022-04-27 21:35:10,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {1155#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {1155#true} is VALID [2022-04-27 21:35:10,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {1155#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {1160#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:10,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#(= main_~main__t~0 0)} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {1160#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:10,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {1160#(= main_~main__t~0 0)} [195] L32-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_247_0~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_5 0))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[~__tmp_247_0~0] {1160#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:10,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#(= main_~main__t~0 0)} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {1160#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:10,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {1160#(= main_~main__t~0 0)} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {1160#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:10,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {1160#(= main_~main__t~0 0)} [207] L54-->L196: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main__t~0_14 (+ v_main_~main__t~0_15 1)) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_15)) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0] {1161#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:10,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {1161#(<= 1 main_~main__t~0)} [213] L196-->L71: Formula: (and (= v_main_~__tmp_3~0_1 (ite (<= 0 v_main_~main__t~0_17) 1 0)) (= v_main_~main__t~0_17 v_main_~main__tagbuf_len~0_14) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_14, main_~main__t~0=v_main_~main__t~0_17} OutVars{main_~main__t~0=v_main_~main__t~0_17, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_14, main_~__tmp_3~0=v_main_~__tmp_3~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {1162#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-27 21:35:10,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {1162#(not (= main_~__VERIFIER_assert__cond~2 0))} [217] L71-->L73: Formula: (= v_main_~__VERIFIER_assert__cond~2_3 0) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_3} OutVars{main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_3} AuxVars[] AssignedVars[] {1156#false} is VALID [2022-04-27 21:35:10,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {1156#false} [225] L73-->mainErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1156#false} is VALID [2022-04-27 21:35:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:35:10,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:10,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992859482] [2022-04-27 21:35:10,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992859482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:10,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:10,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:35:10,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128480084] [2022-04-27 21:35:10,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:10,873 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-27 21:35:10,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:10,874 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-27 21:35:10,884 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-27 21:35:10,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:35:10,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:10,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:35:10,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:35:10,885 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-27 21:35:11,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:11,215 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-27 21:35:11,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:35:11,215 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-27 21:35:11,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:11,216 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-27 21:35:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-27 21:35:11,217 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-27 21:35:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-27 21:35:11,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2022-04-27 21:35:11,281 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-27 21:35:11,282 INFO L225 Difference]: With dead ends: 71 [2022-04-27 21:35:11,282 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 21:35:11,282 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-27 21:35:11,283 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-27 21:35:11,284 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-27 21:35:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 21:35:11,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-27 21:35:11,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:11,314 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-27 21:35:11,314 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-27 21:35:11,314 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-27 21:35:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:11,316 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-27 21:35:11,316 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-27 21:35:11,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:11,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:11,317 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-27 21:35:11,318 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-27 21:35:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:11,320 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-27 21:35:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-27 21:35:11,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:11,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:11,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:11,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:11,321 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-27 21:35:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-27 21:35:11,323 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2022-04-27 21:35:11,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:11,323 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-27 21:35:11,323 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-27 21:35:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-27 21:35:11,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 21:35:11,324 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:11,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:11,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 21:35:11,324 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:11,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:11,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1947612816, now seen corresponding path program 1 times [2022-04-27 21:35:11,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:11,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056484582] [2022-04-27 21:35:11,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:11,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:11,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:11,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {1474#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {1466#true} is VALID [2022-04-27 21:35:11,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {1466#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 21:35:11,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1466#true} {1466#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 21:35:11,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {1466#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1474#(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-27 21:35:11,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {1474#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {1466#true} is VALID [2022-04-27 21:35:11,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {1466#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 21:35:11,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1466#true} {1466#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 21:35:11,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {1466#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1466#true} is VALID [2022-04-27 21:35:11,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {1466#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {1466#true} is VALID [2022-04-27 21:35:11,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {1466#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {1471#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:11,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#(= main_~main__t~0 0)} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {1471#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:11,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#(= main_~main__t~0 0)} [196] L32-->L266: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_3) (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_33) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {1471#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:11,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {1471#(= main_~main__t~0 0)} [199] L266-->L277: Formula: (and (= (ite (<= v_main_~main__t~0_1 v_main_~main__tagbuf_len~0_1) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_2 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {1471#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:11,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {1471#(= main_~main__t~0 0)} [203] L277-->L357: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_1 v_~__tmp_383_0~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0))) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {1471#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:11,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {1471#(= main_~main__t~0 0)} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {1472#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:11,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {1472#(<= 1 main_~main__t~0)} [215] L289-->L296: Formula: (and (= (ite (<= 0 v_main_~main__t~0_5) 1 0) v_main_~__tmp_15~0_1) (= v_main_~main__t~0_5 v_main_~main__tagbuf_len~0_5) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5, main_~main__t~0=v_main_~main__t~0_5} OutVars{main_~main__t~0=v_main_~main__t~0_5, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14] {1473#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-27 21:35:11,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {1473#(not (= main_~__VERIFIER_assert__cond~14 0))} [221] L296-->L298: Formula: (= v_main_~__VERIFIER_assert__cond~14_3 0) InVars {main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_3} OutVars{main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_3} AuxVars[] AssignedVars[] {1467#false} is VALID [2022-04-27 21:35:11,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {1467#false} [233] L298-->mainErr13ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1467#false} is VALID [2022-04-27 21:35:11,429 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-27 21:35:11,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:11,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056484582] [2022-04-27 21:35:11,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056484582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:11,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:11,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:35:11,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223153900] [2022-04-27 21:35:11,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:11,430 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-27 21:35:11,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:11,431 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-27 21:35:11,441 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-27 21:35:11,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:35:11,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:11,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:35:11,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:35:11,442 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-27 21:35:11,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:11,760 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-27 21:35:11,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:35:11,760 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-27 21:35:11,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:11,761 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-27 21:35:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-27 21:35:11,762 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-27 21:35:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-27 21:35:11,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2022-04-27 21:35:11,827 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-27 21:35:11,828 INFO L225 Difference]: With dead ends: 69 [2022-04-27 21:35:11,828 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 21:35:11,829 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-27 21:35:11,829 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-27 21:35:11,829 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-27 21:35:11,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 21:35:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-04-27 21:35:11,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:11,848 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-27 21:35:11,848 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-27 21:35:11,848 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-27 21:35:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:11,850 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-27 21:35:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-27 21:35:11,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:11,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:11,851 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-27 21:35:11,852 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-27 21:35:11,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:11,853 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-27 21:35:11,854 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-27 21:35:11,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:11,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:11,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:11,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:11,854 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-27 21:35:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-04-27 21:35:11,856 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2022-04-27 21:35:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:11,856 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-04-27 21:35:11,856 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-27 21:35:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-27 21:35:11,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:35:11,857 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:11,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:11,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 21:35:11,857 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:11,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:11,858 INFO L85 PathProgramCache]: Analyzing trace with hash 963513474, now seen corresponding path program 1 times [2022-04-27 21:35:11,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:11,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055417283] [2022-04-27 21:35:11,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:11,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:11,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:11,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {1776#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {1769#true} is VALID [2022-04-27 21:35:11,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {1769#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1769#true} is VALID [2022-04-27 21:35:11,929 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1769#true} {1769#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1769#true} is VALID [2022-04-27 21:35:11,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {1769#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1776#(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-27 21:35:11,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {1776#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {1769#true} is VALID [2022-04-27 21:35:11,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {1769#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1769#true} is VALID [2022-04-27 21:35:11,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1769#true} {1769#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1769#true} is VALID [2022-04-27 21:35:11,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {1769#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1769#true} is VALID [2022-04-27 21:35:11,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {1769#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {1769#true} is VALID [2022-04-27 21:35:11,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {1769#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {1769#true} is VALID [2022-04-27 21:35:11,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {1769#true} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {1769#true} is VALID [2022-04-27 21:35:11,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {1769#true} [195] L32-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_247_0~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_5 0))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[~__tmp_247_0~0] {1769#true} is VALID [2022-04-27 21:35:11,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {1769#true} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {1769#true} is VALID [2022-04-27 21:35:11,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {1769#true} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {1769#true} is VALID [2022-04-27 21:35:11,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {1769#true} [207] L54-->L196: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main__t~0_14 (+ v_main_~main__t~0_15 1)) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_15)) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0] {1769#true} is VALID [2022-04-27 21:35:11,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {1769#true} [213] L196-->L71: Formula: (and (= v_main_~__tmp_3~0_1 (ite (<= 0 v_main_~main__t~0_17) 1 0)) (= v_main_~main__t~0_17 v_main_~main__tagbuf_len~0_14) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_14, main_~main__t~0=v_main_~main__t~0_17} OutVars{main_~main__t~0=v_main_~main__t~0_17, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_14, main_~__tmp_3~0=v_main_~__tmp_3~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {1774#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:11,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {1774#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [218] L71-->L83: Formula: (and (= v_main_~__tmp_4~0_1 (ite (<= v_main_~main__t~0_18 v_main_~main__tagbuf_len~0_15) 1 0)) (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_18, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_15} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~main__t~0=v_main_~main__t~0_18, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_15} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {1775#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-27 21:35:11,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {1775#(not (= main_~__VERIFIER_assert__cond~3 0))} [227] L83-->L85: Formula: (= v_main_~__VERIFIER_assert__cond~3_3 0) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_3} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_3} AuxVars[] AssignedVars[] {1770#false} is VALID [2022-04-27 21:35:11,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {1770#false} [239] L85-->mainErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1770#false} is VALID [2022-04-27 21:35:11,934 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-27 21:35:11,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:11,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055417283] [2022-04-27 21:35:11,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055417283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:11,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:11,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:35:11,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90166499] [2022-04-27 21:35:11,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:11,935 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-27 21:35:11,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:11,935 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-27 21:35:11,946 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-27 21:35:11,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:35:11,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:11,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:35:11,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:35:11,947 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-27 21:35:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:12,157 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-27 21:35:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:35:12,157 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-27 21:35:12,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:12,158 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-27 21:35:12,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-27 21:35:12,159 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-27 21:35:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-27 21:35:12,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-27 21:35:12,207 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-27 21:35:12,209 INFO L225 Difference]: With dead ends: 67 [2022-04-27 21:35:12,209 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 21:35:12,210 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-27 21:35:12,210 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-27 21:35:12,211 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-27 21:35:12,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 21:35:12,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-27 21:35:12,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:12,231 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-27 21:35:12,231 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-27 21:35:12,231 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-27 21:35:12,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:12,233 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-27 21:35:12,233 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-27 21:35:12,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:12,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:12,234 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-27 21:35:12,235 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-27 21:35:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:12,237 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-27 21:35:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-27 21:35:12,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:12,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:12,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:12,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:12,237 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-27 21:35:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-04-27 21:35:12,241 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 16 [2022-04-27 21:35:12,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:12,242 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-04-27 21:35:12,242 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-27 21:35:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-27 21:35:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:35:12,242 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:12,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:12,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 21:35:12,243 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:12,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:12,243 INFO L85 PathProgramCache]: Analyzing trace with hash 246456422, now seen corresponding path program 1 times [2022-04-27 21:35:12,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:12,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653438941] [2022-04-27 21:35:12,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:12,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:12,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:12,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {2065#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {2058#true} is VALID [2022-04-27 21:35:12,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {2058#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2058#true} is VALID [2022-04-27 21:35:12,314 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2058#true} {2058#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2058#true} is VALID [2022-04-27 21:35:12,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {2058#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2065#(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-27 21:35:12,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {2058#true} is VALID [2022-04-27 21:35:12,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {2058#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2058#true} is VALID [2022-04-27 21:35:12,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2058#true} {2058#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2058#true} is VALID [2022-04-27 21:35:12,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {2058#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2058#true} is VALID [2022-04-27 21:35:12,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {2058#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {2058#true} is VALID [2022-04-27 21:35:12,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {2058#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {2058#true} is VALID [2022-04-27 21:35:12,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {2058#true} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {2058#true} is VALID [2022-04-27 21:35:12,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {2058#true} [196] L32-->L266: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_3) (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_33) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {2058#true} is VALID [2022-04-27 21:35:12,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {2058#true} [199] L266-->L277: Formula: (and (= (ite (<= v_main_~main__t~0_1 v_main_~main__tagbuf_len~0_1) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_2 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {2058#true} is VALID [2022-04-27 21:35:12,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {2058#true} [203] L277-->L357: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_1 v_~__tmp_383_0~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0))) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {2058#true} is VALID [2022-04-27 21:35:12,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {2058#true} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {2058#true} is VALID [2022-04-27 21:35:12,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {2058#true} [215] L289-->L296: Formula: (and (= (ite (<= 0 v_main_~main__t~0_5) 1 0) v_main_~__tmp_15~0_1) (= v_main_~main__t~0_5 v_main_~main__tagbuf_len~0_5) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5, main_~main__t~0=v_main_~main__t~0_5} OutVars{main_~main__t~0=v_main_~main__t~0_5, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14] {2063#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:12,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {2063#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [222] L296-->L308: Formula: (and (= v_main_~__tmp_16~0_1 (ite (<= v_main_~main__t~0_9 v_main_~main__tagbuf_len~0_10) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~14_4 0)) (= v_main_~__tmp_16~0_1 v_main_~__VERIFIER_assert__cond~15_1)) InVars {main_~main__t~0=v_main_~main__t~0_9, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_10} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_1, main_~main__t~0=v_main_~main__t~0_9, main_~__tmp_16~0=v_main_~__tmp_16~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~15, main_~__tmp_16~0] {2064#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-27 21:35:12,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {2064#(not (= main_~__VERIFIER_assert__cond~15 0))} [235] L308-->L310: Formula: (= v_main_~__VERIFIER_assert__cond~15_3 0) InVars {main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_3} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_3} AuxVars[] AssignedVars[] {2059#false} is VALID [2022-04-27 21:35:12,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {2059#false} [247] L310-->mainErr14ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2059#false} is VALID [2022-04-27 21:35:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:35:12,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:12,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653438941] [2022-04-27 21:35:12,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653438941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:12,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:12,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:35:12,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414592836] [2022-04-27 21:35:12,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:12,321 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-27 21:35:12,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:12,321 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-27 21:35:12,333 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-27 21:35:12,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:35:12,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:12,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:35:12,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:35:12,334 INFO L87 Difference]: Start difference. First operand 62 states and 66 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-27 21:35:12,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:12,543 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-04-27 21:35:12,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:35:12,543 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-27 21:35:12,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:12,544 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-27 21:35:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-04-27 21:35:12,545 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-27 21:35:12,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-04-27 21:35:12,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 67 transitions. [2022-04-27 21:35:12,591 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-27 21:35:12,594 INFO L225 Difference]: With dead ends: 63 [2022-04-27 21:35:12,594 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 21:35:12,594 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-27 21:35:12,595 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:12,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 131 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:12,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 21:35:12,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-27 21:35:12,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:12,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 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-27 21:35:12,610 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 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-27 21:35:12,610 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 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-27 21:35:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:12,612 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-04-27 21:35:12,612 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-27 21:35:12,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:12,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:12,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 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 59 states. [2022-04-27 21:35:12,613 INFO L87 Difference]: Start difference. First operand has 58 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 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 59 states. [2022-04-27 21:35:12,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:12,614 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-04-27 21:35:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-27 21:35:12,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:12,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:12,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:12,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 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-27 21:35:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-04-27 21:35:12,616 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 16 [2022-04-27 21:35:12,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:12,617 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-04-27 21:35:12,617 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-27 21:35:12,617 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-27 21:35:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:35:12,617 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:12,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:12,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 21:35:12,618 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:12,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:12,618 INFO L85 PathProgramCache]: Analyzing trace with hash 246488199, now seen corresponding path program 1 times [2022-04-27 21:35:12,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:12,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933114903] [2022-04-27 21:35:12,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:12,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:12,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:12,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {2338#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {2330#true} is VALID [2022-04-27 21:35:12,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {2330#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2330#true} is VALID [2022-04-27 21:35:12,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2330#true} {2330#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2330#true} is VALID [2022-04-27 21:35:12,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {2330#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2338#(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-27 21:35:12,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {2330#true} is VALID [2022-04-27 21:35:12,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {2330#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2330#true} is VALID [2022-04-27 21:35:12,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2330#true} {2330#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2330#true} is VALID [2022-04-27 21:35:12,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {2330#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2330#true} is VALID [2022-04-27 21:35:12,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {2330#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {2330#true} is VALID [2022-04-27 21:35:12,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {2330#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {2335#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:12,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {2335#(= main_~main__t~0 0)} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {2335#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:12,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {2335#(= main_~main__t~0 0)} [196] L32-->L266: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_3) (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_33) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {2335#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:12,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {2335#(= main_~main__t~0 0)} [199] L266-->L277: Formula: (and (= (ite (<= v_main_~main__t~0_1 v_main_~main__tagbuf_len~0_1) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_2 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {2335#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:12,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {2335#(= main_~main__t~0 0)} [203] L277-->L357: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_1 v_~__tmp_383_0~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0))) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {2335#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:12,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {2335#(= main_~main__t~0 0)} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {2336#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:12,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {2336#(<= 1 main_~main__t~0)} [216] L289-->L325: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_11)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {2336#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:12,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {2336#(<= 1 main_~main__t~0)} [224] L325-->L337: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_4 0) (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_13) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__t~0=v_main_~main__t~0_13, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {2337#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-27 21:35:12,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {2337#(not (= main_~__VERIFIER_assert__cond~16 0))} [237] L337-->L339: Formula: (= v_main_~__VERIFIER_assert__cond~16_3 0) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} AuxVars[] AssignedVars[] {2331#false} is VALID [2022-04-27 21:35:12,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {2331#false} [249] L339-->mainErr15ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2331#false} is VALID [2022-04-27 21:35:12,671 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-27 21:35:12,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:12,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933114903] [2022-04-27 21:35:12,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933114903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:12,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:12,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:35:12,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340948965] [2022-04-27 21:35:12,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:12,672 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-27 21:35:12,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:12,672 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-27 21:35:12,683 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-27 21:35:12,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:35:12,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:12,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:35:12,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:35:12,684 INFO L87 Difference]: Start difference. First operand 58 states and 62 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-27 21:35:13,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:13,068 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-04-27 21:35:13,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:35:13,068 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-27 21:35:13,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:13,068 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-27 21:35:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-27 21:35:13,070 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-27 21:35:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-27 21:35:13,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 103 transitions. [2022-04-27 21:35:13,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:13,147 INFO L225 Difference]: With dead ends: 96 [2022-04-27 21:35:13,147 INFO L226 Difference]: Without dead ends: 94 [2022-04-27 21:35:13,147 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-27 21:35:13,148 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 88 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:13,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 147 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:35:13,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-27 21:35:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 56. [2022-04-27 21:35:13,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:13,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 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-27 21:35:13,163 INFO L74 IsIncluded]: Start isIncluded. First operand 94 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-27 21:35:13,164 INFO L87 Difference]: Start difference. First operand 94 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-27 21:35:13,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:13,166 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-04-27 21:35:13,166 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-04-27 21:35:13,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:13,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:13,166 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 94 states. [2022-04-27 21:35:13,166 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 94 states. [2022-04-27 21:35:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:13,168 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-04-27 21:35:13,168 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-04-27 21:35:13,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:13,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:13,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:13,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:13,169 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-27 21:35:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-27 21:35:13,170 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2022-04-27 21:35:13,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:13,170 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-27 21:35:13,171 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-27 21:35:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-27 21:35:13,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:35:13,171 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:13,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:13,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 21:35:13,171 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:13,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:13,172 INFO L85 PathProgramCache]: Analyzing trace with hash -194897798, now seen corresponding path program 1 times [2022-04-27 21:35:13,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:13,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852404413] [2022-04-27 21:35:13,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:13,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:13,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:13,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {2715#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {2707#true} is VALID [2022-04-27 21:35:13,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {2707#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2707#true} is VALID [2022-04-27 21:35:13,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2707#true} {2707#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2707#true} is VALID [2022-04-27 21:35:13,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {2707#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2715#(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-27 21:35:13,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {2715#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {2707#true} is VALID [2022-04-27 21:35:13,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {2707#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2707#true} is VALID [2022-04-27 21:35:13,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2707#true} {2707#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2707#true} is VALID [2022-04-27 21:35:13,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {2707#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2707#true} is VALID [2022-04-27 21:35:13,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {2707#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {2707#true} is VALID [2022-04-27 21:35:13,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {2707#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {2712#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:13,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {2712#(= main_~main__t~0 0)} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {2712#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:13,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {2712#(= main_~main__t~0 0)} [195] L32-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_247_0~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_5 0))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[~__tmp_247_0~0] {2712#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:13,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {2712#(= main_~main__t~0 0)} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {2712#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:13,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {2712#(= main_~main__t~0 0)} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {2712#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:13,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {2712#(= main_~main__t~0 0)} [207] L54-->L196: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main__t~0_14 (+ v_main_~main__t~0_15 1)) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_15)) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0] {2713#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:13,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {2713#(<= 1 main_~main__t~0)} [214] L196-->L102: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (not (= v_main_~main__t~0_19 v_main_~main__tagbuf_len~0_17)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_19, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17} OutVars{main_~main__t~0=v_main_~main__t~0_19, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {2713#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:13,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {2713#(<= 1 main_~main__t~0)} [219] L102-->L106: Formula: (and (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_4~0] {2713#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:13,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {2713#(<= 1 main_~main__t~0)} [229] L106-->L113: Formula: (and (= v_main_~__tmp_5~0_1 (ite (<= 0 v_main_~main__t~0_20) 1 0)) (not (= v_main_~main____CPAchecker_TMP_4~0_3 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__t~0=v_main_~main__t~0_20, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_20, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {2714#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-27 21:35:13,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {2714#(not (= main_~__VERIFIER_assert__cond~4 0))} [242] L113-->L115: Formula: (= v_main_~__VERIFIER_assert__cond~4_3 0) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} OutVars{main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} AuxVars[] AssignedVars[] {2708#false} is VALID [2022-04-27 21:35:13,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {2708#false} [253] L115-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2708#false} is VALID [2022-04-27 21:35:13,251 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-27 21:35:13,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:13,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852404413] [2022-04-27 21:35:13,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852404413] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:13,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:13,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:35:13,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402084431] [2022-04-27 21:35:13,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:13,253 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-27 21:35:13,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:13,253 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-27 21:35:13,266 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-27 21:35:13,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:35:13,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:13,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:35:13,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:35:13,267 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-27 21:35:13,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:13,596 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-04-27 21:35:13,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:35:13,596 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-27 21:35:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:13,597 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-27 21:35:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 21:35:13,598 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-27 21:35:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 21:35:13,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-27 21:35:13,661 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-27 21:35:13,662 INFO L225 Difference]: With dead ends: 74 [2022-04-27 21:35:13,662 INFO L226 Difference]: Without dead ends: 72 [2022-04-27 21:35:13,662 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-27 21:35:13,662 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-27 21:35:13,663 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-27 21:35:13,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-27 21:35:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2022-04-27 21:35:13,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:13,674 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-27 21:35:13,674 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-27 21:35:13,674 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-27 21:35:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:13,676 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-27 21:35:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-27 21:35:13,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:13,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:13,677 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-27 21:35:13,677 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-27 21:35:13,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:13,678 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-27 21:35:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-27 21:35:13,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:13,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:13,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:13,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:13,678 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-27 21:35:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-27 21:35:13,679 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2022-04-27 21:35:13,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:13,679 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-27 21:35:13,679 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-27 21:35:13,679 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-27 21:35:13,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:35:13,680 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:13,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:13,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 21:35:13,680 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:13,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash -194865986, now seen corresponding path program 1 times [2022-04-27 21:35:13,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:13,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773267896] [2022-04-27 21:35:13,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:13,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:13,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:13,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {3023#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {3015#true} is VALID [2022-04-27 21:35:13,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {3015#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3015#true} is VALID [2022-04-27 21:35:13,748 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3015#true} {3015#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3015#true} is VALID [2022-04-27 21:35:13,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {3015#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3023#(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-27 21:35:13,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {3023#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {3015#true} is VALID [2022-04-27 21:35:13,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {3015#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3015#true} is VALID [2022-04-27 21:35:13,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3015#true} {3015#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3015#true} is VALID [2022-04-27 21:35:13,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {3015#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3015#true} is VALID [2022-04-27 21:35:13,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {3015#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {3015#true} is VALID [2022-04-27 21:35:13,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {3015#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {3020#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:13,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {3020#(= main_~main__t~0 0)} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {3020#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:13,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {3020#(= main_~main__t~0 0)} [195] L32-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_247_0~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_5 0))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[~__tmp_247_0~0] {3020#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:13,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {3020#(= main_~main__t~0 0)} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {3020#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:13,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {3020#(= main_~main__t~0 0)} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3020#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:13,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {3020#(= main_~main__t~0 0)} [207] L54-->L196: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main__t~0_14 (+ v_main_~main__t~0_15 1)) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_15)) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0] {3021#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:13,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {3021#(<= 1 main_~main__t~0)} [214] L196-->L102: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (not (= v_main_~main__t~0_19 v_main_~main__tagbuf_len~0_17)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_19, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17} OutVars{main_~main__t~0=v_main_~main__t~0_19, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {3021#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:13,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {3021#(<= 1 main_~main__t~0)} [220] L102-->L216: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_6~0_1 |v_main_#t~nondet8_2|) (= v_main_~main____CPAchecker_TMP_3~0_4 0)) InVars {main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} OutVars{main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_1, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_6~0, main_#t~nondet8] {3021#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:13,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {3021#(<= 1 main_~main__t~0)} [231] L216-->L223: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (not (= v_main_~main____CPAchecker_TMP_6~0_3 0)) (= v_main_~__tmp_11~0_1 (ite (<= 0 v_main_~main__t~0_31) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_31, main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_31, main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {3022#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-27 21:35:13,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {3022#(not (= main_~__VERIFIER_assert__cond~10 0))} [245] L223-->L225: Formula: (= v_main_~__VERIFIER_assert__cond~10_3 0) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} OutVars{main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} AuxVars[] AssignedVars[] {3016#false} is VALID [2022-04-27 21:35:13,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {3016#false} [259] L225-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3016#false} is VALID [2022-04-27 21:35:13,754 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-27 21:35:13,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:13,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773267896] [2022-04-27 21:35:13,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773267896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:13,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:13,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:35:13,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550894315] [2022-04-27 21:35:13,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:13,755 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-27 21:35:13,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:13,756 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-27 21:35:13,767 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-27 21:35:13,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:35:13,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:13,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:35:13,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:35:13,768 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-27 21:35:14,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:14,004 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-27 21:35:14,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:35:14,004 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-27 21:35:14,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:14,005 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-27 21:35:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-27 21:35:14,008 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-27 21:35:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-27 21:35:14,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-27 21:35:14,064 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-27 21:35:14,065 INFO L225 Difference]: With dead ends: 55 [2022-04-27 21:35:14,065 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 21:35:14,066 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-27 21:35:14,067 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-27 21:35:14,067 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-27 21:35:14,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 21:35:14,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-27 21:35:14,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:14,076 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-27 21:35:14,076 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-27 21:35:14,076 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-27 21:35:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:14,085 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 21:35:14,085 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 21:35:14,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:14,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:14,086 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-27 21:35:14,086 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-27 21:35:14,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:14,087 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 21:35:14,087 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 21:35:14,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:14,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:14,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:14,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:14,088 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-27 21:35:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-27 21:35:14,088 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2022-04-27 21:35:14,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:14,090 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-27 21:35:14,090 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-27 21:35:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-27 21:35:14,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:35:14,091 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:14,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:14,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 21:35:14,091 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:14,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:14,092 INFO L85 PathProgramCache]: Analyzing trace with hash -948799137, now seen corresponding path program 1 times [2022-04-27 21:35:14,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:14,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986118233] [2022-04-27 21:35:14,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:14,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:14,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:14,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {3271#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {3262#true} is VALID [2022-04-27 21:35:14,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {3262#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3262#true} is VALID [2022-04-27 21:35:14,233 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3262#true} {3262#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3262#true} is VALID [2022-04-27 21:35:14,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {3262#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3271#(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-27 21:35:14,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {3271#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {3262#true} is VALID [2022-04-27 21:35:14,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {3262#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3262#true} is VALID [2022-04-27 21:35:14,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3262#true} {3262#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3262#true} is VALID [2022-04-27 21:35:14,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {3262#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3262#true} is VALID [2022-04-27 21:35:14,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {3262#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {3262#true} is VALID [2022-04-27 21:35:14,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {3262#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {3267#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:14,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {3267#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {3268#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:14,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {3268#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [196] L32-->L266: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_3) (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_33) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {3268#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:14,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {3268#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [199] L266-->L277: Formula: (and (= (ite (<= v_main_~main__t~0_1 v_main_~main__tagbuf_len~0_1) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_2 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {3268#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:14,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {3268#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [203] L277-->L357: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_1 v_~__tmp_383_0~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0))) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {3268#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:14,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {3268#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {3269#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:14,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {3269#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [216] L289-->L325: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_11)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {3269#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:14,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {3269#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [224] L325-->L337: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_4 0) (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_13) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__t~0=v_main_~main__t~0_13, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {3269#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:14,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {3269#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [238] L337-->L349: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= (ite (<= v_main_~main__t~0_16 v_main_~main__tagbuf_len~0_13) 1 0) v_main_~__tmp_18~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13} OutVars{main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {3270#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2022-04-27 21:35:14,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {3270#(not (= main_~__VERIFIER_assert__cond~17 0))} [251] L349-->L351: Formula: (= v_main_~__VERIFIER_assert__cond~17_3 0) InVars {main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_3} OutVars{main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_3} AuxVars[] AssignedVars[] {3263#false} is VALID [2022-04-27 21:35:14,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {3263#false} [263] L351-->mainErr16ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3263#false} is VALID [2022-04-27 21:35:14,244 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-27 21:35:14,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:14,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986118233] [2022-04-27 21:35:14,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986118233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:14,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:14,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:35:14,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929470018] [2022-04-27 21:35:14,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:14,245 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-27 21:35:14,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:14,246 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-27 21:35:14,258 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-27 21:35:14,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:35:14,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:14,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:35:14,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:35:14,259 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-27 21:35:14,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:14,725 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-04-27 21:35:14,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:35:14,725 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-27 21:35:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:14,726 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-27 21:35:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-04-27 21:35:14,727 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-27 21:35:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-04-27 21:35:14,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 119 transitions. [2022-04-27 21:35:14,813 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-27 21:35:14,814 INFO L225 Difference]: With dead ends: 110 [2022-04-27 21:35:14,814 INFO L226 Difference]: Without dead ends: 108 [2022-04-27 21:35:14,814 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-27 21:35:14,815 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 82 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:14,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 188 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-27 21:35:14,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 57. [2022-04-27 21:35:14,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:14,840 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-27 21:35:14,840 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-27 21:35:14,840 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-27 21:35:14,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:14,842 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-04-27 21:35:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-04-27 21:35:14,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:14,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:14,842 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-27 21:35:14,842 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-27 21:35:14,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:14,844 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-04-27 21:35:14,844 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-04-27 21:35:14,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:14,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:14,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:14,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:14,844 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-27 21:35:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-04-27 21:35:14,845 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 17 [2022-04-27 21:35:14,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:14,845 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-04-27 21:35:14,845 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-27 21:35:14,846 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-27 21:35:14,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 21:35:14,846 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:14,846 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-27 21:35:14,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 21:35:14,846 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:14,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:14,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1746863154, now seen corresponding path program 1 times [2022-04-27 21:35:14,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:14,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361985215] [2022-04-27 21:35:14,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:14,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:14,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:14,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {3698#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {3689#true} is VALID [2022-04-27 21:35:14,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {3689#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3689#true} is VALID [2022-04-27 21:35:14,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3689#true} {3689#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3689#true} is VALID [2022-04-27 21:35:14,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {3689#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3698#(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-27 21:35:14,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {3698#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {3689#true} is VALID [2022-04-27 21:35:14,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {3689#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3689#true} is VALID [2022-04-27 21:35:14,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3689#true} {3689#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3689#true} is VALID [2022-04-27 21:35:14,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {3689#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3689#true} is VALID [2022-04-27 21:35:14,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {3689#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {3689#true} is VALID [2022-04-27 21:35:14,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {3689#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {3694#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:14,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {3694#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {3695#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:14,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {3695#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [195] L32-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_247_0~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_5 0))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[~__tmp_247_0~0] {3695#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:14,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {3695#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {3695#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:14,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {3695#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3695#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:14,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {3695#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [207] L54-->L196: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main__t~0_14 (+ v_main_~main__t~0_15 1)) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_15)) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0] {3696#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:14,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {3696#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [214] L196-->L102: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (not (= v_main_~main__t~0_19 v_main_~main__tagbuf_len~0_17)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_19, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17} OutVars{main_~main__t~0=v_main_~main__t~0_19, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {3696#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:14,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {3696#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [219] L102-->L106: Formula: (and (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_4~0] {3696#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:14,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {3696#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [229] L106-->L113: Formula: (and (= v_main_~__tmp_5~0_1 (ite (<= 0 v_main_~main__t~0_20) 1 0)) (not (= v_main_~main____CPAchecker_TMP_4~0_3 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__t~0=v_main_~main__t~0_20, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_20, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {3696#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:14,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {3696#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [243] L113-->L125: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1) (= v_main_~__tmp_6~0_1 (ite (<= v_main_~main__t~0_21 v_main_~main__tagbuf_len~0_18) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_21, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18} OutVars{main_~main__t~0=v_main_~main__t~0_21, main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {3697#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-27 21:35:14,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {3697#(not (= main_~__VERIFIER_assert__cond~5 0))} [255] L125-->L127: Formula: (= v_main_~__VERIFIER_assert__cond~5_3 0) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_3} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_3} AuxVars[] AssignedVars[] {3690#false} is VALID [2022-04-27 21:35:14,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {3690#false} [265] L127-->mainErr5ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3690#false} is VALID [2022-04-27 21:35:14,952 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-27 21:35:14,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:14,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361985215] [2022-04-27 21:35:14,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361985215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:14,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:14,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:35:14,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085199529] [2022-04-27 21:35:14,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:14,953 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-27 21:35:14,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:14,953 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-27 21:35:14,966 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-27 21:35:14,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:35:14,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:14,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:35:14,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:35:14,967 INFO L87 Difference]: Start difference. First operand 57 states and 62 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-27 21:35:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:15,406 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2022-04-27 21:35:15,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:35:15,406 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-27 21:35:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:15,406 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-27 21:35:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2022-04-27 21:35:15,408 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-27 21:35:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2022-04-27 21:35:15,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 107 transitions. [2022-04-27 21:35:15,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:15,482 INFO L225 Difference]: With dead ends: 98 [2022-04-27 21:35:15,483 INFO L226 Difference]: Without dead ends: 96 [2022-04-27 21:35:15,483 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-27 21:35:15,483 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 62 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:15,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 183 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:35:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-27 21:35:15,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 62. [2022-04-27 21:35:15,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:15,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 62 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 58 states have internal predecessors, (66), 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-27 21:35:15,512 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 62 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 58 states have internal predecessors, (66), 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-27 21:35:15,512 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 62 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 58 states have internal predecessors, (66), 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-27 21:35:15,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:15,514 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2022-04-27 21:35:15,514 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-04-27 21:35:15,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:15,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:15,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 58 states have internal predecessors, (66), 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 96 states. [2022-04-27 21:35:15,515 INFO L87 Difference]: Start difference. First operand has 62 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 58 states have internal predecessors, (66), 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 96 states. [2022-04-27 21:35:15,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:15,517 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2022-04-27 21:35:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-04-27 21:35:15,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:15,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:15,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:15,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 58 states have internal predecessors, (66), 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-27 21:35:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-04-27 21:35:15,518 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 18 [2022-04-27 21:35:15,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:15,519 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-04-27 21:35:15,519 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-27 21:35:15,519 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-04-27 21:35:15,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 21:35:15,519 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:15,519 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-27 21:35:15,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 21:35:15,520 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:15,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:15,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1746832336, now seen corresponding path program 1 times [2022-04-27 21:35:15,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:15,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052027399] [2022-04-27 21:35:15,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:15,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:15,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:15,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {4094#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {4086#true} is VALID [2022-04-27 21:35:15,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {4086#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4086#true} is VALID [2022-04-27 21:35:15,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4086#true} {4086#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4086#true} is VALID [2022-04-27 21:35:15,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {4086#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4094#(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-27 21:35:15,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {4094#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {4086#true} is VALID [2022-04-27 21:35:15,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {4086#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4086#true} is VALID [2022-04-27 21:35:15,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4086#true} {4086#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4086#true} is VALID [2022-04-27 21:35:15,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {4086#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4086#true} is VALID [2022-04-27 21:35:15,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {4086#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {4086#true} is VALID [2022-04-27 21:35:15,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {4086#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {4091#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:15,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {4091#(= main_~main__t~0 0)} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {4091#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:15,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {4091#(= main_~main__t~0 0)} [195] L32-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_247_0~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_5 0))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[~__tmp_247_0~0] {4091#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:15,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {4091#(= main_~main__t~0 0)} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {4091#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:15,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {4091#(= main_~main__t~0 0)} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4091#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:15,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {4091#(= main_~main__t~0 0)} [207] L54-->L196: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main__t~0_14 (+ v_main_~main__t~0_15 1)) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_15)) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0] {4092#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:15,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {4092#(<= 1 main_~main__t~0)} [214] L196-->L102: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (not (= v_main_~main__t~0_19 v_main_~main__tagbuf_len~0_17)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_19, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17} OutVars{main_~main__t~0=v_main_~main__t~0_19, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {4092#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:15,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {4092#(<= 1 main_~main__t~0)} [219] L102-->L106: Formula: (and (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_4~0] {4092#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:15,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {4092#(<= 1 main_~main__t~0)} [230] L106-->L250: Formula: (= v_main_~main____CPAchecker_TMP_4~0_4 0) InVars {main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_4} OutVars{main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_4} AuxVars[] AssignedVars[] {4092#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:15,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {4092#(<= 1 main_~main__t~0)} [244] L250-->L175: Formula: (and (= (ite (<= 0 v_main_~main__t~0_27) 1 0) v_main_~__tmp_9~0_1) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__t~0=v_main_~main__t~0_27} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__t~0=v_main_~main__t~0_27, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {4093#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-27 21:35:15,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {4093#(not (= main_~__VERIFIER_assert__cond~8 0))} [257] L175-->L177: Formula: (= v_main_~__VERIFIER_assert__cond~8_3 0) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_3} OutVars{main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_3} AuxVars[] AssignedVars[] {4087#false} is VALID [2022-04-27 21:35:15,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {4087#false} [269] L177-->mainErr8ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4087#false} is VALID [2022-04-27 21:35:15,573 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-27 21:35:15,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:15,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052027399] [2022-04-27 21:35:15,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052027399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:15,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:15,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:35:15,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996600714] [2022-04-27 21:35:15,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:15,574 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-27 21:35:15,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:15,574 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-27 21:35:15,587 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-27 21:35:15,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:35:15,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:15,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:35:15,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:35:15,588 INFO L87 Difference]: Start difference. First operand 62 states and 69 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-27 21:35:15,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:15,917 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2022-04-27 21:35:15,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:35:15,917 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-27 21:35:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:15,917 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-27 21:35:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-27 21:35:15,918 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-27 21:35:15,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-27 21:35:15,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-27 21:35:15,981 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-27 21:35:15,982 INFO L225 Difference]: With dead ends: 82 [2022-04-27 21:35:15,982 INFO L226 Difference]: Without dead ends: 80 [2022-04-27 21:35:15,982 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-27 21:35:15,983 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-27 21:35:15,983 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-27 21:35:15,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-27 21:35:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2022-04-27 21:35:16,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:16,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 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-27 21:35:16,002 INFO L74 IsIncluded]: Start isIncluded. First operand 80 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-27 21:35:16,002 INFO L87 Difference]: Start difference. First operand 80 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-27 21:35:16,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:16,003 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-04-27 21:35:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-04-27 21:35:16,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:16,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:16,004 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 80 states. [2022-04-27 21:35:16,004 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 80 states. [2022-04-27 21:35:16,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:16,005 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-04-27 21:35:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-04-27 21:35:16,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:16,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:16,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:16,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:16,006 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-27 21:35:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-04-27 21:35:16,007 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 18 [2022-04-27 21:35:16,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:16,007 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-04-27 21:35:16,007 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-27 21:35:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-04-27 21:35:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 21:35:16,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:16,008 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-27 21:35:16,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 21:35:16,008 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:16,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:16,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1745876974, now seen corresponding path program 1 times [2022-04-27 21:35:16,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:16,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136441267] [2022-04-27 21:35:16,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:16,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:16,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:16,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {4436#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {4427#true} is VALID [2022-04-27 21:35:16,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {4427#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4427#true} is VALID [2022-04-27 21:35:16,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4427#true} {4427#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4427#true} is VALID [2022-04-27 21:35:16,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {4427#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4436#(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-27 21:35:16,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {4436#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {4427#true} is VALID [2022-04-27 21:35:16,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {4427#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4427#true} is VALID [2022-04-27 21:35:16,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4427#true} {4427#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4427#true} is VALID [2022-04-27 21:35:16,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {4427#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4427#true} is VALID [2022-04-27 21:35:16,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {4427#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {4427#true} is VALID [2022-04-27 21:35:16,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {4427#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {4432#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:16,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {4432#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {4433#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:16,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {4433#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [195] L32-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_247_0~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_5 0))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[~__tmp_247_0~0] {4433#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:16,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {4433#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {4433#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:16,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {4433#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4433#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:16,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {4433#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [207] L54-->L196: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main__t~0_14 (+ v_main_~main__t~0_15 1)) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_15)) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0] {4434#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:16,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {4434#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [214] L196-->L102: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (not (= v_main_~main__t~0_19 v_main_~main__tagbuf_len~0_17)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_19, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17} OutVars{main_~main__t~0=v_main_~main__t~0_19, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {4434#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:16,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {4434#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [220] L102-->L216: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_6~0_1 |v_main_#t~nondet8_2|) (= v_main_~main____CPAchecker_TMP_3~0_4 0)) InVars {main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} OutVars{main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_1, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_6~0, main_#t~nondet8] {4434#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:16,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {4434#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [231] L216-->L223: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (not (= v_main_~main____CPAchecker_TMP_6~0_3 0)) (= v_main_~__tmp_11~0_1 (ite (<= 0 v_main_~main__t~0_31) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_31, main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_31, main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {4434#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:16,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {4434#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [246] L223-->L235: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 (ite (<= v_main_~main__t~0_32 v_main_~main__tagbuf_len~0_23) 1 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__t~0=v_main_~main__t~0_32, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~main__t~0=v_main_~main__t~0_32, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {4435#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-27 21:35:16,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {4435#(not (= main_~__VERIFIER_assert__cond~11 0))} [261] L235-->L237: Formula: (= v_main_~__VERIFIER_assert__cond~11_3 0) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_3} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_3} AuxVars[] AssignedVars[] {4428#false} is VALID [2022-04-27 21:35:16,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {4428#false} [273] L237-->mainErr11ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4428#false} is VALID [2022-04-27 21:35:16,110 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-27 21:35:16,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:16,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136441267] [2022-04-27 21:35:16,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136441267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:16,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:16,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:35:16,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567434595] [2022-04-27 21:35:16,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:16,111 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-27 21:35:16,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:16,111 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-27 21:35:16,124 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-27 21:35:16,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:35:16,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:16,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:35:16,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:35:16,125 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-27 21:35:16,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:16,393 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-27 21:35:16,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:35:16,394 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-27 21:35:16,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:16,394 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-27 21:35:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-27 21:35:16,395 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-27 21:35:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-27 21:35:16,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2022-04-27 21:35:16,468 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-27 21:35:16,469 INFO L225 Difference]: With dead ends: 76 [2022-04-27 21:35:16,469 INFO L226 Difference]: Without dead ends: 72 [2022-04-27 21:35:16,469 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-27 21:35:16,470 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-27 21:35:16,470 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-27 21:35:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-27 21:35:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2022-04-27 21:35:16,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:16,487 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-27 21:35:16,487 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-27 21:35:16,487 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-27 21:35:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:16,488 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-27 21:35:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-04-27 21:35:16,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:16,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:16,489 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-27 21:35:16,489 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-27 21:35:16,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:16,490 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-27 21:35:16,490 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-04-27 21:35:16,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:16,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:16,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:16,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:16,491 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-27 21:35:16,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-04-27 21:35:16,492 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 18 [2022-04-27 21:35:16,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:16,492 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-04-27 21:35:16,492 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-27 21:35:16,492 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-27 21:35:16,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 21:35:16,493 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:16,493 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-27 21:35:16,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 21:35:16,493 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:16,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:16,494 INFO L85 PathProgramCache]: Analyzing trace with hash 649803267, now seen corresponding path program 1 times [2022-04-27 21:35:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:16,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810297078] [2022-04-27 21:35:16,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:16,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:16,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:16,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {4760#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {4751#true} is VALID [2022-04-27 21:35:16,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {4751#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4751#true} is VALID [2022-04-27 21:35:16,581 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4751#true} {4751#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4751#true} is VALID [2022-04-27 21:35:16,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {4751#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4760#(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-27 21:35:16,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {4760#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {4751#true} is VALID [2022-04-27 21:35:16,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {4751#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4751#true} is VALID [2022-04-27 21:35:16,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4751#true} {4751#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4751#true} is VALID [2022-04-27 21:35:16,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {4751#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4751#true} is VALID [2022-04-27 21:35:16,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {4751#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {4751#true} is VALID [2022-04-27 21:35:16,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {4751#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {4756#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:16,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {4756#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {4757#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:16,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {4757#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [196] L32-->L266: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_3) (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_33) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {4757#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:16,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {4757#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [199] L266-->L277: Formula: (and (= (ite (<= v_main_~main__t~0_1 v_main_~main__tagbuf_len~0_1) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_2 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {4757#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:16,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {4757#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [203] L277-->L357: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_1 v_~__tmp_383_0~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0))) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {4757#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:16,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {4757#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {4758#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:16,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {4758#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [216] L289-->L325: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_11)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {4758#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:16,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {4758#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [223] L325-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_3 v_~__tmp_247_0~0_3) (not (= v_main_~main____CPAchecker_TMP_0~1_3 0))) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_3, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} AuxVars[] AssignedVars[~__tmp_247_0~0] {4758#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:16,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {4758#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {4758#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:16,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {4758#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4759#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-27 21:35:16,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {4759#(not (= main_~__VERIFIER_assert__cond~1 0))} [206] L54-->L56: Formula: (= v_main_~__VERIFIER_assert__cond~1_3 0) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} AuxVars[] AssignedVars[] {4752#false} is VALID [2022-04-27 21:35:16,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {4752#false} [211] L56-->mainErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4752#false} is VALID [2022-04-27 21:35:16,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:35:16,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:16,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810297078] [2022-04-27 21:35:16,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810297078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:16,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:16,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:35:16,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780254506] [2022-04-27 21:35:16,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:16,590 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-27 21:35:16,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:16,591 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-27 21:35:16,604 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-27 21:35:16,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:35:16,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:16,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:35:16,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:35:16,605 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-27 21:35:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:16,911 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-27 21:35:16,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 21:35:16,911 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-27 21:35:16,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:16,911 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-27 21:35:16,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2022-04-27 21:35:16,912 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-27 21:35:16,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2022-04-27 21:35:16,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 79 transitions. [2022-04-27 21:35:16,963 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-27 21:35:16,964 INFO L225 Difference]: With dead ends: 72 [2022-04-27 21:35:16,964 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 21:35:16,964 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-27 21:35:16,965 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 67 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:16,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 121 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:16,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 21:35:16,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-04-27 21:35:16,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:16,985 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-27 21:35:16,985 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-27 21:35:16,986 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-27 21:35:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:16,987 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-27 21:35:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-27 21:35:16,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:16,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:16,987 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-27 21:35:16,988 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-27 21:35:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:16,989 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-27 21:35:16,989 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-27 21:35:16,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:16,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:16,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:16,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:16,990 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-27 21:35:16,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-04-27 21:35:16,991 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 18 [2022-04-27 21:35:16,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:16,991 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-04-27 21:35:16,991 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-27 21:35:16,991 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-27 21:35:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 21:35:16,991 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:16,991 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-27 21:35:16,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 21:35:16,992 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:16,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:16,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1682773732, now seen corresponding path program 1 times [2022-04-27 21:35:16,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:16,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776049890] [2022-04-27 21:35:16,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:16,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:17,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:17,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {5082#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {5073#true} is VALID [2022-04-27 21:35:17,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {5073#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5073#true} is VALID [2022-04-27 21:35:17,095 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5073#true} {5073#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5073#true} is VALID [2022-04-27 21:35:17,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {5073#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5082#(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-27 21:35:17,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {5082#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {5073#true} is VALID [2022-04-27 21:35:17,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {5073#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5073#true} is VALID [2022-04-27 21:35:17,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5073#true} {5073#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5073#true} is VALID [2022-04-27 21:35:17,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {5073#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5073#true} is VALID [2022-04-27 21:35:17,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {5073#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {5073#true} is VALID [2022-04-27 21:35:17,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {5073#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {5078#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:17,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {5078#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {5079#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:17,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {5079#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [195] L32-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_247_0~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_5 0))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[~__tmp_247_0~0] {5079#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:17,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {5079#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {5079#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:17,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {5079#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {5079#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:17,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {5079#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0) (not (= main_~main__tagbuf_len~0 0)))} [207] L54-->L196: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main__t~0_14 (+ v_main_~main__t~0_15 1)) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_15)) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0] {5080#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:17,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {5080#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [214] L196-->L102: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (not (= v_main_~main__t~0_19 v_main_~main__tagbuf_len~0_17)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_19, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17} OutVars{main_~main__t~0=v_main_~main__t~0_19, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {5080#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:17,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {5080#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [219] L102-->L106: Formula: (and (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_4~0] {5080#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:17,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {5080#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [230] L106-->L250: Formula: (= v_main_~main____CPAchecker_TMP_4~0_4 0) InVars {main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_4} OutVars{main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_4} AuxVars[] AssignedVars[] {5080#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:17,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {5080#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [244] L250-->L175: Formula: (and (= (ite (<= 0 v_main_~main__t~0_27) 1 0) v_main_~__tmp_9~0_1) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__t~0=v_main_~main__t~0_27} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__t~0=v_main_~main__t~0_27, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {5080#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:17,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {5080#(and (<= main_~main__t~0 1) (< 0 (+ main_~main__tagbuf_len~0 1)) (not (= main_~main__tagbuf_len~0 0)))} [258] L175-->L187: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0)) (= v_main_~__tmp_10~0_1 (ite (<= v_main_~main__t~0_28 v_main_~main__tagbuf_len~0_22) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_28, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_22} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~main__t~0=v_main_~main__t~0_28, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_22, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {5081#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-27 21:35:17,103 INFO L290 TraceCheckUtils]: 17: Hoare triple {5081#(not (= main_~__VERIFIER_assert__cond~9 0))} [271] L187-->L189: Formula: (= v_main_~__VERIFIER_assert__cond~9_3 0) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_3} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_3} AuxVars[] AssignedVars[] {5074#false} is VALID [2022-04-27 21:35:17,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {5074#false} [277] L189-->mainErr9ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5074#false} is VALID [2022-04-27 21:35:17,103 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-27 21:35:17,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:17,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776049890] [2022-04-27 21:35:17,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776049890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:17,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:17,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:35:17,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52698419] [2022-04-27 21:35:17,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:17,104 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-27 21:35:17,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:17,105 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-27 21:35:17,119 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-27 21:35:17,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:35:17,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:17,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:35:17,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:35:17,120 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-27 21:35:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:17,534 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-04-27 21:35:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:35:17,534 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-27 21:35:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:17,535 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-27 21:35:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-04-27 21:35:17,536 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-27 21:35:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-04-27 21:35:17,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 100 transitions. [2022-04-27 21:35:17,605 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-27 21:35:17,606 INFO L225 Difference]: With dead ends: 91 [2022-04-27 21:35:17,606 INFO L226 Difference]: Without dead ends: 89 [2022-04-27 21:35:17,607 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-27 21:35:17,607 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-27 21:35:17,607 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-27 21:35:17,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-27 21:35:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-04-27 21:35:17,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:17,628 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-27 21:35:17,629 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-27 21:35:17,629 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-27 21:35:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:17,630 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-04-27 21:35:17,630 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-04-27 21:35:17,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:17,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:17,631 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-27 21:35:17,631 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-27 21:35:17,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:17,633 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-04-27 21:35:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-04-27 21:35:17,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:17,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:17,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:17,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:17,633 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-27 21:35:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-04-27 21:35:17,634 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 19 [2022-04-27 21:35:17,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:17,635 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-04-27 21:35:17,635 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-27 21:35:17,635 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-04-27 21:35:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 21:35:17,635 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:17,635 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-27 21:35:17,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 21:35:17,636 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:17,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:17,636 INFO L85 PathProgramCache]: Analyzing trace with hash 596762259, now seen corresponding path program 1 times [2022-04-27 21:35:17,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:17,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417330097] [2022-04-27 21:35:17,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:17,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:17,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:17,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {5463#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {5456#true} is VALID [2022-04-27 21:35:17,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {5456#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5456#true} is VALID [2022-04-27 21:35:17,686 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5456#true} {5456#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5456#true} is VALID [2022-04-27 21:35:17,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {5456#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5463#(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-27 21:35:17,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {5463#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {5456#true} is VALID [2022-04-27 21:35:17,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {5456#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5456#true} is VALID [2022-04-27 21:35:17,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5456#true} {5456#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5456#true} is VALID [2022-04-27 21:35:17,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {5456#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5456#true} is VALID [2022-04-27 21:35:17,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {5456#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {5456#true} is VALID [2022-04-27 21:35:17,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {5456#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {5461#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:17,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {5461#(<= 0 main_~main__tagbuf_len~0)} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {5461#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:17,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {5461#(<= 0 main_~main__tagbuf_len~0)} [195] L32-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_247_0~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_5 0))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[~__tmp_247_0~0] {5461#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:17,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {5461#(<= 0 main_~main__tagbuf_len~0)} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {5461#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:17,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {5461#(<= 0 main_~main__tagbuf_len~0)} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {5461#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:17,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {5461#(<= 0 main_~main__tagbuf_len~0)} [207] L54-->L196: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main__t~0_14 (+ v_main_~main__t~0_15 1)) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_15)) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0] {5461#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:17,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {5461#(<= 0 main_~main__tagbuf_len~0)} [214] L196-->L102: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (not (= v_main_~main__t~0_19 v_main_~main__tagbuf_len~0_17)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_19, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17} OutVars{main_~main__t~0=v_main_~main__t~0_19, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {5461#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:17,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {5461#(<= 0 main_~main__tagbuf_len~0)} [219] L102-->L106: Formula: (and (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_4~0] {5461#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:17,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {5461#(<= 0 main_~main__tagbuf_len~0)} [229] L106-->L113: Formula: (and (= v_main_~__tmp_5~0_1 (ite (<= 0 v_main_~main__t~0_20) 1 0)) (not (= v_main_~main____CPAchecker_TMP_4~0_3 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__t~0=v_main_~main__t~0_20, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_20, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {5461#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:17,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {5461#(<= 0 main_~main__tagbuf_len~0)} [243] L113-->L125: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1) (= v_main_~__tmp_6~0_1 (ite (<= v_main_~main__t~0_21 v_main_~main__tagbuf_len~0_18) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_21, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18} OutVars{main_~main__t~0=v_main_~main__t~0_21, main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {5461#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:17,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {5461#(<= 0 main_~main__tagbuf_len~0)} [256] L125-->L134: Formula: (and (= v_main_~main____CPAchecker_TMP_5~0_1 v_main_~main__t~0_23) (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) (= (+ v_main_~main__t~0_23 1) v_main_~main__t~0_22)) InVars {main_~main__t~0=v_main_~main__t~0_23, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~main____CPAchecker_TMP_5~0=v_main_~main____CPAchecker_TMP_5~0_1, main_~main__t~0=v_main_~main__t~0_22, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_5~0] {5461#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:17,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {5461#(<= 0 main_~main__tagbuf_len~0)} [267] L134-->L141: Formula: (and (= v_main_~__tmp_7~0_1 (ite (<= 0 v_main_~main__t~0_24) 1 0)) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= v_main_~main__t~0_24 v_main_~main__tagbuf_len~0_19)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_19, main_~main__t~0=v_main_~main__t~0_24} OutVars{main_~main__t~0=v_main_~main__t~0_24, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_19, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {5462#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-27 21:35:17,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {5462#(not (= main_~__VERIFIER_assert__cond~6 0))} [275] L141-->L143: Formula: (= v_main_~__VERIFIER_assert__cond~6_3 0) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_3} OutVars{main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_3} AuxVars[] AssignedVars[] {5457#false} is VALID [2022-04-27 21:35:17,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {5457#false} [279] L143-->mainErr6ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5457#false} is VALID [2022-04-27 21:35:17,694 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-27 21:35:17,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:17,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417330097] [2022-04-27 21:35:17,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417330097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:17,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:17,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:35:17,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830557953] [2022-04-27 21:35:17,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:17,695 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-27 21:35:17,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:17,695 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-27 21:35:17,711 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-27 21:35:17,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:35:17,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:17,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:35:17,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:35:17,712 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-27 21:35:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:17,869 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-27 21:35:17,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:35:17,869 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-27 21:35:17,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:17,869 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-27 21:35:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-27 21:35:17,870 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-27 21:35:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-27 21:35:17,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-27 21:35:17,904 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-27 21:35:17,905 INFO L225 Difference]: With dead ends: 67 [2022-04-27 21:35:17,905 INFO L226 Difference]: Without dead ends: 65 [2022-04-27 21:35:17,906 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-27 21:35:17,906 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-27 21:35:17,906 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-27 21:35:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-27 21:35:17,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-27 21:35:17,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:17,932 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-27 21:35:17,932 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-27 21:35:17,933 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-27 21:35:17,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:17,934 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-27 21:35:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-04-27 21:35:17,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:17,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:17,934 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-27 21:35:17,935 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-27 21:35:17,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:17,936 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-27 21:35:17,936 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-04-27 21:35:17,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:17,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:17,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:17,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:17,936 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-27 21:35:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-04-27 21:35:17,937 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 20 [2022-04-27 21:35:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:17,938 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-04-27 21:35:17,938 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-27 21:35:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-04-27 21:35:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 21:35:17,938 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:17,938 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-27 21:35:17,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 21:35:17,938 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:17,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:17,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1319762151, now seen corresponding path program 1 times [2022-04-27 21:35:17,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:17,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471322320] [2022-04-27 21:35:17,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:17,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:17,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:17,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {5765#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {5758#true} is VALID [2022-04-27 21:35:17,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {5758#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5758#true} is VALID [2022-04-27 21:35:17,988 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5758#true} {5758#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5758#true} is VALID [2022-04-27 21:35:17,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {5758#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5765#(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-27 21:35:17,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {5765#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {5758#true} is VALID [2022-04-27 21:35:17,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {5758#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5758#true} is VALID [2022-04-27 21:35:17,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5758#true} {5758#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5758#true} is VALID [2022-04-27 21:35:17,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {5758#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5758#true} is VALID [2022-04-27 21:35:17,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {5758#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {5758#true} is VALID [2022-04-27 21:35:17,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {5758#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {5758#true} is VALID [2022-04-27 21:35:17,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {5758#true} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {5758#true} is VALID [2022-04-27 21:35:17,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {5758#true} [195] L32-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_247_0~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_5 0))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[~__tmp_247_0~0] {5758#true} is VALID [2022-04-27 21:35:17,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {5758#true} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {5758#true} is VALID [2022-04-27 21:35:17,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {5758#true} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {5758#true} is VALID [2022-04-27 21:35:17,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {5758#true} [207] L54-->L196: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main__t~0_14 (+ v_main_~main__t~0_15 1)) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_15)) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0] {5758#true} is VALID [2022-04-27 21:35:17,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {5758#true} [214] L196-->L102: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (not (= v_main_~main__t~0_19 v_main_~main__tagbuf_len~0_17)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_19, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17} OutVars{main_~main__t~0=v_main_~main__t~0_19, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {5758#true} is VALID [2022-04-27 21:35:17,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {5758#true} [219] L102-->L106: Formula: (and (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_4~0] {5758#true} is VALID [2022-04-27 21:35:17,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {5758#true} [229] L106-->L113: Formula: (and (= v_main_~__tmp_5~0_1 (ite (<= 0 v_main_~main__t~0_20) 1 0)) (not (= v_main_~main____CPAchecker_TMP_4~0_3 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__t~0=v_main_~main__t~0_20, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_20, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {5758#true} is VALID [2022-04-27 21:35:17,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {5758#true} [243] L113-->L125: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1) (= v_main_~__tmp_6~0_1 (ite (<= v_main_~main__t~0_21 v_main_~main__tagbuf_len~0_18) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_21, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18} OutVars{main_~main__t~0=v_main_~main__t~0_21, main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {5758#true} is VALID [2022-04-27 21:35:17,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {5758#true} [256] L125-->L134: Formula: (and (= v_main_~main____CPAchecker_TMP_5~0_1 v_main_~main__t~0_23) (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) (= (+ v_main_~main__t~0_23 1) v_main_~main__t~0_22)) InVars {main_~main__t~0=v_main_~main__t~0_23, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~main____CPAchecker_TMP_5~0=v_main_~main____CPAchecker_TMP_5~0_1, main_~main__t~0=v_main_~main__t~0_22, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_5~0] {5758#true} is VALID [2022-04-27 21:35:17,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {5758#true} [267] L134-->L141: Formula: (and (= v_main_~__tmp_7~0_1 (ite (<= 0 v_main_~main__t~0_24) 1 0)) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= v_main_~main__t~0_24 v_main_~main__tagbuf_len~0_19)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_19, main_~main__t~0=v_main_~main__t~0_24} OutVars{main_~main__t~0=v_main_~main__t~0_24, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_19, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {5763#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:17,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {5763#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [276] L141-->L153: Formula: (and (= (ite (<= v_main_~main__t~0_25 v_main_~main__tagbuf_len~0_20) 1 0) v_main_~__tmp_8~0_1) (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_20, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_20, main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {5764#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-27 21:35:17,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {5764#(not (= main_~__VERIFIER_assert__cond~7 0))} [281] L153-->L155: Formula: (= v_main_~__VERIFIER_assert__cond~7_3 0) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_3} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_3} AuxVars[] AssignedVars[] {5759#false} is VALID [2022-04-27 21:35:17,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {5759#false} [283] L155-->mainErr7ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5759#false} is VALID [2022-04-27 21:35:17,994 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-27 21:35:17,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:17,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471322320] [2022-04-27 21:35:17,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471322320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:17,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:17,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:35:17,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749844944] [2022-04-27 21:35:17,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:17,995 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-27 21:35:17,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:17,995 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-27 21:35:18,008 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-27 21:35:18,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:35:18,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:18,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:35:18,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:35:18,009 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-27 21:35:18,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:18,189 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-27 21:35:18,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:35:18,189 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-27 21:35:18,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:18,190 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-27 21:35:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-27 21:35:18,191 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-27 21:35:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-27 21:35:18,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-27 21:35:18,231 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-27 21:35:18,232 INFO L225 Difference]: With dead ends: 65 [2022-04-27 21:35:18,232 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 21:35:18,232 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-27 21:35:18,233 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.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:18,233 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.1s Time] [2022-04-27 21:35:18,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 21:35:18,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-27 21:35:18,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:18,261 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-27 21:35:18,261 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-27 21:35:18,261 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-27 21:35:18,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:18,262 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-27 21:35:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-27 21:35:18,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:18,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:18,263 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-27 21:35:18,263 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-27 21:35:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:18,264 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-27 21:35:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-27 21:35:18,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:18,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:18,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:18,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:18,265 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-27 21:35:18,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-04-27 21:35:18,265 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 21 [2022-04-27 21:35:18,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:18,266 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-04-27 21:35:18,266 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-27 21:35:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-04-27 21:35:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:35:18,266 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:18,266 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-27 21:35:18,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 21:35:18,267 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:18,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:18,267 INFO L85 PathProgramCache]: Analyzing trace with hash -2037098268, now seen corresponding path program 1 times [2022-04-27 21:35:18,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:18,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953169123] [2022-04-27 21:35:18,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:18,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:18,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:18,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {6056#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6047#true} is VALID [2022-04-27 21:35:18,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {6047#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6047#true} is VALID [2022-04-27 21:35:18,333 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6047#true} {6047#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6047#true} is VALID [2022-04-27 21:35:18,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {6047#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6056#(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-27 21:35:18,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {6056#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6047#true} is VALID [2022-04-27 21:35:18,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {6047#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6047#true} is VALID [2022-04-27 21:35:18,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6047#true} {6047#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6047#true} is VALID [2022-04-27 21:35:18,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {6047#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6047#true} is VALID [2022-04-27 21:35:18,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {6047#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {6047#true} is VALID [2022-04-27 21:35:18,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {6047#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {6047#true} is VALID [2022-04-27 21:35:18,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {6047#true} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {6047#true} is VALID [2022-04-27 21:35:18,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {6047#true} [195] L32-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_247_0~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_5 0))) InVars {main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[~__tmp_247_0~0] {6047#true} is VALID [2022-04-27 21:35:18,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {6047#true} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {6047#true} is VALID [2022-04-27 21:35:18,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {6047#true} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {6047#true} is VALID [2022-04-27 21:35:18,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {6047#true} [207] L54-->L196: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main__t~0_14 (+ v_main_~main__t~0_15 1)) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_15)) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0] {6047#true} is VALID [2022-04-27 21:35:18,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {6047#true} [214] L196-->L102: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (not (= v_main_~main__t~0_19 v_main_~main__tagbuf_len~0_17)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_19, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17} OutVars{main_~main__t~0=v_main_~main__t~0_19, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {6052#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:18,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {6052#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [219] L102-->L106: Formula: (and (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_4~0] {6052#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:18,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {6052#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [229] L106-->L113: Formula: (and (= v_main_~__tmp_5~0_1 (ite (<= 0 v_main_~main__t~0_20) 1 0)) (not (= v_main_~main____CPAchecker_TMP_4~0_3 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__t~0=v_main_~main__t~0_20, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_20, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {6052#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:18,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {6052#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [243] L113-->L125: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1) (= v_main_~__tmp_6~0_1 (ite (<= v_main_~main__t~0_21 v_main_~main__tagbuf_len~0_18) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_21, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18} OutVars{main_~main__t~0=v_main_~main__t~0_21, main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {6053#(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-27 21:35:18,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {6053#(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)))} [256] L125-->L134: Formula: (and (= v_main_~main____CPAchecker_TMP_5~0_1 v_main_~main__t~0_23) (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) (= (+ v_main_~main__t~0_23 1) v_main_~main__t~0_22)) InVars {main_~main__t~0=v_main_~main__t~0_23, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~main____CPAchecker_TMP_5~0=v_main_~main____CPAchecker_TMP_5~0_1, main_~main__t~0=v_main_~main__t~0_22, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_5~0] {6054#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:18,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {6054#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [268] L134-->L250: Formula: (not (= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_21)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21, main_~main__t~0=v_main_~main__t~0_26} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21, main_~main__t~0=v_main_~main__t~0_26} AuxVars[] AssignedVars[] {6054#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:18,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {6054#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [244] L250-->L175: Formula: (and (= (ite (<= 0 v_main_~main__t~0_27) 1 0) v_main_~__tmp_9~0_1) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__t~0=v_main_~main__t~0_27} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__t~0=v_main_~main__t~0_27, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {6054#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:18,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {6054#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [258] L175-->L187: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0)) (= v_main_~__tmp_10~0_1 (ite (<= v_main_~main__t~0_28 v_main_~main__tagbuf_len~0_22) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_28, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_22} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~main__t~0=v_main_~main__t~0_28, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_22, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {6055#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-27 21:35:18,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {6055#(not (= main_~__VERIFIER_assert__cond~9 0))} [271] L187-->L189: Formula: (= v_main_~__VERIFIER_assert__cond~9_3 0) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_3} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_3} AuxVars[] AssignedVars[] {6048#false} is VALID [2022-04-27 21:35:18,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {6048#false} [277] L189-->mainErr9ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6048#false} is VALID [2022-04-27 21:35:18,339 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-27 21:35:18,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:18,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953169123] [2022-04-27 21:35:18,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953169123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:18,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:18,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:35:18,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498370248] [2022-04-27 21:35:18,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:18,340 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-27 21:35:18,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:18,340 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-27 21:35:18,355 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-27 21:35:18,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:35:18,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:18,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:35:18,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:35:18,356 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-27 21:35:18,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:18,678 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2022-04-27 21:35:18,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:35:18,679 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-27 21:35:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:18,679 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-27 21:35:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-27 21:35:18,680 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-27 21:35:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-27 21:35:18,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2022-04-27 21:35:18,722 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-27 21:35:18,723 INFO L225 Difference]: With dead ends: 76 [2022-04-27 21:35:18,723 INFO L226 Difference]: Without dead ends: 74 [2022-04-27 21:35:18,723 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-27 21:35:18,724 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-27 21:35:18,724 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-27 21:35:18,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-27 21:35:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2022-04-27 21:35:18,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:18,750 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-27 21:35:18,750 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-27 21:35:18,750 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-27 21:35:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:18,751 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-04-27 21:35:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-04-27 21:35:18,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:18,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:18,752 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-27 21:35:18,752 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-27 21:35:18,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:18,753 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2022-04-27 21:35:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-04-27 21:35:18,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:18,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:18,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:18,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:18,754 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-27 21:35:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-04-27 21:35:18,755 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 22 [2022-04-27 21:35:18,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:18,755 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-04-27 21:35:18,755 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-27 21:35:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-04-27 21:35:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:35:18,756 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:18,756 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-27 21:35:18,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 21:35:18,756 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:18,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:18,756 INFO L85 PathProgramCache]: Analyzing trace with hash 319828265, now seen corresponding path program 1 times [2022-04-27 21:35:18,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:18,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495253125] [2022-04-27 21:35:18,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:18,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:18,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:18,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {6388#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6378#true} is VALID [2022-04-27 21:35:18,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {6378#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6378#true} is VALID [2022-04-27 21:35:18,853 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6378#true} {6378#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6378#true} is VALID [2022-04-27 21:35:18,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {6378#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6388#(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-27 21:35:18,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {6388#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6378#true} is VALID [2022-04-27 21:35:18,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {6378#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6378#true} is VALID [2022-04-27 21:35:18,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6378#true} {6378#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6378#true} is VALID [2022-04-27 21:35:18,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {6378#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6378#true} is VALID [2022-04-27 21:35:18,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {6378#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {6378#true} is VALID [2022-04-27 21:35:18,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {6378#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {6378#true} is VALID [2022-04-27 21:35:18,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {6378#true} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {6378#true} is VALID [2022-04-27 21:35:18,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {6378#true} [196] L32-->L266: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_3) (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_33) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {6378#true} is VALID [2022-04-27 21:35:18,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {6378#true} [199] L266-->L277: Formula: (and (= (ite (<= v_main_~main__t~0_1 v_main_~main__tagbuf_len~0_1) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_2 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {6378#true} is VALID [2022-04-27 21:35:18,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {6378#true} [203] L277-->L357: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_1 v_~__tmp_383_0~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0))) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {6378#true} is VALID [2022-04-27 21:35:18,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {6378#true} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {6378#true} is VALID [2022-04-27 21:35:18,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {6378#true} [216] L289-->L325: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_11)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6383#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:18,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {6383#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [224] L325-->L337: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_4 0) (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_13) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__t~0=v_main_~main__t~0_13, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {6383#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:18,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {6383#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [238] L337-->L349: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= (ite (<= v_main_~main__t~0_16 v_main_~main__tagbuf_len~0_13) 1 0) v_main_~__tmp_18~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13} OutVars{main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {6384#(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-27 21:35:18,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {6384#(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))))} [252] L349-->L357: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~17_4 0)) (= v_main_~main____CPAchecker_TMP_0~1_5 v_~__tmp_383_0~0_3)) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, ~__tmp_383_0~0=v_~__tmp_383_0~0_3, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[~__tmp_383_0~0] {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:18,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {6386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:18,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {6386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [216] L289-->L325: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_11)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:18,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {6386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [224] L325-->L337: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_4 0) (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_13) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__t~0=v_main_~main__t~0_13, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {6386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:18,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {6386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [238] L337-->L349: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= (ite (<= v_main_~main__t~0_16 v_main_~main__tagbuf_len~0_13) 1 0) v_main_~__tmp_18~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13} OutVars{main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {6387#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2022-04-27 21:35:18,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {6387#(not (= main_~__VERIFIER_assert__cond~17 0))} [251] L349-->L351: Formula: (= v_main_~__VERIFIER_assert__cond~17_3 0) InVars {main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_3} OutVars{main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_3} AuxVars[] AssignedVars[] {6379#false} is VALID [2022-04-27 21:35:18,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {6379#false} [263] L351-->mainErr16ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6379#false} is VALID [2022-04-27 21:35:18,868 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-27 21:35:18,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:18,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495253125] [2022-04-27 21:35:18,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495253125] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:35:18,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252233842] [2022-04-27 21:35:18,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:18,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:35:18,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:35:18,879 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-27 21:35:18,879 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-27 21:35:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:18,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 21:35:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:18,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:35:19,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {6378#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6378#true} is VALID [2022-04-27 21:35:19,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {6378#true} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6378#true} is VALID [2022-04-27 21:35:19,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {6378#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6378#true} is VALID [2022-04-27 21:35:19,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6378#true} {6378#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6378#true} is VALID [2022-04-27 21:35:19,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {6378#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6378#true} is VALID [2022-04-27 21:35:19,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {6378#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {6378#true} is VALID [2022-04-27 21:35:19,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {6378#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {6410#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} is VALID [2022-04-27 21:35:19,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {6410#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {6414#(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-27 21:35:19,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {6414#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} [196] L32-->L266: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_3) (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_33) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {6414#(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-27 21:35:19,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {6414#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} [199] L266-->L277: Formula: (and (= (ite (<= v_main_~main__t~0_1 v_main_~main__tagbuf_len~0_1) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_2 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {6414#(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-27 21:35:19,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {6414#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} [203] L277-->L357: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_1 v_~__tmp_383_0~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0))) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {6414#(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-27 21:35:19,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {6414#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {6427#(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-27 21:35:19,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {6427#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} [216] L289-->L325: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_11)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6431#(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-27 21:35:19,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {6431#(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)))} [224] L325-->L337: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_4 0) (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_13) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__t~0=v_main_~main__t~0_13, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {6431#(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-27 21:35:19,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {6431#(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)))} [238] L337-->L349: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= (ite (<= v_main_~main__t~0_16 v_main_~main__tagbuf_len~0_13) 1 0) v_main_~__tmp_18~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13} OutVars{main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {6431#(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-27 21:35:19,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {6431#(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)))} [252] L349-->L357: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~17_4 0)) (= v_main_~main____CPAchecker_TMP_0~1_5 v_~__tmp_383_0~0_3)) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, ~__tmp_383_0~0=v_~__tmp_383_0~0_3, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[~__tmp_383_0~0] {6431#(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-27 21:35:19,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {6431#(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)))} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {6444#(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-27 21:35:19,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {6444#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} [216] L289-->L325: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_11)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6444#(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-27 21:35:19,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {6444#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} [224] L325-->L337: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_4 0) (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_13) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__t~0=v_main_~main__t~0_13, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {6444#(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-27 21:35:19,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {6444#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} [238] L337-->L349: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= (ite (<= v_main_~main__t~0_16 v_main_~main__tagbuf_len~0_13) 1 0) v_main_~__tmp_18~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13} OutVars{main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {6454#(<= 1 main_~__VERIFIER_assert__cond~17)} is VALID [2022-04-27 21:35:19,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {6454#(<= 1 main_~__VERIFIER_assert__cond~17)} [251] L349-->L351: Formula: (= v_main_~__VERIFIER_assert__cond~17_3 0) InVars {main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_3} OutVars{main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_3} AuxVars[] AssignedVars[] {6379#false} is VALID [2022-04-27 21:35:19,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {6379#false} [263] L351-->mainErr16ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6379#false} is VALID [2022-04-27 21:35:19,648 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-27 21:35:19,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:35:19,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {6379#false} [263] L351-->mainErr16ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6379#false} is VALID [2022-04-27 21:35:19,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {6454#(<= 1 main_~__VERIFIER_assert__cond~17)} [251] L349-->L351: Formula: (= v_main_~__VERIFIER_assert__cond~17_3 0) InVars {main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_3} OutVars{main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_3} AuxVars[] AssignedVars[] {6379#false} is VALID [2022-04-27 21:35:19,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {6386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [238] L337-->L349: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= (ite (<= v_main_~main__t~0_16 v_main_~main__tagbuf_len~0_13) 1 0) v_main_~__tmp_18~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13} OutVars{main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {6454#(<= 1 main_~__VERIFIER_assert__cond~17)} is VALID [2022-04-27 21:35:19,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {6386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [224] L325-->L337: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_4 0) (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_13) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__t~0=v_main_~main__t~0_13, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {6386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:19,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {6386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [216] L289-->L325: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_11)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:19,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {6386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:19,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [252] L349-->L357: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~17_4 0)) (= v_main_~main____CPAchecker_TMP_0~1_5 v_~__tmp_383_0~0_3)) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, ~__tmp_383_0~0=v_~__tmp_383_0~0_3, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[~__tmp_383_0~0] {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:19,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [238] L337-->L349: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= (ite (<= v_main_~main__t~0_16 v_main_~main__tagbuf_len~0_13) 1 0) v_main_~__tmp_18~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13} OutVars{main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:19,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [224] L325-->L337: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_4 0) (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_13) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__t~0=v_main_~main__t~0_13, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:19,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {6386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [216] L289-->L325: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_11)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:19,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {6386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:19,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [203] L277-->L357: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_1 v_~__tmp_383_0~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0))) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:19,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [199] L266-->L277: Formula: (and (= (ite (<= v_main_~main__t~0_1 v_main_~main__tagbuf_len~0_1) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_2 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:19,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [196] L32-->L266: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_3) (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_33) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:19,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {6386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {6385#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:19,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {6378#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {6386#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:19,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {6378#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {6378#true} is VALID [2022-04-27 21:35:19,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {6378#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6378#true} is VALID [2022-04-27 21:35:19,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6378#true} {6378#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6378#true} is VALID [2022-04-27 21:35:19,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {6378#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6378#true} is VALID [2022-04-27 21:35:19,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {6378#true} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6378#true} is VALID [2022-04-27 21:35:19,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {6378#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6378#true} is VALID [2022-04-27 21:35:19,826 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-27 21:35:19,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252233842] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:35:19,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:35:19,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-27 21:35:19,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413137401] [2022-04-27 21:35:19,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:35:19,829 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 21:35:19,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:19,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:19,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:19,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 21:35:19,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:19,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 21:35:19,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-27 21:35:19,863 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:20,661 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-04-27 21:35:20,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 21:35:20,662 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 21:35:20,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:20,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:20,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 115 transitions. [2022-04-27 21:35:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 115 transitions. [2022-04-27 21:35:20,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 115 transitions. [2022-04-27 21:35:20,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:20,767 INFO L225 Difference]: With dead ends: 102 [2022-04-27 21:35:20,767 INFO L226 Difference]: Without dead ends: 100 [2022-04-27 21:35:20,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-04-27 21:35:20,768 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 356 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:20,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 120 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:35:20,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-27 21:35:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 52. [2022-04-27 21:35:20,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:20,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 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-27 21:35:20,804 INFO L74 IsIncluded]: Start isIncluded. First operand 100 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-27 21:35:20,805 INFO L87 Difference]: Start difference. First operand 100 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-27 21:35:20,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:20,806 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-04-27 21:35:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2022-04-27 21:35:20,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:20,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:20,807 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 100 states. [2022-04-27 21:35:20,807 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 100 states. [2022-04-27 21:35:20,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:20,808 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-04-27 21:35:20,808 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2022-04-27 21:35:20,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:20,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:20,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:20,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:20,809 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-27 21:35:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-27 21:35:20,810 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 22 [2022-04-27 21:35:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:20,810 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-27 21:35:20,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 21:35:20,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 21:35:20,811 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:20,811 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-27 21:35:20,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 21:35:21,034 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-27 21:35:21,034 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:21,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:21,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1322547065, now seen corresponding path program 1 times [2022-04-27 21:35:21,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:21,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377337501] [2022-04-27 21:35:21,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:21,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:21,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:21,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {6939#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6929#true} is VALID [2022-04-27 21:35:21,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {6929#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6929#true} is VALID [2022-04-27 21:35:21,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6929#true} {6929#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6929#true} is VALID [2022-04-27 21:35:21,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {6929#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6939#(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-27 21:35:21,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {6939#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6929#true} is VALID [2022-04-27 21:35:21,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {6929#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6929#true} is VALID [2022-04-27 21:35:21,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6929#true} {6929#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6929#true} is VALID [2022-04-27 21:35:21,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {6929#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6929#true} is VALID [2022-04-27 21:35:21,111 INFO L290 TraceCheckUtils]: 5: Hoare triple {6929#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {6929#true} is VALID [2022-04-27 21:35:21,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {6929#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {6929#true} is VALID [2022-04-27 21:35:21,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {6929#true} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {6929#true} is VALID [2022-04-27 21:35:21,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {6929#true} [196] L32-->L266: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_3) (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_33) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {6929#true} is VALID [2022-04-27 21:35:21,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {6929#true} [199] L266-->L277: Formula: (and (= (ite (<= v_main_~main__t~0_1 v_main_~main__tagbuf_len~0_1) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_2 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {6929#true} is VALID [2022-04-27 21:35:21,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {6929#true} [203] L277-->L357: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_1 v_~__tmp_383_0~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0))) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {6929#true} is VALID [2022-04-27 21:35:21,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {6929#true} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {6929#true} is VALID [2022-04-27 21:35:21,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {6929#true} [216] L289-->L325: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_11)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6934#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:21,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {6934#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [224] L325-->L337: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_4 0) (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_13) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__t~0=v_main_~main__t~0_13, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {6934#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:21,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {6934#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [238] L337-->L349: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= (ite (<= v_main_~main__t~0_16 v_main_~main__tagbuf_len~0_13) 1 0) v_main_~__tmp_18~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13} OutVars{main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {6935#(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-27 21:35:21,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {6935#(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))))} [252] L349-->L357: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~17_4 0)) (= v_main_~main____CPAchecker_TMP_0~1_5 v_~__tmp_383_0~0_3)) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, ~__tmp_383_0~0=v_~__tmp_383_0~0_3, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[~__tmp_383_0~0] {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:21,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:21,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [216] L289-->L325: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_11)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:21,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [223] L325-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_3 v_~__tmp_247_0~0_3) (not (= v_main_~main____CPAchecker_TMP_0~1_3 0))) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_3, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} AuxVars[] AssignedVars[~__tmp_247_0~0] {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:21,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:21,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {6938#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-27 21:35:21,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {6938#(not (= main_~__VERIFIER_assert__cond~1 0))} [206] L54-->L56: Formula: (= v_main_~__VERIFIER_assert__cond~1_3 0) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} AuxVars[] AssignedVars[] {6930#false} is VALID [2022-04-27 21:35:21,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {6930#false} [211] L56-->mainErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6930#false} is VALID [2022-04-27 21:35:21,117 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-27 21:35:21,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:21,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377337501] [2022-04-27 21:35:21,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377337501] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:35:21,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191902834] [2022-04-27 21:35:21,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:21,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:35:21,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:35:21,119 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-27 21:35:21,120 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-27 21:35:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:21,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 21:35:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:21,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:35:21,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {6929#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6929#true} is VALID [2022-04-27 21:35:21,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {6929#true} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6929#true} is VALID [2022-04-27 21:35:21,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {6929#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6929#true} is VALID [2022-04-27 21:35:21,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6929#true} {6929#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6929#true} is VALID [2022-04-27 21:35:21,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {6929#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6929#true} is VALID [2022-04-27 21:35:21,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {6929#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {6929#true} is VALID [2022-04-27 21:35:21,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {6929#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {6961#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} is VALID [2022-04-27 21:35:21,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {6961#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {6965#(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-27 21:35:21,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {6965#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} [196] L32-->L266: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_3) (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_33) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {6965#(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-27 21:35:21,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {6965#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} [199] L266-->L277: Formula: (and (= (ite (<= v_main_~main__t~0_1 v_main_~main__tagbuf_len~0_1) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_2 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {6965#(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-27 21:35:21,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {6965#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} [203] L277-->L357: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_1 v_~__tmp_383_0~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0))) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {6965#(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-27 21:35:21,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {6965#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {6978#(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-27 21:35:21,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {6978#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} [216] L289-->L325: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_11)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6982#(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-27 21:35:21,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {6982#(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)))} [224] L325-->L337: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_4 0) (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_13) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__t~0=v_main_~main__t~0_13, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {6982#(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-27 21:35:21,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {6982#(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)))} [238] L337-->L349: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= (ite (<= v_main_~main__t~0_16 v_main_~main__tagbuf_len~0_13) 1 0) v_main_~__tmp_18~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13} OutVars{main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {6982#(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-27 21:35:21,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {6982#(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)))} [252] L349-->L357: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~17_4 0)) (= v_main_~main____CPAchecker_TMP_0~1_5 v_~__tmp_383_0~0_3)) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, ~__tmp_383_0~0=v_~__tmp_383_0~0_3, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[~__tmp_383_0~0] {6982#(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-27 21:35:21,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {6982#(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)))} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {6995#(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-27 21:35:21,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {6995#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} [216] L289-->L325: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_11)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6995#(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-27 21:35:21,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {6995#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} [223] L325-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_3 v_~__tmp_247_0~0_3) (not (= v_main_~main____CPAchecker_TMP_0~1_3 0))) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_3, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} AuxVars[] AssignedVars[~__tmp_247_0~0] {6995#(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-27 21:35:21,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {6995#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {6995#(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-27 21:35:21,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {6995#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {7008#(<= 1 main_~__VERIFIER_assert__cond~1)} is VALID [2022-04-27 21:35:21,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {7008#(<= 1 main_~__VERIFIER_assert__cond~1)} [206] L54-->L56: Formula: (= v_main_~__VERIFIER_assert__cond~1_3 0) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} AuxVars[] AssignedVars[] {6930#false} is VALID [2022-04-27 21:35:21,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {6930#false} [211] L56-->mainErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6930#false} is VALID [2022-04-27 21:35:21,733 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-27 21:35:21,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:35:21,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {6930#false} [211] L56-->mainErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6930#false} is VALID [2022-04-27 21:35:21,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {7008#(<= 1 main_~__VERIFIER_assert__cond~1)} [206] L54-->L56: Formula: (= v_main_~__VERIFIER_assert__cond~1_3 0) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} AuxVars[] AssignedVars[] {6930#false} is VALID [2022-04-27 21:35:21,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {7008#(<= 1 main_~__VERIFIER_assert__cond~1)} is VALID [2022-04-27 21:35:21,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:21,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [223] L325-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_3 v_~__tmp_247_0~0_3) (not (= v_main_~main____CPAchecker_TMP_0~1_3 0))) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_3, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} AuxVars[] AssignedVars[~__tmp_247_0~0] {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:21,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [216] L289-->L325: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_11)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:21,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:21,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [252] L349-->L357: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~17_4 0)) (= v_main_~main____CPAchecker_TMP_0~1_5 v_~__tmp_383_0~0_3)) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, ~__tmp_383_0~0=v_~__tmp_383_0~0_3, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[~__tmp_383_0~0] {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:21,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [238] L337-->L349: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= (ite (<= v_main_~main__t~0_16 v_main_~main__tagbuf_len~0_13) 1 0) v_main_~__tmp_18~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13} OutVars{main_~main__t~0=v_main_~main__t~0_16, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:21,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [224] L325-->L337: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_4 0) (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_13) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__t~0=v_main_~main__t~0_13, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_13, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:21,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [216] L289-->L325: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_11)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:21,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:21,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [203] L277-->L357: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_1 v_~__tmp_383_0~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0))) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:21,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [199] L266-->L277: Formula: (and (= (ite (<= v_main_~main__t~0_1 v_main_~main__tagbuf_len~0_1) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_2 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:21,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [196] L32-->L266: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_3) (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_33) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:21,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {6936#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:21,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {6929#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {6937#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:21,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {6929#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {6929#true} is VALID [2022-04-27 21:35:21,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {6929#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6929#true} is VALID [2022-04-27 21:35:21,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6929#true} {6929#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6929#true} is VALID [2022-04-27 21:35:21,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {6929#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6929#true} is VALID [2022-04-27 21:35:21,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {6929#true} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6929#true} is VALID [2022-04-27 21:35:21,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {6929#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6929#true} is VALID [2022-04-27 21:35:21,914 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-27 21:35:21,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191902834] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:35:21,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:35:21,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-27 21:35:21,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198632363] [2022-04-27 21:35:21,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:35:21,919 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 21:35:21,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:21,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:21,952 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-27 21:35:21,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 21:35:21,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:21,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 21:35:21,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-27 21:35:21,953 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:22,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:22,560 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-04-27 21:35:22,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-27 21:35:22,560 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 21:35:22,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:22,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:22,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2022-04-27 21:35:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2022-04-27 21:35:22,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 93 transitions. [2022-04-27 21:35:22,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:22,644 INFO L225 Difference]: With dead ends: 82 [2022-04-27 21:35:22,644 INFO L226 Difference]: Without dead ends: 80 [2022-04-27 21:35:22,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2022-04-27 21:35:22,645 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 325 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:22,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 78 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:22,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-27 21:35:22,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 44. [2022-04-27 21:35:22,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:22,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 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-27 21:35:22,676 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 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-27 21:35:22,676 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 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-27 21:35:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:22,678 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2022-04-27 21:35:22,678 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2022-04-27 21:35:22,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:22,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:22,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 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 80 states. [2022-04-27 21:35:22,678 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 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 80 states. [2022-04-27 21:35:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:22,680 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2022-04-27 21:35:22,680 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2022-04-27 21:35:22,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:22,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:22,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:22,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 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-27 21:35:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-04-27 21:35:22,681 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 23 [2022-04-27 21:35:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:22,681 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-04-27 21:35:22,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:22,681 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-27 21:35:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 21:35:22,682 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:22,682 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-27 21:35:22,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 21:35:22,891 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,SelfDestructingSolverStorable20 [2022-04-27 21:35:22,892 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:22,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:22,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1198767470, now seen corresponding path program 1 times [2022-04-27 21:35:22,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:22,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708290968] [2022-04-27 21:35:22,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:22,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:22,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:22,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {7426#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {7417#true} is VALID [2022-04-27 21:35:22,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {7417#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7417#true} is VALID [2022-04-27 21:35:22,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7417#true} {7417#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7417#true} is VALID [2022-04-27 21:35:22,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {7417#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7426#(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-27 21:35:22,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {7426#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {7417#true} is VALID [2022-04-27 21:35:22,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {7417#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7417#true} is VALID [2022-04-27 21:35:22,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7417#true} {7417#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7417#true} is VALID [2022-04-27 21:35:22,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {7417#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7417#true} is VALID [2022-04-27 21:35:22,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {7417#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {7417#true} is VALID [2022-04-27 21:35:22,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {7417#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {7417#true} is VALID [2022-04-27 21:35:22,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {7417#true} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {7417#true} is VALID [2022-04-27 21:35:22,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {7417#true} [196] L32-->L266: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_3) (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_33) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {7417#true} is VALID [2022-04-27 21:35:22,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {7417#true} [199] L266-->L277: Formula: (and (= (ite (<= v_main_~main__t~0_1 v_main_~main__tagbuf_len~0_1) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_2 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {7417#true} is VALID [2022-04-27 21:35:22,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {7417#true} [203] L277-->L357: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_1 v_~__tmp_383_0~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0))) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {7417#true} is VALID [2022-04-27 21:35:22,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {7417#true} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {7417#true} is VALID [2022-04-27 21:35:22,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {7417#true} [216] L289-->L325: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_11)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {7422#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:22,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {7422#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [223] L325-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_3 v_~__tmp_247_0~0_3) (not (= v_main_~main____CPAchecker_TMP_0~1_3 0))) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_3, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} AuxVars[] AssignedVars[~__tmp_247_0~0] {7422#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:22,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {7422#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {7422#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:22,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {7422#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {7423#(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-27 21:35:22,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {7423#(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))))} [207] L54-->L196: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main__t~0_14 (+ v_main_~main__t~0_15 1)) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_15)) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0] {7424#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:22,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {7424#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [214] L196-->L102: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (not (= v_main_~main__t~0_19 v_main_~main__tagbuf_len~0_17)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_19, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17} OutVars{main_~main__t~0=v_main_~main__t~0_19, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {7424#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:22,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {7424#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [219] L102-->L106: Formula: (and (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_4~0_1 |v_main_#t~nondet7_2|) (<= |v_main_#t~nondet7_2| 2147483647)) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_4~0] {7424#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:22,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {7424#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [229] L106-->L113: Formula: (and (= v_main_~__tmp_5~0_1 (ite (<= 0 v_main_~main__t~0_20) 1 0)) (not (= v_main_~main____CPAchecker_TMP_4~0_3 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__t~0=v_main_~main__t~0_20, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_20, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {7424#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:22,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {7424#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [243] L113-->L125: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1) (= v_main_~__tmp_6~0_1 (ite (<= v_main_~main__t~0_21 v_main_~main__tagbuf_len~0_18) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_21, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18} OutVars{main_~main__t~0=v_main_~main__t~0_21, main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {7425#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-27 21:35:22,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {7425#(not (= main_~__VERIFIER_assert__cond~5 0))} [255] L125-->L127: Formula: (= v_main_~__VERIFIER_assert__cond~5_3 0) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_3} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_3} AuxVars[] AssignedVars[] {7418#false} is VALID [2022-04-27 21:35:22,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {7418#false} [265] L127-->mainErr5ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7418#false} is VALID [2022-04-27 21:35:22,969 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-27 21:35:22,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:22,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708290968] [2022-04-27 21:35:22,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708290968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:22,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:22,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:35:22,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097080334] [2022-04-27 21:35:22,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:22,970 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-27 21:35:22,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:22,971 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-27 21:35:22,986 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-27 21:35:22,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:35:22,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:22,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:35:22,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:35:22,987 INFO L87 Difference]: Start difference. First operand 44 states and 50 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-27 21:35:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:23,308 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-04-27 21:35:23,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:35:23,308 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-27 21:35:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:23,309 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-27 21:35:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2022-04-27 21:35:23,310 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-27 21:35:23,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2022-04-27 21:35:23,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 53 transitions. [2022-04-27 21:35:23,349 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-27 21:35:23,350 INFO L225 Difference]: With dead ends: 56 [2022-04-27 21:35:23,350 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 21:35:23,350 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-27 21:35:23,351 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 63 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:23,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 53 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:23,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 21:35:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2022-04-27 21:35:23,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:23,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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-27 21:35:23,382 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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-27 21:35:23,382 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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-27 21:35:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:23,383 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-27 21:35:23,383 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-27 21:35:23,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:23,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:23,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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 54 states. [2022-04-27 21:35:23,384 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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 54 states. [2022-04-27 21:35:23,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:23,385 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-27 21:35:23,385 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-27 21:35:23,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:23,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:23,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:23,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:23,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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-27 21:35:23,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-04-27 21:35:23,386 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2022-04-27 21:35:23,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:23,387 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-04-27 21:35:23,387 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-27 21:35:23,387 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-27 21:35:23,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 21:35:23,387 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:23,387 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-27 21:35:23,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 21:35:23,387 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-04-27 21:35:23,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:23,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1199753650, now seen corresponding path program 1 times [2022-04-27 21:35:23,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:23,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236639402] [2022-04-27 21:35:23,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:23,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:23,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:23,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {7674#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {7665#true} is VALID [2022-04-27 21:35:23,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {7665#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7665#true} is VALID [2022-04-27 21:35:23,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7665#true} {7665#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7665#true} is VALID [2022-04-27 21:35:23,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {7665#true} [184] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7674#(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-27 21:35:23,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {7674#(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|))} [186] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= v_~__tmp_247_0~0_4 0) (= (select |v_#length_1| 3) 12) (= v_~__return_main~0_21 0) (= (select |v_#valid_1| 1) 1) (= v_~__return_305~0_2 0) (= (select |v_#length_1| 2) 33) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= v_~__tmp_383_0~0_4 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_4, ~__return_main~0=v_~__return_main~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__tmp_383_0~0=v_~__tmp_383_0~0_4, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, ~__return_305~0=v_~__return_305~0_2, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~__tmp_247_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {7665#true} is VALID [2022-04-27 21:35:23,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {7665#true} [189] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7665#true} is VALID [2022-04-27 21:35:23,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7665#true} {7665#true} [285] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7665#true} is VALID [2022-04-27 21:35:23,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {7665#true} [185] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7665#true} is VALID [2022-04-27 21:35:23,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {7665#true} [188] mainENTRY-->L20: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_2)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_2, main_~main__t~0=v_main_~main__t~0_4} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {7665#true} is VALID [2022-04-27 21:35:23,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {7665#true} [190] L20-->L24: Formula: (and (= (+ (- 1) v_main_~main__tagbuf_len~0_7) v_main_~main__tagbuf_len~0_6) (= 0 v_main_~main__t~0_6) (<= 1 v_main_~main__tagbuf_len~0_7)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_6, main_~main__t~0=v_main_~main__t~0_6} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {7665#true} is VALID [2022-04-27 21:35:23,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {7665#true} [193] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (not (= v_main_~main__t~0_8 v_main_~main__tagbuf_len~0_9))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_8, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_8, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {7665#true} is VALID [2022-04-27 21:35:23,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {7665#true} [196] L32-->L266: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_3) (= v_main_~main____CPAchecker_TMP_0~0_7 0) (= (ite (<= 0 v_main_~main__t~0_33) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_33, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_7, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {7665#true} is VALID [2022-04-27 21:35:23,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {7665#true} [199] L266-->L277: Formula: (and (= (ite (<= v_main_~main__t~0_1 v_main_~main__tagbuf_len~0_1) 1 0) v_main_~__tmp_14~0_1) (not (= v_main_~__VERIFIER_assert__cond~12_2 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_1, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_2} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {7665#true} is VALID [2022-04-27 21:35:23,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {7665#true} [203] L277-->L357: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_1 v_~__tmp_383_0~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0))) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {7665#true} is VALID [2022-04-27 21:35:23,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {7665#true} [210] L357-->L289: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_2 v_~__tmp_383_0~0_2) (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_3) (= (+ v_main_~main__t~0_3 1) v_main_~main__t~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_3, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_2, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_0~0, main_~main____CPAchecker_TMP_1~0] {7665#true} is VALID [2022-04-27 21:35:23,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {7665#true} [216] L289-->L325: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_11 v_main_~main__tagbuf_len~0_11)) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~1_1 |v_main_#t~nondet9_2|)) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} OutVars{main_~main__t~0=v_main_~main__t~0_11, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_11} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {7670#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:23,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {7670#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [223] L325-->L328: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_3 v_~__tmp_247_0~0_3) (not (= v_main_~main____CPAchecker_TMP_0~1_3 0))) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} OutVars{~__tmp_247_0~0=v_~__tmp_247_0~0_3, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} AuxVars[] AssignedVars[~__tmp_247_0~0] {7670#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:23,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {7670#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [197] L328-->L42: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (= v_main_~__tmp_1~0_1 (ite (<= 0 v_main_~main__t~0_10) 1 0)) (= v_main_~main____CPAchecker_TMP_0~0_6 v_~__tmp_247_0~0_2)) InVars {main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_10, ~__tmp_247_0~0=v_~__tmp_247_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main____CPAchecker_TMP_0~0] {7670#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:23,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {7670#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [201] L42-->L54: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 (ite (<= v_main_~main__t~0_12 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1)) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__t~0=v_main_~main__t~0_12, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {7671#(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-27 21:35:23,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {7671#(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))))} [207] L54-->L196: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main__t~0_14 (+ v_main_~main__t~0_15 1)) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_15)) InVars {main_~main__t~0=v_main_~main__t~0_15, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} OutVars{main_~main__t~0=v_main_~main__t~0_14, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0] {7672#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:23,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {7672#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [214] L196-->L102: Formula: (and (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet6_2|) (<= |v_main_#t~nondet6_2| 2147483647) (not (= v_main_~main__t~0_19 v_main_~main__tagbuf_len~0_17)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_19, main_#t~nondet6=|v_main_#t~nondet6_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17} OutVars{main_~main__t~0=v_main_~main__t~0_19, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_#t~nondet6, main_~main____CPAchecker_TMP_3~0] {7672#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:23,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {7672#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [220] L102-->L216: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_6~0_1 |v_main_#t~nondet8_2|) (= v_main_~main____CPAchecker_TMP_3~0_4 0)) InVars {main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} OutVars{main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_1, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_6~0, main_#t~nondet8] {7672#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:23,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {7672#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [231] L216-->L223: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (not (= v_main_~main____CPAchecker_TMP_6~0_3 0)) (= v_main_~__tmp_11~0_1 (ite (<= 0 v_main_~main__t~0_31) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_31, main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_31, main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7672#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:23,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {7672#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [246] L223-->L235: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 (ite (<= v_main_~main__t~0_32 v_main_~main__tagbuf_len~0_23) 1 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__t~0=v_main_~main__t~0_32, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~main__t~0=v_main_~main__t~0_32, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {7673#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-27 21:35:23,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {7673#(not (= main_~__VERIFIER_assert__cond~11 0))} [261] L235-->L237: Formula: (= v_main_~__VERIFIER_assert__cond~11_3 0) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_3} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_3} AuxVars[] AssignedVars[] {7666#false} is VALID [2022-04-27 21:35:23,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {7666#false} [273] L237-->mainErr11ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7666#false} is VALID [2022-04-27 21:35:23,473 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-27 21:35:23,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:23,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236639402] [2022-04-27 21:35:23,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236639402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:23,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:23,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:35:23,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473770428] [2022-04-27 21:35:23,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:23,474 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-27 21:35:23,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:23,474 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-27 21:35:23,489 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-27 21:35:23,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:35:23,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:23,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:35:23,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:35:23,490 INFO L87 Difference]: Start difference. First operand 39 states and 44 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-27 21:35:23,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:23,731 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-27 21:35:23,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:35:23,732 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-27 21:35:23,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:23,732 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-27 21:35:23,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-27 21:35:23,733 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-27 21:35:23,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-27 21:35:23,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-04-27 21:35:23,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:23,766 INFO L225 Difference]: With dead ends: 39 [2022-04-27 21:35:23,766 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:35:23,766 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-27 21:35:23,767 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 63 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:23,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 38 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:23,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:35:23,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:35:23,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:23,768 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-27 21:35:23,768 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-27 21:35:23,768 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-27 21:35:23,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:23,768 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:35:23,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:35:23,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:23,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:23,768 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-27 21:35:23,769 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-27 21:35:23,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:23,769 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:35:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:35:23,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:23,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:23,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:23,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:23,769 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-27 21:35:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:35:23,769 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-04-27 21:35:23,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:23,769 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:35:23,770 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-27 21:35:23,770 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:35:23,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:23,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2022-04-27 21:35:23,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (15 of 17 remaining) [2022-04-27 21:35:23,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 17 remaining) [2022-04-27 21:35:23,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 17 remaining) [2022-04-27 21:35:23,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2022-04-27 21:35:23,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (11 of 17 remaining) [2022-04-27 21:35:23,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (10 of 17 remaining) [2022-04-27 21:35:23,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2022-04-27 21:35:23,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (8 of 17 remaining) [2022-04-27 21:35:23,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2022-04-27 21:35:23,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (6 of 17 remaining) [2022-04-27 21:35:23,773 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 17 remaining) [2022-04-27 21:35:23,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 17 remaining) [2022-04-27 21:35:23,774 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (3 of 17 remaining) [2022-04-27 21:35:23,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2022-04-27 21:35:23,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (1 of 17 remaining) [2022-04-27 21:35:23,776 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (0 of 17 remaining) [2022-04-27 21:35:23,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 21:35:23,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:39:09,126 WARN L232 SmtUtils]: Spent 3.74m on a formula simplification. DAG size of input: 78 DAG size of output: 78 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 21:39:47,977 WARN L232 SmtUtils]: Spent 38.70s on a formula simplification. DAG size of input: 91 DAG size of output: 92 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 21:39:48,579 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-27 21:39:48,580 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:39:48,580 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:39:48,580 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:39:48,580 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:39:48,580 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:39:48,580 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:39:48,580 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-27 21:39:48,580 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 374) no Hoare annotation was computed. [2022-04-27 21:39:48,580 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 369) no Hoare annotation was computed. [2022-04-27 21:39:48,580 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 15 375) no Hoare annotation was computed. [2022-04-27 21:39:48,580 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 368) no Hoare annotation was computed. [2022-04-27 21:39:48,580 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 15 375) no Hoare annotation was computed. [2022-04-27 21:39:48,580 INFO L895 garLoopResultBuilder]: At program point L328(lines 32 368) the Hoare annotation is: (or (and (let ((.cse2 (<= main_~main__t~0 1))) (let ((.cse0 (let ((.cse3 (not (= main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse2 .cse3) (and .cse3 (not (= main_~__VERIFIER_assert__cond~17 0)))))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= 1 main_~__VERIFIER_assert__cond~17) .cse0 .cse1) (and .cse2 .cse0 .cse1)))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) (and (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))) [2022-04-27 21:39:48,580 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 366) no Hoare annotation was computed. [2022-04-27 21:39:48,580 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 256) no Hoare annotation was computed. [2022-04-27 21:39:48,581 INFO L899 garLoopResultBuilder]: For program point L277(lines 277 364) no Hoare annotation was computed. [2022-04-27 21:39:48,581 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-04-27 21:39:48,581 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 254) no Hoare annotation was computed. [2022-04-27 21:39:48,581 INFO L899 garLoopResultBuilder]: For program point L279(line 279) no Hoare annotation was computed. [2022-04-27 21:39:48,581 INFO L895 garLoopResultBuilder]: At program point L357(lines 283 364) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (let ((.cse1 (= main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse3 (<= 0 main_~main__t~0))) (or (and .cse2 .cse3 .cse1) (and .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~16 0))))))) (or (and (<= 1 main_~__VERIFIER_assert__cond~17) .cse0) (and .cse1 .cse0))))) [2022-04-27 21:39:48,581 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2022-04-27 21:39:48,581 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-04-27 21:39:48,581 INFO L895 garLoopResultBuilder]: At program point L196(lines 60 254) the Hoare annotation is: (and (<= 1 main_~__VERIFIER_assert__cond~1) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-27 21:39:48,581 INFO L899 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2022-04-27 21:39:48,581 INFO L899 garLoopResultBuilder]: For program point L289(lines 289 363) no Hoare annotation was computed. [2022-04-27 21:39:48,581 INFO L899 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2022-04-27 21:39:48,581 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 95) no Hoare annotation was computed. [2022-04-27 21:39:48,581 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 252) no Hoare annotation was computed. [2022-04-27 21:39:48,582 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 318) no Hoare annotation was computed. [2022-04-27 21:39:48,582 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 362) no Hoare annotation was computed. [2022-04-27 21:39:48,582 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2022-04-27 21:39:48,582 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 93) no Hoare annotation was computed. [2022-04-27 21:39:48,582 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 210) no Hoare annotation was computed. [2022-04-27 21:39:48,582 INFO L899 garLoopResultBuilder]: For program point L216(lines 216 251) no Hoare annotation was computed. [2022-04-27 21:39:48,582 INFO L899 garLoopResultBuilder]: For program point L298(line 298) no Hoare annotation was computed. [2022-04-27 21:39:48,582 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 316) no Hoare annotation was computed. [2022-04-27 21:39:48,582 INFO L899 garLoopResultBuilder]: For program point L337(lines 337 360) no Hoare annotation was computed. [2022-04-27 21:39:48,582 INFO L899 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2022-04-27 21:39:48,582 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-04-27 21:39:48,582 INFO L895 garLoopResultBuilder]: At program point L315(lines 32 368) the Hoare annotation is: (<= 0 main_~main__t~0) [2022-04-27 21:39:48,582 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 204) no Hoare annotation was computed. [2022-04-27 21:39:48,582 INFO L895 garLoopResultBuilder]: At program point L250(lines 102 252) the Hoare annotation is: (and (<= 1 main_~__VERIFIER_assert__cond~1) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-27 21:39:48,582 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 245) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point L310(line 310) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point L339(line 339) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 358) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 202) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 199) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point L225(line 225) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 243) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point L351(line 351) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 201) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-04-27 21:39:48,583 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 197) no Hoare annotation was computed. [2022-04-27 21:39:48,584 INFO L899 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) no Hoare annotation was computed. [2022-04-27 21:39:48,584 INFO L899 garLoopResultBuilder]: For program point L237(line 237) no Hoare annotation was computed. [2022-04-27 21:39:48,584 INFO L899 garLoopResultBuilder]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) no Hoare annotation was computed. [2022-04-27 21:39:48,584 INFO L899 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) no Hoare annotation was computed. [2022-04-27 21:39:48,584 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 163) no Hoare annotation was computed. [2022-04-27 21:39:48,584 INFO L899 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-04-27 21:39:48,584 INFO L899 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-04-27 21:39:48,584 INFO L899 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) no Hoare annotation was computed. [2022-04-27 21:39:48,584 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-04-27 21:39:48,584 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 161) no Hoare annotation was computed. [2022-04-27 21:39:48,584 INFO L899 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2022-04-27 21:39:48,584 INFO L899 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) no Hoare annotation was computed. [2022-04-27 21:39:48,584 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-04-27 21:39:48,584 INFO L899 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2022-04-27 21:39:48,586 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:39:48,588 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:39:48,592 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:39:48,592 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 21:39:48,592 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:39:48,592 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 21:39:48,592 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 21:39:48,592 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:39:48,592 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 21:39:48,592 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 21:39:48,592 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:39:48,592 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: L266 has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: L266 has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: L277 has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: L277 has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: L279 has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: L279 has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: L289 has no Hoare annotation [2022-04-27 21:39:48,593 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L289 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L289 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L325 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L325 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-04-27 21:39:48,594 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L216 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L216 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L298 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L298 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L337 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L337 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L223 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L223 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L310 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L310 has no Hoare annotation [2022-04-27 21:39:48,595 WARN L170 areAnnotationChecker]: L339 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L339 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L349 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L225 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L225 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L235 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L235 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L351 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L351 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L127 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L127 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2022-04-27 21:39:48,596 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-04-27 21:39:48,597 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-04-27 21:39:48,597 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-04-27 21:39:48,597 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-04-27 21:39:48,597 WARN L170 areAnnotationChecker]: L237 has no Hoare annotation [2022-04-27 21:39:48,597 WARN L170 areAnnotationChecker]: L237 has no Hoare annotation [2022-04-27 21:39:48,597 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2022-04-27 21:39:48,597 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2022-04-27 21:39:48,597 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-04-27 21:39:48,597 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-04-27 21:39:48,597 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-04-27 21:39:48,597 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-04-27 21:39:48,597 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2022-04-27 21:39:48,597 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2022-04-27 21:39:48,597 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-04-27 21:39:48,597 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-04-27 21:39:48,597 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:39:48,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:39:48 BasicIcfg [2022-04-27 21:39:48,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:39:48,611 INFO L158 Benchmark]: Toolchain (without parser) took 280914.04ms. Allocated memory was 189.8MB in the beginning and 496.0MB in the end (delta: 306.2MB). Free memory was 142.1MB in the beginning and 428.8MB in the end (delta: -286.7MB). Peak memory consumption was 272.6MB. Max. memory is 8.0GB. [2022-04-27 21:39:48,611 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory is still 158.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:39:48,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.90ms. Allocated memory is still 189.8MB. Free memory was 141.9MB in the beginning and 162.7MB in the end (delta: -20.8MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2022-04-27 21:39:48,611 INFO L158 Benchmark]: Boogie Preprocessor took 44.29ms. Allocated memory is still 189.8MB. Free memory was 162.7MB in the beginning and 160.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:39:48,612 INFO L158 Benchmark]: RCFGBuilder took 454.60ms. Allocated memory is still 189.8MB. Free memory was 160.9MB in the beginning and 144.9MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-04-27 21:39:48,612 INFO L158 Benchmark]: IcfgTransformer took 43.28ms. Allocated memory is still 189.8MB. Free memory was 144.9MB in the beginning and 141.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-27 21:39:48,612 INFO L158 Benchmark]: TraceAbstraction took 280018.57ms. Allocated memory was 189.8MB in the beginning and 496.0MB in the end (delta: 306.2MB). Free memory was 141.2MB in the beginning and 428.8MB in the end (delta: -287.6MB). Peak memory consumption was 271.6MB. Max. memory is 8.0GB. [2022-04-27 21:39:48,613 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.12ms. Allocated memory is still 189.8MB. Free memory is still 158.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 341.90ms. Allocated memory is still 189.8MB. Free memory was 141.9MB in the beginning and 162.7MB in the end (delta: -20.8MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.29ms. Allocated memory is still 189.8MB. Free memory was 162.7MB in the beginning and 160.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 454.60ms. Allocated memory is still 189.8MB. Free memory was 160.9MB in the beginning and 144.9MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * IcfgTransformer took 43.28ms. Allocated memory is still 189.8MB. Free memory was 144.9MB in the beginning and 141.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 280018.57ms. Allocated memory was 189.8MB in the beginning and 496.0MB in the end (delta: 306.2MB). Free memory was 141.2MB in the beginning and 428.8MB in the end (delta: -287.6MB). Peak memory consumption was 271.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 44]: 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: 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: 298]: 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: 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: 115]: 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: 351]: 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: 177]: 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: 189]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 280.0s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 264.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1940 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1940 mSDsluCounter, 2734 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1701 mSDsCounter, 245 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3235 IncrementalHoareTripleChecker+Invalid, 3480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 245 mSolverCounterUnsat, 1033 mSDtfsCounter, 3235 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 146 SyntacticMatches, 10 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, InterpolantAutomatonStates: 194, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 365 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 189 HoareAnnotationTreeSize, 9 FomulaSimplifications, 222439 FormulaSimplificationTreeSizeReduction, 264.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 3450178 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 474 ConstructedInterpolants, 0 QuantifiedInterpolants, 2171 SizeOfPredicates, 6 NumberOfNonLiveVariables, 305 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((1 <= __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && main__t <= main__tagbuf_len - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && ((1 <= __VERIFIER_assert__cond && (((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0)))) || (main__t == 0 && (((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && main__t == 0) || ((!(__VERIFIER_assert__cond == 0) && 0 <= main__t) && !(__VERIFIER_assert__cond == 0))))) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((1 <= __VERIFIER_assert__cond && ((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) || (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)))) && 1 <= main__t) || ((main__t <= 1 && ((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) || (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)))) && 1 <= main__t)) && !(main__tagbuf_len <= 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: ((1 <= __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len <= main__t)) && 1 <= main__t RESULT: Ultimate proved your program to be correct! [2022-04-27 21:39:48,649 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...