/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+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:35:04,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:35:04,418 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:35:04,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:35:04,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:35:04,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:35:04,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:35:04,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:35:04,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:35:04,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:35:04,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:35:04,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:35:04,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:35:04,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:35:04,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:35:04,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:35:04,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:35:04,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:35:04,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:35:04,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:35:04,489 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:35:04,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:35:04,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:35:04,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:35:04,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:35:04,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:35:04,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:35:04,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:35:04,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:35:04,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:35:04,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:35:04,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:35:04,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:35:04,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:35:04,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:35:04,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:35:04,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:35:04,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:35:04,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:35:04,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:35:04,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:35:04,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:35:04,504 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:04,519 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:35:04,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:35:04,520 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:35:04,520 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:35:04,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:35:04,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:35:04,520 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:35:04,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:35:04,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:35:04,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:35:04,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:35:04,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:35:04,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:35:04,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:35:04,521 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:35:04,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:35:04,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:35:04,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:35:04,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:35:04,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:35:04,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:35:04,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:35:04,522 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:35:04,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:35:04,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:35:04,523 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:35:04,523 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:35:04,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:35:04,524 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:35:04,524 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:04,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:35:04,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:35:04,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:35:04,678 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:35:04,678 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:35:04,679 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+lhb-reducer.c [2022-04-27 21:35:04,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f5f2dc1/7272181955874851aa32254378d95040/FLAG138e8ced9 [2022-04-27 21:35:05,068 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:35:05,069 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-04-27 21:35:05,073 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f5f2dc1/7272181955874851aa32254378d95040/FLAG138e8ced9 [2022-04-27 21:35:05,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f5f2dc1/7272181955874851aa32254378d95040 [2022-04-27 21:35:05,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:35:05,086 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:35:05,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:35:05,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:35:05,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:35:05,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:35:05" (1/1) ... [2022-04-27 21:35:05,090 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a962790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:35:05, skipping insertion in model container [2022-04-27 21:35:05,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:35:05" (1/1) ... [2022-04-27 21:35:05,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:35:05,111 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:35:05,240 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+lhb-reducer.c[1224,1237] [2022-04-27 21:35:05,243 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+lhb-reducer.c[1636,1649] [2022-04-27 21:35:05,244 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+lhb-reducer.c[1851,1864] [2022-04-27 21:35:05,246 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+lhb-reducer.c[2384,2397] [2022-04-27 21:35:05,247 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+lhb-reducer.c[2599,2612] [2022-04-27 21:35:05,249 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+lhb-reducer.c[2901,2914] [2022-04-27 21:35:05,250 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+lhb-reducer.c[3116,3129] [2022-04-27 21:35:05,251 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+lhb-reducer.c[3386,3399] [2022-04-27 21:35:05,252 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+lhb-reducer.c[3604,3617] [2022-04-27 21:35:05,253 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+lhb-reducer.c[4088,4101] [2022-04-27 21:35:05,254 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+lhb-reducer.c[4306,4319] [2022-04-27 21:35:05,256 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+lhb-reducer.c[4802,4815] [2022-04-27 21:35:05,257 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+lhb-reducer.c[5203,5216] [2022-04-27 21:35:05,258 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+lhb-reducer.c[5421,5434] [2022-04-27 21:35:05,259 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+lhb-reducer.c[5792,5805] [2022-04-27 21:35:05,259 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+lhb-reducer.c[6010,6023] [2022-04-27 21:35:05,260 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+lhb-reducer.c[6296,6309] [2022-04-27 21:35:05,261 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+lhb-reducer.c[6514,6527] [2022-04-27 21:35:05,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:35:05,268 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:35:05,277 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+lhb-reducer.c[1224,1237] [2022-04-27 21:35:05,278 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+lhb-reducer.c[1636,1649] [2022-04-27 21:35:05,279 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+lhb-reducer.c[1851,1864] [2022-04-27 21:35:05,281 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+lhb-reducer.c[2384,2397] [2022-04-27 21:35:05,281 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+lhb-reducer.c[2599,2612] [2022-04-27 21:35:05,282 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+lhb-reducer.c[2901,2914] [2022-04-27 21:35:05,283 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+lhb-reducer.c[3116,3129] [2022-04-27 21:35:05,284 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+lhb-reducer.c[3386,3399] [2022-04-27 21:35:05,285 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+lhb-reducer.c[3604,3617] [2022-04-27 21:35:05,286 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+lhb-reducer.c[4088,4101] [2022-04-27 21:35:05,287 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+lhb-reducer.c[4306,4319] [2022-04-27 21:35:05,288 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+lhb-reducer.c[4802,4815] [2022-04-27 21:35:05,289 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+lhb-reducer.c[5203,5216] [2022-04-27 21:35:05,290 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+lhb-reducer.c[5421,5434] [2022-04-27 21:35:05,291 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+lhb-reducer.c[5792,5805] [2022-04-27 21:35:05,292 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+lhb-reducer.c[6010,6023] [2022-04-27 21:35:05,293 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+lhb-reducer.c[6296,6309] [2022-04-27 21:35:05,293 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+lhb-reducer.c[6514,6527] [2022-04-27 21:35:05,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:35:05,303 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:35:05,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:35:05 WrapperNode [2022-04-27 21:35:05,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:35:05,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:35:05,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:35:05,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:35:05,314 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:05" (1/1) ... [2022-04-27 21:35:05,314 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:05" (1/1) ... [2022-04-27 21:35:05,325 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:05" (1/1) ... [2022-04-27 21:35:05,325 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:05" (1/1) ... [2022-04-27 21:35:05,333 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:05" (1/1) ... [2022-04-27 21:35:05,336 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:05" (1/1) ... [2022-04-27 21:35:05,337 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:05" (1/1) ... [2022-04-27 21:35:05,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:35:05,348 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:35:05,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:35:05,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:35:05,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:35:05" (1/1) ... [2022-04-27 21:35:05,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:35:05,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:35:05,369 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:05,387 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:05,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:35:05,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:35:05,398 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:35:05,398 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:35:05,398 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:35:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:35:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:35:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:35:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:35:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:35:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:35:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:35:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:35:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:35:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:35:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:35:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:35:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:35:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:35:05,467 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:35:05,468 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:35:05,671 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:35:05,676 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:35:05,676 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 21:35:05,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:35:05 BoogieIcfgContainer [2022-04-27 21:35:05,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:35:05,678 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:35:05,678 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:35:05,679 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:35:05,681 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:35:05" (1/1) ... [2022-04-27 21:35:05,682 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:35:05,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:35:05 BasicIcfg [2022-04-27 21:35:05,716 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:35:05,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:35:05,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:35:05,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:35:05,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:35:05" (1/4) ... [2022-04-27 21:35:05,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a892520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:35:05, skipping insertion in model container [2022-04-27 21:35:05,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:35:05" (2/4) ... [2022-04-27 21:35:05,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a892520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:35:05, skipping insertion in model container [2022-04-27 21:35:05,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:35:05" (3/4) ... [2022-04-27 21:35:05,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a892520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:35:05, skipping insertion in model container [2022-04-27 21:35:05,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:35:05" (4/4) ... [2022-04-27 21:35:05,721 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.cqvasr [2022-04-27 21:35:05,730 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:35:05,730 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-04-27 21:35:05,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:35:05,780 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@4873dd24, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1664778f [2022-04-27 21:35:05,780 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-04-27 21:35:05,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 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:05,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:35:05,797 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:05,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:05,798 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:05,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:05,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1731584118, now seen corresponding path program 1 times [2022-04-27 21:35:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:05,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912040208] [2022-04-27 21:35:05,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:05,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:06,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:06,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {90#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {83#true} is VALID [2022-04-27 21:35:06,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {83#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#true} is VALID [2022-04-27 21:35:06,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83#true} {83#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#true} is VALID [2022-04-27 21:35:06,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {83#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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:06,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {83#true} is VALID [2022-04-27 21:35:06,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {83#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#true} is VALID [2022-04-27 21:35:06,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83#true} {83#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#true} is VALID [2022-04-27 21:35:06,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {83#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#true} is VALID [2022-04-27 21:35:06,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {83#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {83#true} is VALID [2022-04-27 21:35:06,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {83#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {88#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:06,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {88#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {88#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:06,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {88#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} [205] L32-->L39: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (<= 0 v_main_~main__t~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {88#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:06,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {88#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} [208] L39-->L50: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= (ite (<= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8) 1 0) v_main_~__tmp_2~0_1) (= 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {89#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-27 21:35:06,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {89#(not (= main_~__VERIFIER_assert__cond~1 0))} [211] L50-->L52: 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[] {84#false} is VALID [2022-04-27 21:35:06,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {84#false} [215] L52-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {84#false} is VALID [2022-04-27 21:35:06,089 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:06,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:06,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912040208] [2022-04-27 21:35:06,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912040208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:06,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:06,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:35:06,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111264379] [2022-04-27 21:35:06,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:06,098 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:06,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:06,102 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:06,115 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:06,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:35:06,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:06,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:35:06,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:35:06,144 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 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:06,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:06,554 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2022-04-27 21:35:06,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:35:06,555 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:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:06,556 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:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2022-04-27 21:35:06,571 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:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2022-04-27 21:35:06,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 172 transitions. [2022-04-27 21:35:06,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:06,714 INFO L225 Difference]: With dead ends: 129 [2022-04-27 21:35:06,714 INFO L226 Difference]: Without dead ends: 111 [2022-04-27 21:35:06,716 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:06,718 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 67 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:06,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:06,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-27 21:35:06,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2022-04-27 21:35:06,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:06,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states 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:06,739 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states 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:06,740 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states 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:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:06,744 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-04-27 21:35:06,745 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2022-04-27 21:35:06,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:06,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:06,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 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 111 states. [2022-04-27 21:35:06,746 INFO L87 Difference]: Start difference. First operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 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 111 states. [2022-04-27 21:35:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:06,750 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-04-27 21:35:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2022-04-27 21:35:06,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:06,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:06,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:06,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states 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:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-04-27 21:35:06,755 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2022-04-27 21:35:06,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:06,755 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-04-27 21:35:06,755 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:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-04-27 21:35:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:35:06,756 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:06,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:35:06,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:35:06,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:06,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1731615896, now seen corresponding path program 1 times [2022-04-27 21:35:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:06,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768714002] [2022-04-27 21:35:06,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:06,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:06,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {552#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {545#true} is VALID [2022-04-27 21:35:06,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {545#true} is VALID [2022-04-27 21:35:06,848 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {545#true} {545#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {545#true} is VALID [2022-04-27 21:35:06,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {545#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {552#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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:06,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {552#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {545#true} is VALID [2022-04-27 21:35:06,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {545#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {545#true} is VALID [2022-04-27 21:35:06,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {545#true} {545#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {545#true} is VALID [2022-04-27 21:35:06,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {545#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {545#true} is VALID [2022-04-27 21:35:06,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {545#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {545#true} is VALID [2022-04-27 21:35:06,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {545#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {550#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:06,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {550#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:06,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {550#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} [206] L32-->L265: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~main____CPAchecker_TMP_0~0_6 0) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {550#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:06,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {550#(and (<= 0 main_~main__tagbuf_len~0) (= main_~main__t~0 0))} [210] L265-->L276: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 (ite (<= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_18) 1 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_26, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_26, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {551#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-27 21:35:06,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {551#(not (= main_~__VERIFIER_assert__cond~13 0))} [213] L276-->L278: 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[] {546#false} is VALID [2022-04-27 21:35:06,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {546#false} [218] L278-->mainErr11ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {546#false} is VALID [2022-04-27 21:35:06,854 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:06,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:06,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768714002] [2022-04-27 21:35:06,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768714002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:06,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:06,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:35:06,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159137022] [2022-04-27 21:35:06,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:06,855 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:06,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:06,856 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:06,863 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:06,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:35:06,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:06,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:35:06,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:35:06,864 INFO L87 Difference]: Start difference. First operand 73 states and 77 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:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:07,180 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-04-27 21:35:07,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:35:07,180 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:07,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:07,180 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:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-04-27 21:35:07,182 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:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-04-27 21:35:07,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 117 transitions. [2022-04-27 21:35:07,257 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:07,259 INFO L225 Difference]: With dead ends: 111 [2022-04-27 21:35:07,260 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 21:35:07,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:35:07,261 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 72 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:07,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 218 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 21:35:07,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2022-04-27 21:35:07,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:07,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 2 states have call successors, (2), 2 states 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:07,267 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 2 states have call successors, (2), 2 states 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:07,268 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 2 states have call successors, (2), 2 states 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:07,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:07,270 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-04-27 21:35:07,270 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2022-04-27 21:35:07,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:07,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:07,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 2 states have call successors, (2), 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:07,271 INFO L87 Difference]: Start difference. First operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 2 states have call successors, (2), 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:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:07,274 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-04-27 21:35:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2022-04-27 21:35:07,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:07,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:07,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:07,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:07,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 2 states have call successors, (2), 2 states 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:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-04-27 21:35:07,276 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2022-04-27 21:35:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:07,277 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-04-27 21:35:07,277 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:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-27 21:35:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 21:35:07,277 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:07,277 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:07,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:35:07,278 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:07,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:07,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1228530226, now seen corresponding path program 1 times [2022-04-27 21:35:07,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:07,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790418747] [2022-04-27 21:35:07,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:07,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:07,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:07,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {989#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {981#true} is VALID [2022-04-27 21:35:07,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {981#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 21:35:07,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {981#true} {981#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 21:35:07,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {981#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {989#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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:07,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {989#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {981#true} is VALID [2022-04-27 21:35:07,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {981#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 21:35:07,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {981#true} {981#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 21:35:07,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {981#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {981#true} is VALID [2022-04-27 21:35:07,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {981#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {981#true} is VALID [2022-04-27 21:35:07,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {981#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {986#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:07,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {986#(= main_~main__t~0 0)} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {986#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:07,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {986#(= main_~main__t~0 0)} [205] L32-->L39: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (<= 0 v_main_~main__t~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {986#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:07,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {986#(= main_~main__t~0 0)} [208] L39-->L50: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= (ite (<= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8) 1 0) v_main_~__tmp_2~0_1) (= 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {986#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:07,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {986#(= main_~main__t~0 0)} [212] L50-->L351: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_259_0~0_1)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, ~__tmp_259_0~0=v_~__tmp_259_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[~__tmp_259_0~0] {986#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:07,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {986#(= main_~main__t~0 0)} [217] L351-->L195: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_259_0~0_2) (= (+ v_main_~main__t~0_8 1) v_main_~main__t~0_7) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_8)) InVars {main_~main__t~0=v_main_~main__t~0_8, ~__tmp_259_0~0=v_~__tmp_259_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, ~__tmp_259_0~0=v_~__tmp_259_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {987#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:07,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {987#(<= 1 main_~main__t~0)} [221] L195-->L70: Formula: (and (= v_main_~main__t~0_9 v_main_~main__tagbuf_len~0_9) (= v_main_~__tmp_3~0_1 (ite (<= 0 v_main_~main__t~0_9) 1 0)) (= 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_9, main_~main__t~0=v_main_~main__t~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_9, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9, main_~__tmp_3~0=v_main_~__tmp_3~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {988#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-27 21:35:07,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {988#(not (= main_~__VERIFIER_assert__cond~2 0))} [225] L70-->L72: 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[] {982#false} is VALID [2022-04-27 21:35:07,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {982#false} [233] L72-->mainErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {982#false} is VALID [2022-04-27 21:35:07,333 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:07,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:07,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790418747] [2022-04-27 21:35:07,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790418747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:07,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:07,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:35:07,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882555491] [2022-04-27 21:35:07,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:07,334 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:07,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:07,335 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:07,344 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:07,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:35:07,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:07,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:35:07,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:35:07,345 INFO L87 Difference]: Start difference. First operand 71 states and 75 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:07,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:07,611 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-27 21:35:07,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:35:07,611 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:07,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:07,611 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:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-27 21:35:07,612 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:07,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-27 21:35:07,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2022-04-27 21:35:07,661 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:07,662 INFO L225 Difference]: With dead ends: 73 [2022-04-27 21:35:07,662 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 21:35:07,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:07,675 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 68 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 132 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:07,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 132 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:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 21:35:07,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2022-04-27 21:35:07,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:07,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 69 states, 51 states have (on average 1.3725490196078431) 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:07,693 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 69 states, 51 states have (on average 1.3725490196078431) 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:07,693 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 69 states, 51 states have (on average 1.3725490196078431) 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:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:07,695 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-27 21:35:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-27 21:35:07,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:07,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:07,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 51 states have (on average 1.3725490196078431) 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 71 states. [2022-04-27 21:35:07,696 INFO L87 Difference]: Start difference. First operand has 69 states, 51 states have (on average 1.3725490196078431) 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 71 states. [2022-04-27 21:35:07,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:07,697 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-27 21:35:07,697 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-27 21:35:07,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:07,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:07,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:07,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:07,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) 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:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-04-27 21:35:07,704 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2022-04-27 21:35:07,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:07,706 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-04-27 21:35:07,706 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:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-27 21:35:07,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 21:35:07,706 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:07,706 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:07,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 21:35:07,707 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:07,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:07,707 INFO L85 PathProgramCache]: Analyzing trace with hash -281829774, now seen corresponding path program 1 times [2022-04-27 21:35:07,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:07,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188672009] [2022-04-27 21:35:07,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:07,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:07,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:07,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {1306#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {1298#true} is VALID [2022-04-27 21:35:07,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {1298#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-27 21:35:07,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1298#true} {1298#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-27 21:35:07,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {1298#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1306#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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:07,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {1306#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {1298#true} is VALID [2022-04-27 21:35:07,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {1298#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-27 21:35:07,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1298#true} {1298#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-27 21:35:07,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {1298#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1298#true} is VALID [2022-04-27 21:35:07,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {1298#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {1298#true} is VALID [2022-04-27 21:35:07,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {1298#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {1303#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:07,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {1303#(= main_~main__t~0 0)} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {1303#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:07,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {1303#(= main_~main__t~0 0)} [206] L32-->L265: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~main____CPAchecker_TMP_0~0_6 0) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {1303#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:07,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {1303#(= main_~main__t~0 0)} [210] L265-->L276: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 (ite (<= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_18) 1 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_26, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_26, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {1303#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:07,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {1303#(= main_~main__t~0 0)} [214] L276-->L384: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 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_7} 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_7, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {1303#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:07,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {1303#(= main_~main__t~0 0)} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {1304#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:07,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {1304#(<= 1 main_~main__t~0)} [223] L288-->L295: Formula: (and (= (ite (<= 0 v_main_~main__t~0_29) 1 0) v_main_~__tmp_15~0_1) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1) (= v_main_~main__t~0_29 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_29} OutVars{main_~main__t~0=v_main_~main__t~0_29, 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_19} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14] {1305#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-27 21:35:07,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {1305#(not (= main_~__VERIFIER_assert__cond~14 0))} [229] L295-->L297: 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[] {1299#false} is VALID [2022-04-27 21:35:07,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {1299#false} [241] L297-->mainErr12ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1299#false} is VALID [2022-04-27 21:35:07,787 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:07,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:07,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188672009] [2022-04-27 21:35:07,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188672009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:07,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:07,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:35:07,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629530679] [2022-04-27 21:35:07,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:07,792 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:07,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:07,793 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:07,804 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:07,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:35:07,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:07,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:35:07,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:35:07,805 INFO L87 Difference]: Start difference. First operand 69 states and 73 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:08,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:08,062 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-27 21:35:08,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:35:08,062 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:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:08,062 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:08,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-27 21:35:08,064 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:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2022-04-27 21:35:08,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2022-04-27 21:35:08,105 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:08,106 INFO L225 Difference]: With dead ends: 71 [2022-04-27 21:35:08,106 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 21:35:08,106 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:08,107 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 126 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:08,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 126 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:08,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 21:35:08,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-04-27 21:35:08,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:08,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 67 states, 50 states have (on average 1.36) 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:08,114 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 67 states, 50 states have (on average 1.36) 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:08,114 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 67 states, 50 states have (on average 1.36) 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:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:08,116 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-27 21:35:08,116 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-27 21:35:08,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:08,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:08,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 50 states have (on average 1.36) 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 69 states. [2022-04-27 21:35:08,116 INFO L87 Difference]: Start difference. First operand has 67 states, 50 states have (on average 1.36) 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 69 states. [2022-04-27 21:35:08,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:08,118 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-27 21:35:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-27 21:35:08,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:08,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:08,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:08,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) 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:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-04-27 21:35:08,119 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2022-04-27 21:35:08,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:08,119 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-04-27 21:35:08,120 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:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-27 21:35:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:35:08,120 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:08,120 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:08,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 21:35:08,120 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:08,121 INFO L85 PathProgramCache]: Analyzing trace with hash 570269930, now seen corresponding path program 1 times [2022-04-27 21:35:08,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:08,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089043730] [2022-04-27 21:35:08,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:08,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:08,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:08,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {1614#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {1607#true} is VALID [2022-04-27 21:35:08,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {1607#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1607#true} is VALID [2022-04-27 21:35:08,178 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1607#true} {1607#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1607#true} is VALID [2022-04-27 21:35:08,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {1607#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1614#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {1614#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {1607#true} is VALID [2022-04-27 21:35:08,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {1607#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1607#true} is VALID [2022-04-27 21:35:08,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1607#true} {1607#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1607#true} is VALID [2022-04-27 21:35:08,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {1607#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1607#true} is VALID [2022-04-27 21:35:08,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {1607#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {1607#true} is VALID [2022-04-27 21:35:08,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {1607#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {1607#true} is VALID [2022-04-27 21:35:08,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {1607#true} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {1607#true} is VALID [2022-04-27 21:35:08,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {1607#true} [205] L32-->L39: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (<= 0 v_main_~main__t~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {1607#true} is VALID [2022-04-27 21:35:08,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {1607#true} [208] L39-->L50: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= (ite (<= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8) 1 0) v_main_~__tmp_2~0_1) (= 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {1607#true} is VALID [2022-04-27 21:35:08,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {1607#true} [212] L50-->L351: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_259_0~0_1)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, ~__tmp_259_0~0=v_~__tmp_259_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[~__tmp_259_0~0] {1607#true} is VALID [2022-04-27 21:35:08,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {1607#true} [217] L351-->L195: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_259_0~0_2) (= (+ v_main_~main__t~0_8 1) v_main_~main__t~0_7) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_8)) InVars {main_~main__t~0=v_main_~main__t~0_8, ~__tmp_259_0~0=v_~__tmp_259_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, ~__tmp_259_0~0=v_~__tmp_259_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {1607#true} is VALID [2022-04-27 21:35:08,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {1607#true} [221] L195-->L70: Formula: (and (= v_main_~main__t~0_9 v_main_~main__tagbuf_len~0_9) (= v_main_~__tmp_3~0_1 (ite (<= 0 v_main_~main__t~0_9) 1 0)) (= 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_9, main_~main__t~0=v_main_~main__t~0_9} OutVars{main_~main__t~0=v_main_~main__t~0_9, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_9, main_~__tmp_3~0=v_main_~__tmp_3~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {1612#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:08,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {1612#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [226] L70-->L82: Formula: (and (= v_main_~__tmp_4~0_1 (ite (<= v_main_~main__t~0_10 v_main_~main__tagbuf_len~0_10) 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_10, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_10} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~main__t~0=v_main_~main__t~0_10, 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_10} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {1613#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-27 21:35:08,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {1613#(not (= main_~__VERIFIER_assert__cond~3 0))} [235] L82-->L84: 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[] {1608#false} is VALID [2022-04-27 21:35:08,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {1608#false} [249] L84-->mainErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1608#false} is VALID [2022-04-27 21:35:08,181 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,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:08,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089043730] [2022-04-27 21:35:08,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089043730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:08,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:08,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:35:08,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326039229] [2022-04-27 21:35:08,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:08,183 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:08,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:08,183 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:08,191 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:08,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:35:08,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:08,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:35:08,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:35:08,192 INFO L87 Difference]: Start difference. First operand 67 states and 71 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:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:08,367 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-27 21:35:08,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:35:08,367 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:08,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:08,368 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:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-27 21:35:08,369 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:08,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-27 21:35:08,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2022-04-27 21:35:08,412 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:08,413 INFO L225 Difference]: With dead ends: 69 [2022-04-27 21:35:08,413 INFO L226 Difference]: Without dead ends: 65 [2022-04-27 21:35:08,413 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:08,414 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 23 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:08,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 147 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:08,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-27 21:35:08,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-04-27 21:35:08,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:08,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 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:08,424 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 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:08,425 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 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:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:08,426 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-04-27 21:35:08,426 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-04-27 21:35:08,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:08,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:08,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 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 65 states. [2022-04-27 21:35:08,426 INFO L87 Difference]: Start difference. First operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 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 65 states. [2022-04-27 21:35:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:08,427 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-04-27 21:35:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-04-27 21:35:08,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:08,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:08,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:08,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 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:08,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-04-27 21:35:08,429 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2022-04-27 21:35:08,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:08,429 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-04-27 21:35:08,429 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:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-27 21:35:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:35:08,429 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:08,429 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:08,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 21:35:08,430 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:08,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:08,430 INFO L85 PathProgramCache]: Analyzing trace with hash -146756306, now seen corresponding path program 1 times [2022-04-27 21:35:08,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:08,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130481303] [2022-04-27 21:35:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:08,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:08,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:08,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {1910#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {1902#true} is VALID [2022-04-27 21:35:08,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {1902#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1902#true} is VALID [2022-04-27 21:35:08,472 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1902#true} {1902#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1902#true} is VALID [2022-04-27 21:35:08,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {1902#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1910#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {1910#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {1902#true} is VALID [2022-04-27 21:35:08,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {1902#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1902#true} is VALID [2022-04-27 21:35:08,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1902#true} {1902#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1902#true} is VALID [2022-04-27 21:35:08,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {1902#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1902#true} is VALID [2022-04-27 21:35:08,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {1902#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {1902#true} is VALID [2022-04-27 21:35:08,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {1902#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {1907#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:08,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {1907#(= main_~main__t~0 0)} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {1907#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:08,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {1907#(= main_~main__t~0 0)} [206] L32-->L265: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~main____CPAchecker_TMP_0~0_6 0) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {1907#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:08,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {1907#(= main_~main__t~0 0)} [210] L265-->L276: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 (ite (<= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_18) 1 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_26, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_26, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {1907#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:08,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {1907#(= main_~main__t~0 0)} [214] L276-->L384: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 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_7} 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_7, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {1907#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:08,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {1907#(= main_~main__t~0 0)} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {1908#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:08,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {1908#(<= 1 main_~main__t~0)} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {1908#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:08,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {1908#(<= 1 main_~main__t~0)} [231] L324-->L331: Formula: (and (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_32) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1) (not (= v_main_~main____CPAchecker_TMP_0~1_3 0))) InVars {main_~main__t~0=v_main_~main__t~0_32, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} OutVars{main_~main__t~0=v_main_~main__t~0_32, 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_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {1909#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-27 21:35:08,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {1909#(not (= main_~__VERIFIER_assert__cond~16 0))} [245] L331-->L333: 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[] {1903#false} is VALID [2022-04-27 21:35:08,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {1903#false} [259] L333-->mainErr14ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1903#false} is VALID [2022-04-27 21:35:08,477 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,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:08,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130481303] [2022-04-27 21:35:08,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130481303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:08,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:08,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:35:08,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054393417] [2022-04-27 21:35:08,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:08,478 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:08,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:08,478 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:08,488 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:08,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:35:08,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:08,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:35:08,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:35:08,489 INFO L87 Difference]: Start difference. First operand 63 states and 67 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:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:08,824 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-04-27 21:35:08,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:35:08,825 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:08,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:08,825 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:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-27 21:35:08,826 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:08,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-27 21:35:08,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-27 21:35:08,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:08,892 INFO L225 Difference]: With dead ends: 95 [2022-04-27 21:35:08,892 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 21:35:08,892 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:08,892 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 90 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:08,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 153 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:08,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 21:35:08,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 61. [2022-04-27 21:35:08,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:08,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 2 states 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,905 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 2 states 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,905 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 2 states 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,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:08,907 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-04-27 21:35:08,907 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2022-04-27 21:35:08,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:08,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:08,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 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 93 states. [2022-04-27 21:35:08,907 INFO L87 Difference]: Start difference. First operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 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 93 states. [2022-04-27 21:35:08,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:08,909 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-04-27 21:35:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2022-04-27 21:35:08,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:08,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:08,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:08,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 2 states 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,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-04-27 21:35:08,910 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 16 [2022-04-27 21:35:08,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:08,910 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-04-27 21:35:08,910 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:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-27 21:35:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:35:08,911 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:08,911 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:08,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 21:35:08,911 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:08,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:08,911 INFO L85 PathProgramCache]: Analyzing trace with hash -146755279, now seen corresponding path program 1 times [2022-04-27 21:35:08,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:08,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122326531] [2022-04-27 21:35:08,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:08,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:08,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:08,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {2287#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {2279#true} is VALID [2022-04-27 21:35:08,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {2279#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2279#true} is VALID [2022-04-27 21:35:08,978 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2279#true} {2279#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2279#true} is VALID [2022-04-27 21:35:08,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {2279#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2287#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {2287#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {2279#true} is VALID [2022-04-27 21:35:08,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {2279#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2279#true} is VALID [2022-04-27 21:35:08,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2279#true} {2279#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2279#true} is VALID [2022-04-27 21:35:08,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {2279#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2279#true} is VALID [2022-04-27 21:35:08,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {2279#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {2279#true} is VALID [2022-04-27 21:35:08,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {2279#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {2284#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:08,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {2284#(= main_~main__t~0 0)} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {2284#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:08,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {2284#(= main_~main__t~0 0)} [206] L32-->L265: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~main____CPAchecker_TMP_0~0_6 0) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {2284#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:08,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {2284#(= main_~main__t~0 0)} [210] L265-->L276: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 (ite (<= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_18) 1 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_26, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_26, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {2284#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:08,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {2284#(= main_~main__t~0 0)} [214] L276-->L384: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 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_7} 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_7, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {2284#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:08,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {2284#(= main_~main__t~0 0)} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {2285#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:08,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {2285#(<= 1 main_~main__t~0)} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {2285#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:09,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {2285#(<= 1 main_~main__t~0)} [232] L324-->L364: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_5 0) (= v_main_~__tmp_19~0_1 v_main_~__VERIFIER_assert__cond~18_1) (= v_main_~__tmp_19~0_1 (ite (<= 0 v_main_~main__t~0_34) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5} OutVars{main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__tmp_19~0=v_main_~__tmp_19~0_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_1} AuxVars[] AssignedVars[main_~__tmp_19~0, main_~__VERIFIER_assert__cond~18] {2286#(not (= main_~__VERIFIER_assert__cond~18 0))} is VALID [2022-04-27 21:35:09,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {2286#(not (= main_~__VERIFIER_assert__cond~18 0))} [247] L364-->L366: Formula: (= v_main_~__VERIFIER_assert__cond~18_3 0) InVars {main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_3} OutVars{main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_3} AuxVars[] AssignedVars[] {2280#false} is VALID [2022-04-27 21:35:09,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {2280#false} [263] L366-->mainErr16ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2280#false} is VALID [2022-04-27 21:35:09,010 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,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:09,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122326531] [2022-04-27 21:35:09,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122326531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:09,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:09,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:35:09,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924655698] [2022-04-27 21:35:09,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:09,011 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:09,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:09,011 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:09,020 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:09,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:35:09,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:09,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:35:09,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:35:09,020 INFO L87 Difference]: Start difference. First operand 61 states and 65 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:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:09,368 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2022-04-27 21:35:09,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:35:09,369 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:09,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:09,369 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:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-27 21:35:09,370 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:09,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-27 21:35:09,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 111 transitions. [2022-04-27 21:35:09,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:09,439 INFO L225 Difference]: With dead ends: 104 [2022-04-27 21:35:09,439 INFO L226 Difference]: Without dead ends: 102 [2022-04-27 21:35:09,439 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:09,440 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 98 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:09,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 157 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:09,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-27 21:35:09,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 59. [2022-04-27 21:35:09,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:09,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 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:09,448 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 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:09,449 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 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:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:09,450 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-04-27 21:35:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-04-27 21:35:09,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:09,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:09,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 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 102 states. [2022-04-27 21:35:09,451 INFO L87 Difference]: Start difference. First operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 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 102 states. [2022-04-27 21:35:09,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:09,452 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-04-27 21:35:09,452 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-04-27 21:35:09,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:09,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:09,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:09,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 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:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-27 21:35:09,454 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2022-04-27 21:35:09,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:09,454 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-27 21:35:09,454 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:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-27 21:35:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 21:35:09,454 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:09,454 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:09,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 21:35:09,455 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:09,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:09,455 INFO L85 PathProgramCache]: Analyzing trace with hash -146787122, now seen corresponding path program 1 times [2022-04-27 21:35:09,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:09,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506379478] [2022-04-27 21:35:09,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:09,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:09,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:09,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {2689#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {2682#true} is VALID [2022-04-27 21:35:09,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {2682#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2682#true} is VALID [2022-04-27 21:35:09,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2682#true} {2682#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2682#true} is VALID [2022-04-27 21:35:09,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {2682#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2689#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {2689#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {2682#true} is VALID [2022-04-27 21:35:09,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {2682#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2682#true} is VALID [2022-04-27 21:35:09,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2682#true} {2682#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2682#true} is VALID [2022-04-27 21:35:09,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {2682#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2682#true} is VALID [2022-04-27 21:35:09,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {2682#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {2682#true} is VALID [2022-04-27 21:35:09,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {2682#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {2682#true} is VALID [2022-04-27 21:35:09,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {2682#true} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {2682#true} is VALID [2022-04-27 21:35:09,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {2682#true} [206] L32-->L265: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~main____CPAchecker_TMP_0~0_6 0) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {2682#true} is VALID [2022-04-27 21:35:09,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {2682#true} [210] L265-->L276: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 (ite (<= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_18) 1 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_26, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_26, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {2682#true} is VALID [2022-04-27 21:35:09,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {2682#true} [214] L276-->L384: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 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_7} 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_7, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {2682#true} is VALID [2022-04-27 21:35:09,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {2682#true} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {2682#true} is VALID [2022-04-27 21:35:09,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {2682#true} [223] L288-->L295: Formula: (and (= (ite (<= 0 v_main_~main__t~0_29) 1 0) v_main_~__tmp_15~0_1) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1) (= v_main_~main__t~0_29 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_29} OutVars{main_~main__t~0=v_main_~main__t~0_29, 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_19} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14] {2687#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:09,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {2687#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [230] L295-->L307: Formula: (and (= (ite (<= v_main_~main__t~0_30 v_main_~main__tagbuf_len~0_20) 1 0) v_main_~__tmp_16~0_1) (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_30, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_20} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_1, main_~main__t~0=v_main_~main__t~0_30, 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_20} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~15, main_~__tmp_16~0] {2688#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-27 21:35:09,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {2688#(not (= main_~__VERIFIER_assert__cond~15 0))} [243] L307-->L309: 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[] {2683#false} is VALID [2022-04-27 21:35:09,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {2683#false} [257] L309-->mainErr13ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2683#false} is VALID [2022-04-27 21:35:09,504 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,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:09,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506379478] [2022-04-27 21:35:09,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506379478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:09,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:09,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:35:09,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472800600] [2022-04-27 21:35:09,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:09,505 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:09,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:09,505 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:09,513 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:09,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:35:09,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:09,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:35:09,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:35:09,514 INFO L87 Difference]: Start difference. First operand 59 states and 63 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:09,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:09,671 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-27 21:35:09,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:35:09,671 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:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:09,671 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:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-27 21:35:09,672 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:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-27 21:35:09,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-04-27 21:35:09,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:09,719 INFO L225 Difference]: With dead ends: 61 [2022-04-27 21:35:09,719 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 21:35:09,719 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:09,719 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 20 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:09,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 129 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:09,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 21:35:09,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-04-27 21:35:09,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:09,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 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:09,728 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 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:09,728 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 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:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:09,729 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-27 21:35:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-27 21:35:09,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:09,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:09,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 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 57 states. [2022-04-27 21:35:09,729 INFO L87 Difference]: Start difference. First operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 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 57 states. [2022-04-27 21:35:09,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:09,730 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-27 21:35:09,730 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-27 21:35:09,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:09,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:09,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:09,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 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:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-04-27 21:35:09,732 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2022-04-27 21:35:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:09,732 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-04-27 21:35:09,732 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:09,732 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-04-27 21:35:09,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:35:09,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:09,732 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:09,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 21:35:09,732 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:09,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:09,733 INFO L85 PathProgramCache]: Analyzing trace with hash 499454240, now seen corresponding path program 1 times [2022-04-27 21:35:09,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:09,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135402789] [2022-04-27 21:35:09,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:09,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:09,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:09,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {2953#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {2945#true} is VALID [2022-04-27 21:35:09,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {2945#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2945#true} is VALID [2022-04-27 21:35:09,780 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2945#true} {2945#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2945#true} is VALID [2022-04-27 21:35:09,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {2945#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2953#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {2953#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {2945#true} is VALID [2022-04-27 21:35:09,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {2945#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2945#true} is VALID [2022-04-27 21:35:09,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2945#true} {2945#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2945#true} is VALID [2022-04-27 21:35:09,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {2945#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2945#true} is VALID [2022-04-27 21:35:09,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {2945#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {2945#true} is VALID [2022-04-27 21:35:09,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {2945#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {2950#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:09,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {2950#(= main_~main__t~0 0)} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {2950#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:09,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {2950#(= main_~main__t~0 0)} [205] L32-->L39: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (<= 0 v_main_~main__t~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {2950#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:09,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {2950#(= main_~main__t~0 0)} [208] L39-->L50: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= (ite (<= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8) 1 0) v_main_~__tmp_2~0_1) (= 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {2950#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:09,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {2950#(= main_~main__t~0 0)} [212] L50-->L351: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_259_0~0_1)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, ~__tmp_259_0~0=v_~__tmp_259_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[~__tmp_259_0~0] {2950#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:09,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {2950#(= main_~main__t~0 0)} [217] L351-->L195: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_259_0~0_2) (= (+ v_main_~main__t~0_8 1) v_main_~main__t~0_7) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_8)) InVars {main_~main__t~0=v_main_~main__t~0_8, ~__tmp_259_0~0=v_~__tmp_259_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, ~__tmp_259_0~0=v_~__tmp_259_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {2951#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:09,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {2951#(<= 1 main_~main__t~0)} [222] L195-->L101: 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_11 v_main_~main__tagbuf_len~0_11)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet6=|v_main_#t~nondet6_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__tagbuf_len~0=v_main_~main__tagbuf_len~0_11, 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] {2951#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:09,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {2951#(<= 1 main_~main__t~0)} [227] L101-->L105: 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] {2951#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:09,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {2951#(<= 1 main_~main__t~0)} [237] L105-->L112: Formula: (and (= v_main_~__tmp_5~0_1 (ite (<= 0 v_main_~main__t~0_12) 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_12, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_12, 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] {2952#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-27 21:35:09,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {2952#(not (= main_~__VERIFIER_assert__cond~4 0))} [252] L112-->L114: 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[] {2946#false} is VALID [2022-04-27 21:35:09,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {2946#false} [267] L114-->mainErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2946#false} is VALID [2022-04-27 21:35:09,785 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,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:09,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135402789] [2022-04-27 21:35:09,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135402789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:09,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:09,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:35:09,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689048896] [2022-04-27 21:35:09,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:09,786 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:09,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:09,786 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:09,796 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:09,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:35:09,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:09,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:35:09,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:35:09,796 INFO L87 Difference]: Start difference. First operand 55 states and 59 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:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:10,063 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-04-27 21:35:10,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:35:10,064 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:10,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:10,064 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:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 21:35:10,065 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:10,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 21:35:10,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-27 21:35:10,116 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:10,117 INFO L225 Difference]: With dead ends: 74 [2022-04-27 21:35:10,117 INFO L226 Difference]: Without dead ends: 72 [2022-04-27 21:35:10,117 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:10,118 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 74 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:10,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 116 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:10,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-27 21:35:10,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 53. [2022-04-27 21:35:10,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:10,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 2 states 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,124 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 2 states 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,124 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 2 states 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,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:10,125 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-27 21:35:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-27 21:35:10,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:10,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:10,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 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:10,126 INFO L87 Difference]: Start difference. First operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 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:10,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:10,127 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-04-27 21:35:10,127 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-04-27 21:35:10,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:10,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:10,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:10,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 2 states 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,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-04-27 21:35:10,128 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2022-04-27 21:35:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:10,128 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-04-27 21:35:10,128 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:10,128 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 21:35:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:35:10,128 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:10,128 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:10,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 21:35:10,129 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:10,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:10,129 INFO L85 PathProgramCache]: Analyzing trace with hash 499486052, now seen corresponding path program 1 times [2022-04-27 21:35:10,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:10,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893688121] [2022-04-27 21:35:10,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:10,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:10,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:10,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {3259#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {3251#true} is VALID [2022-04-27 21:35:10,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {3251#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3251#true} is VALID [2022-04-27 21:35:10,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3251#true} {3251#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3251#true} is VALID [2022-04-27 21:35:10,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {3251#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3259#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {3259#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {3251#true} is VALID [2022-04-27 21:35:10,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {3251#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3251#true} is VALID [2022-04-27 21:35:10,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3251#true} {3251#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3251#true} is VALID [2022-04-27 21:35:10,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {3251#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3251#true} is VALID [2022-04-27 21:35:10,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {3251#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {3251#true} is VALID [2022-04-27 21:35:10,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {3251#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {3256#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:10,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {3256#(= main_~main__t~0 0)} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {3256#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:10,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {3256#(= main_~main__t~0 0)} [205] L32-->L39: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (<= 0 v_main_~main__t~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {3256#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:10,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {3256#(= main_~main__t~0 0)} [208] L39-->L50: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= (ite (<= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8) 1 0) v_main_~__tmp_2~0_1) (= 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3256#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:10,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {3256#(= main_~main__t~0 0)} [212] L50-->L351: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_259_0~0_1)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, ~__tmp_259_0~0=v_~__tmp_259_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[~__tmp_259_0~0] {3256#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:10,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {3256#(= main_~main__t~0 0)} [217] L351-->L195: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_259_0~0_2) (= (+ v_main_~main__t~0_8 1) v_main_~main__t~0_7) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_8)) InVars {main_~main__t~0=v_main_~main__t~0_8, ~__tmp_259_0~0=v_~__tmp_259_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, ~__tmp_259_0~0=v_~__tmp_259_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {3257#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:10,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {3257#(<= 1 main_~main__t~0)} [222] L195-->L101: 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_11 v_main_~main__tagbuf_len~0_11)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet6=|v_main_#t~nondet6_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__tagbuf_len~0=v_main_~main__tagbuf_len~0_11, 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] {3257#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:10,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {3257#(<= 1 main_~main__t~0)} [228] L101-->L215: 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] {3257#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:10,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {3257#(<= 1 main_~main__t~0)} [239] L215-->L222: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (<= 0 v_main_~main__t~0_23) 1 0) v_main_~__tmp_11~0_1) (not (= v_main_~main____CPAchecker_TMP_6~0_3 0))) InVars {main_~main__t~0=v_main_~main__t~0_23, main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_23, 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] {3258#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-27 21:35:10,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {3258#(not (= main_~__VERIFIER_assert__cond~10 0))} [255] L222-->L224: 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[] {3252#false} is VALID [2022-04-27 21:35:10,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {3252#false} [273] L224-->mainErr9ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3252#false} is VALID [2022-04-27 21:35:10,201 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,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:10,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893688121] [2022-04-27 21:35:10,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893688121] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:10,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:10,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:35:10,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599638748] [2022-04-27 21:35:10,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:10,201 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:10,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:10,202 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:10,211 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:10,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:35:10,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:10,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:35:10,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:35:10,211 INFO L87 Difference]: Start difference. First operand 53 states and 57 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:10,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:10,415 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-27 21:35:10,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:35:10,415 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:10,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:10,415 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:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-27 21:35:10,416 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:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-27 21:35:10,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-27 21:35:10,453 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:10,454 INFO L225 Difference]: With dead ends: 55 [2022-04-27 21:35:10,454 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 21:35:10,454 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:10,455 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:10,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 90 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:10,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 21:35:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-04-27 21:35:10,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:10,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 2 states 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,461 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 2 states 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,461 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 2 states 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,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:10,462 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 21:35:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 21:35:10,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:10,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:10,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 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:10,462 INFO L87 Difference]: Start difference. First operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 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:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:10,463 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 21:35:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-27 21:35:10,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:10,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:10,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:10,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 2 states 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,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-04-27 21:35:10,464 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2022-04-27 21:35:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:10,464 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-04-27 21:35:10,464 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:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-27 21:35:10,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:35:10,464 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:10,465 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:10,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 21:35:10,465 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:10,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:10,465 INFO L85 PathProgramCache]: Analyzing trace with hash -254476890, now seen corresponding path program 1 times [2022-04-27 21:35:10,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:10,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204786904] [2022-04-27 21:35:10,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:10,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:10,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:10,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {3505#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {3496#true} is VALID [2022-04-27 21:35:10,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {3496#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3496#true} is VALID [2022-04-27 21:35:10,551 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3496#true} {3496#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3496#true} is VALID [2022-04-27 21:35:10,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {3496#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3505#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {3505#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {3496#true} is VALID [2022-04-27 21:35:10,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {3496#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3496#true} is VALID [2022-04-27 21:35:10,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3496#true} {3496#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3496#true} is VALID [2022-04-27 21:35:10,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {3496#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3496#true} is VALID [2022-04-27 21:35:10,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {3496#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {3496#true} is VALID [2022-04-27 21:35:10,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {3496#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {3501#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:10,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {3501#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {3502#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:10,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {3502#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [206] L32-->L265: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~main____CPAchecker_TMP_0~0_6 0) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {3502#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:10,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {3502#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [210] L265-->L276: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 (ite (<= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_18) 1 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_26, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_26, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {3502#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:10,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {3502#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [214] L276-->L384: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 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_7} 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_7, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {3502#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:10,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {3502#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {3503#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:10,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {3503#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {3503#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:10,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {3503#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [231] L324-->L331: Formula: (and (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_32) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1) (not (= v_main_~main____CPAchecker_TMP_0~1_3 0))) InVars {main_~main__t~0=v_main_~main__t~0_32, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} OutVars{main_~main__t~0=v_main_~main__t~0_32, 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_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {3503#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:10,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {3503#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [246] L331-->L343: Formula: (and (= v_main_~__tmp_18~0_1 (ite (<= v_main_~main__t~0_33 v_main_~main__tagbuf_len~0_22) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_22} OutVars{main_~main__t~0=v_main_~main__t~0_33, 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_22, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {3504#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2022-04-27 21:35:10,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {3504#(not (= main_~__VERIFIER_assert__cond~17 0))} [261] L343-->L345: 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[] {3497#false} is VALID [2022-04-27 21:35:10,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {3497#false} [277] L345-->mainErr15ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3497#false} is VALID [2022-04-27 21:35:10,559 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,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:10,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204786904] [2022-04-27 21:35:10,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204786904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:10,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:10,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:35:10,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113860811] [2022-04-27 21:35:10,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:10,560 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:10,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:10,561 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:10,570 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:10,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:35:10,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:10,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:35:10,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:35:10,570 INFO L87 Difference]: Start difference. First operand 51 states and 55 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:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:10,952 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-04-27 21:35:10,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:35:10,953 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:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:10,953 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:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-04-27 21:35:10,954 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:10,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-04-27 21:35:10,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 119 transitions. [2022-04-27 21:35:11,033 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:11,034 INFO L225 Difference]: With dead ends: 110 [2022-04-27 21:35:11,034 INFO L226 Difference]: Without dead ends: 108 [2022-04-27 21:35:11,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 21:35:11,035 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 73 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:11,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 210 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-27 21:35:11,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 56. [2022-04-27 21:35:11,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:11,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states 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,053 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states 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,053 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states 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,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:11,055 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-04-27 21:35:11,055 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-04-27 21:35:11,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:11,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:11,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 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:11,056 INFO L87 Difference]: Start difference. First operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 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:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:11,057 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-04-27 21:35:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-04-27 21:35:11,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:11,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:11,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:11,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states 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,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-27 21:35:11,058 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 17 [2022-04-27 21:35:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:11,058 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-27 21:35:11,058 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:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 21:35:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:35:11,059 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:11,059 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:11,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 21:35:11,059 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:11,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:11,059 INFO L85 PathProgramCache]: Analyzing trace with hash -254445051, now seen corresponding path program 1 times [2022-04-27 21:35:11,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:11,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092161468] [2022-04-27 21:35:11,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:11,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:11,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:11,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {3930#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {3921#true} is VALID [2022-04-27 21:35:11,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {3921#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3921#true} is VALID [2022-04-27 21:35:11,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3921#true} {3921#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3921#true} is VALID [2022-04-27 21:35:11,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {3921#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3930#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {3930#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {3921#true} is VALID [2022-04-27 21:35:11,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {3921#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3921#true} is VALID [2022-04-27 21:35:11,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3921#true} {3921#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3921#true} is VALID [2022-04-27 21:35:11,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {3921#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3921#true} is VALID [2022-04-27 21:35:11,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {3921#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {3921#true} is VALID [2022-04-27 21:35:11,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {3921#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {3926#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:11,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {3926#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {3927#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:11,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {3927#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [206] L32-->L265: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~main____CPAchecker_TMP_0~0_6 0) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {3927#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:11,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {3927#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [210] L265-->L276: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 (ite (<= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_18) 1 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_26, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_26, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {3927#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:11,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {3927#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [214] L276-->L384: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 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_7} 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_7, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {3927#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:11,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {3927#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {3928#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:11,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {3928#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {3928#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:11,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {3928#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [232] L324-->L364: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_5 0) (= v_main_~__tmp_19~0_1 v_main_~__VERIFIER_assert__cond~18_1) (= v_main_~__tmp_19~0_1 (ite (<= 0 v_main_~main__t~0_34) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5} OutVars{main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__tmp_19~0=v_main_~__tmp_19~0_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_1} AuxVars[] AssignedVars[main_~__tmp_19~0, main_~__VERIFIER_assert__cond~18] {3928#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:11,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {3928#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [248] L364-->L376: Formula: (and (= v_main_~__tmp_20~0_1 v_main_~__VERIFIER_assert__cond~19_1) (not (= v_main_~__VERIFIER_assert__cond~18_4 0)) (= (ite (<= v_main_~main__t~0_35 v_main_~main__tagbuf_len~0_23) 1 0) v_main_~__tmp_20~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_35, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} OutVars{main_~main__t~0=v_main_~main__t~0_35, main_~__tmp_20~0=v_main_~__tmp_20~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} AuxVars[] AssignedVars[main_~__tmp_20~0, main_~__VERIFIER_assert__cond~19] {3929#(not (= main_~__VERIFIER_assert__cond~19 0))} is VALID [2022-04-27 21:35:11,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {3929#(not (= main_~__VERIFIER_assert__cond~19 0))} [265] L376-->L378: Formula: (= v_main_~__VERIFIER_assert__cond~19_3 0) InVars {main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_3} OutVars{main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_3} AuxVars[] AssignedVars[] {3922#false} is VALID [2022-04-27 21:35:11,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {3922#false} [279] L378-->mainErr17ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3922#false} is VALID [2022-04-27 21:35:11,138 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,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:11,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092161468] [2022-04-27 21:35:11,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092161468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:11,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:11,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:35:11,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738902719] [2022-04-27 21:35:11,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:11,139 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:11,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:11,139 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:11,148 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:11,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:35:11,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:11,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:35:11,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:35:11,149 INFO L87 Difference]: Start difference. First operand 56 states and 61 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:11,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:11,552 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-04-27 21:35:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:35:11,552 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:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:11,552 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:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2022-04-27 21:35:11,553 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:11,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2022-04-27 21:35:11,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 117 transitions. [2022-04-27 21:35:11,633 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:11,634 INFO L225 Difference]: With dead ends: 108 [2022-04-27 21:35:11,634 INFO L226 Difference]: Without dead ends: 106 [2022-04-27 21:35:11,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 21:35:11,635 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 79 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:11,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 225 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:11,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-27 21:35:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 58. [2022-04-27 21:35:11,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:11,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 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:11,647 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 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:11,647 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 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:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:11,649 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-04-27 21:35:11,649 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2022-04-27 21:35:11,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:11,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:11,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 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 106 states. [2022-04-27 21:35:11,650 INFO L87 Difference]: Start difference. First operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 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 106 states. [2022-04-27 21:35:11,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:11,651 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-04-27 21:35:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2022-04-27 21:35:11,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:11,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:11,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:11,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 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:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-04-27 21:35:11,652 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 17 [2022-04-27 21:35:11,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:11,653 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-04-27 21:35:11,653 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:11,653 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-04-27 21:35:11,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 21:35:11,653 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:11,653 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:11,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 21:35:11,653 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:11,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1696786440, now seen corresponding path program 1 times [2022-04-27 21:35:11,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:11,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267793814] [2022-04-27 21:35:11,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:11,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:11,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:11,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {4351#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {4342#true} is VALID [2022-04-27 21:35:11,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {4342#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4342#true} is VALID [2022-04-27 21:35:11,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4342#true} {4342#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4342#true} is VALID [2022-04-27 21:35:11,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {4342#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4351#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {4351#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {4342#true} is VALID [2022-04-27 21:35:11,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {4342#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4342#true} is VALID [2022-04-27 21:35:11,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4342#true} {4342#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4342#true} is VALID [2022-04-27 21:35:11,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {4342#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4342#true} is VALID [2022-04-27 21:35:11,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {4342#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {4342#true} is VALID [2022-04-27 21:35:11,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {4342#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {4347#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:11,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {4347#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {4348#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:11,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {4348#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [205] L32-->L39: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (<= 0 v_main_~main__t~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {4348#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:11,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {4348#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [208] L39-->L50: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= (ite (<= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8) 1 0) v_main_~__tmp_2~0_1) (= 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4348#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:11,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {4348#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [212] L50-->L351: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_259_0~0_1)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, ~__tmp_259_0~0=v_~__tmp_259_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[~__tmp_259_0~0] {4348#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:11,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {4348#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [217] L351-->L195: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_259_0~0_2) (= (+ v_main_~main__t~0_8 1) v_main_~main__t~0_7) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_8)) InVars {main_~main__t~0=v_main_~main__t~0_8, ~__tmp_259_0~0=v_~__tmp_259_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, ~__tmp_259_0~0=v_~__tmp_259_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {4349#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:11,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {4349#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [222] L195-->L101: 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_11 v_main_~main__tagbuf_len~0_11)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet6=|v_main_#t~nondet6_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__tagbuf_len~0=v_main_~main__tagbuf_len~0_11, 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] {4349#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:11,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {4349#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [227] L101-->L105: 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] {4349#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:11,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {4349#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [237] L105-->L112: Formula: (and (= v_main_~__tmp_5~0_1 (ite (<= 0 v_main_~main__t~0_12) 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_12, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_12, 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] {4349#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:11,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {4349#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [253] L112-->L124: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= v_main_~main__t~0_13 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~main__t~0=v_main_~main__t~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~main__t~0=v_main_~main__t~0_13, 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_12, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {4350#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-27 21:35:11,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {4350#(not (= main_~__VERIFIER_assert__cond~5 0))} [269] L124-->L126: 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[] {4343#false} is VALID [2022-04-27 21:35:11,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {4343#false} [281] L126-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4343#false} is VALID [2022-04-27 21:35:11,765 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,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:11,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267793814] [2022-04-27 21:35:11,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267793814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:11,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:11,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:35:11,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618014114] [2022-04-27 21:35:11,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:11,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 21:35:11,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:11,766 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:11,777 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:11,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:35:11,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:11,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:35:11,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:35:11,777 INFO L87 Difference]: Start difference. First operand 58 states and 63 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:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:12,097 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2022-04-27 21:35:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:35:12,097 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:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:12,097 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:12,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-27 21:35:12,100 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:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-04-27 21:35:12,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 105 transitions. [2022-04-27 21:35:12,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:12,175 INFO L225 Difference]: With dead ends: 96 [2022-04-27 21:35:12,176 INFO L226 Difference]: Without dead ends: 94 [2022-04-27 21:35:12,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 21:35:12,177 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 65 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:12,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 146 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:12,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-27 21:35:12,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 64. [2022-04-27 21:35:12,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:12,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 64 states, 53 states have (on average 1.2830188679245282) 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:12,194 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 64 states, 53 states have (on average 1.2830188679245282) 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:12,194 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 64 states, 53 states have (on average 1.2830188679245282) 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:12,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:12,195 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-04-27 21:35:12,196 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-04-27 21:35:12,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:12,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:12,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 53 states have (on average 1.2830188679245282) 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 94 states. [2022-04-27 21:35:12,196 INFO L87 Difference]: Start difference. First operand has 64 states, 53 states have (on average 1.2830188679245282) 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 94 states. [2022-04-27 21:35:12,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:12,197 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-04-27 21:35:12,197 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-04-27 21:35:12,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:12,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:12,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:12,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 53 states have (on average 1.2830188679245282) 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:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-04-27 21:35:12,198 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 18 [2022-04-27 21:35:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:12,198 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-04-27 21:35:12,198 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:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-27 21:35:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 21:35:12,199 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:12,199 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:12,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 21:35:12,199 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:12,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:12,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1696755622, now seen corresponding path program 1 times [2022-04-27 21:35:12,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:12,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826794030] [2022-04-27 21:35:12,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:12,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:12,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:12,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {4743#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {4735#true} is VALID [2022-04-27 21:35:12,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {4735#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4735#true} is VALID [2022-04-27 21:35:12,258 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4735#true} {4735#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4735#true} is VALID [2022-04-27 21:35:12,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {4735#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4743#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {4743#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {4735#true} is VALID [2022-04-27 21:35:12,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {4735#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4735#true} is VALID [2022-04-27 21:35:12,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4735#true} {4735#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4735#true} is VALID [2022-04-27 21:35:12,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {4735#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4735#true} is VALID [2022-04-27 21:35:12,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {4735#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {4735#true} is VALID [2022-04-27 21:35:12,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {4735#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {4740#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:12,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {4740#(= main_~main__t~0 0)} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {4740#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:12,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {4740#(= main_~main__t~0 0)} [205] L32-->L39: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (<= 0 v_main_~main__t~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {4740#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:12,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {4740#(= main_~main__t~0 0)} [208] L39-->L50: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= (ite (<= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8) 1 0) v_main_~__tmp_2~0_1) (= 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4740#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:12,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {4740#(= main_~main__t~0 0)} [212] L50-->L351: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_259_0~0_1)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, ~__tmp_259_0~0=v_~__tmp_259_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[~__tmp_259_0~0] {4740#(= main_~main__t~0 0)} is VALID [2022-04-27 21:35:12,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {4740#(= main_~main__t~0 0)} [217] L351-->L195: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_259_0~0_2) (= (+ v_main_~main__t~0_8 1) v_main_~main__t~0_7) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_8)) InVars {main_~main__t~0=v_main_~main__t~0_8, ~__tmp_259_0~0=v_~__tmp_259_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, ~__tmp_259_0~0=v_~__tmp_259_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {4741#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:12,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {4741#(<= 1 main_~main__t~0)} [222] L195-->L101: 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_11 v_main_~main__tagbuf_len~0_11)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet6=|v_main_#t~nondet6_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__tagbuf_len~0=v_main_~main__tagbuf_len~0_11, 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] {4741#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:12,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {4741#(<= 1 main_~main__t~0)} [227] L101-->L105: 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] {4741#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:12,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {4741#(<= 1 main_~main__t~0)} [238] L105-->L249: 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[] {4741#(<= 1 main_~main__t~0)} is VALID [2022-04-27 21:35:12,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {4741#(<= 1 main_~main__t~0)} [254] L249-->L174: Formula: (and (= v_main_~__tmp_9~0_1 (ite (<= 0 v_main_~main__t~0_19) 1 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__t~0=v_main_~main__t~0_19} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__t~0=v_main_~main__t~0_19, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {4742#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-27 21:35:12,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {4742#(not (= main_~__VERIFIER_assert__cond~8 0))} [271] L174-->L176: 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[] {4736#false} is VALID [2022-04-27 21:35:12,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {4736#false} [285] L176-->mainErr7ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4736#false} is VALID [2022-04-27 21:35:12,266 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,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:12,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826794030] [2022-04-27 21:35:12,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826794030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:12,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:12,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:35:12,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41918209] [2022-04-27 21:35:12,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:12,267 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:12,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:12,267 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:12,277 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:12,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:35:12,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:12,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:35:12,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:35:12,277 INFO L87 Difference]: Start difference. First operand 64 states and 71 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:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:12,538 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-27 21:35:12,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:35:12,538 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:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:12,538 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:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-27 21:35:12,539 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:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2022-04-27 21:35:12,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 79 transitions. [2022-04-27 21:35:12,584 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:12,587 INFO L225 Difference]: With dead ends: 84 [2022-04-27 21:35:12,587 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 21:35:12,587 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:12,588 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 65 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:12,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 108 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:12,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 21:35:12,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 62. [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 82 states. Second operand has 62 states, 52 states have (on average 1.2692307692307692) 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:12,610 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 62 states, 52 states have (on average 1.2692307692307692) 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:12,610 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 62 states, 52 states have (on average 1.2692307692307692) 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:12,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:12,611 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2022-04-27 21:35:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2022-04-27 21:35:12,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:12,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:12,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 52 states have (on average 1.2692307692307692) 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 82 states. [2022-04-27 21:35:12,611 INFO L87 Difference]: Start difference. First operand has 62 states, 52 states have (on average 1.2692307692307692) 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 82 states. [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 82 states and 91 transitions. [2022-04-27 21:35:12,613 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2022-04-27 21:35:12,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:12,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:12,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:12,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.2692307692307692) 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:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-04-27 21:35:12,615 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 18 [2022-04-27 21:35:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:12,615 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-04-27 21:35:12,615 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:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-04-27 21:35:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 21:35:12,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:12,616 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:12,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 21:35:12,616 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:12,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:12,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1695800260, now seen corresponding path program 1 times [2022-04-27 21:35:12,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:12,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133578866] [2022-04-27 21:35:12,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:12,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:12,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:12,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {5093#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {5084#true} is VALID [2022-04-27 21:35:12,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {5084#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5084#true} is VALID [2022-04-27 21:35:12,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5084#true} {5084#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5084#true} is VALID [2022-04-27 21:35:12,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {5084#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5093#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {5093#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {5084#true} is VALID [2022-04-27 21:35:12,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {5084#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5084#true} is VALID [2022-04-27 21:35:12,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5084#true} {5084#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5084#true} is VALID [2022-04-27 21:35:12,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {5084#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5084#true} is VALID [2022-04-27 21:35:12,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {5084#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {5084#true} is VALID [2022-04-27 21:35:12,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {5084#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {5089#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:12,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {5089#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {5090#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:12,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {5090#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [205] L32-->L39: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (<= 0 v_main_~main__t~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {5090#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:12,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {5090#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [208] L39-->L50: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= (ite (<= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8) 1 0) v_main_~__tmp_2~0_1) (= 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {5090#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:12,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {5090#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [212] L50-->L351: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_259_0~0_1)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, ~__tmp_259_0~0=v_~__tmp_259_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[~__tmp_259_0~0] {5090#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:12,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {5090#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [217] L351-->L195: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_259_0~0_2) (= (+ v_main_~main__t~0_8 1) v_main_~main__t~0_7) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_8)) InVars {main_~main__t~0=v_main_~main__t~0_8, ~__tmp_259_0~0=v_~__tmp_259_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, ~__tmp_259_0~0=v_~__tmp_259_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {5091#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:12,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {5091#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [222] L195-->L101: 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_11 v_main_~main__tagbuf_len~0_11)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet6=|v_main_#t~nondet6_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__tagbuf_len~0=v_main_~main__tagbuf_len~0_11, 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] {5091#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:12,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {5091#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [228] L101-->L215: 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] {5091#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:12,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {5091#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [239] L215-->L222: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (<= 0 v_main_~main__t~0_23) 1 0) v_main_~__tmp_11~0_1) (not (= v_main_~main____CPAchecker_TMP_6~0_3 0))) InVars {main_~main__t~0=v_main_~main__t~0_23, main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_23, 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] {5091#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:12,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {5091#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [256] L222-->L234: Formula: (and (= (ite (<= v_main_~main__t~0_24 v_main_~main__tagbuf_len~0_17) 1 0) v_main_~__tmp_12~0_1) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__t~0=v_main_~main__t~0_24, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~main__t~0=v_main_~main__t~0_24, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, 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] {5092#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-27 21:35:12,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {5092#(not (= main_~__VERIFIER_assert__cond~11 0))} [275] L234-->L236: 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[] {5085#false} is VALID [2022-04-27 21:35:12,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {5085#false} [289] L236-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5085#false} is VALID [2022-04-27 21:35:12,729 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,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:12,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133578866] [2022-04-27 21:35:12,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133578866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:12,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:12,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:35:12,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239967639] [2022-04-27 21:35:12,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:12,730 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:12,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:12,730 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:12,740 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:12,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:35:12,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:12,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:35:12,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:35:12,741 INFO L87 Difference]: Start difference. First operand 62 states and 69 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:12,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:12,981 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-04-27 21:35:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:35:12,981 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:12,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:12,981 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:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-27 21:35:12,982 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:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-27 21:35:12,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-04-27 21:35:13,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:13,029 INFO L225 Difference]: With dead ends: 74 [2022-04-27 21:35:13,030 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 21:35:13,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 21:35:13,030 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 37 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:13,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 119 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 21:35:13,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2022-04-27 21:35:13,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:13,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 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:13,053 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 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:13,053 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 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:13,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:13,054 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-27 21:35:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-27 21:35:13,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:13,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:13,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 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 70 states. [2022-04-27 21:35:13,055 INFO L87 Difference]: Start difference. First operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 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 70 states. [2022-04-27 21:35:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:13,056 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-04-27 21:35:13,056 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-04-27 21:35:13,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:13,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:13,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:13,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 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:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-04-27 21:35:13,057 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 18 [2022-04-27 21:35:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:13,057 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-04-27 21:35:13,057 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:13,057 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-04-27 21:35:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 21:35:13,057 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:13,057 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:13,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 21:35:13,058 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:13,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:13,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1059815414, now seen corresponding path program 1 times [2022-04-27 21:35:13,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:13,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583351666] [2022-04-27 21:35:13,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:13,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:13,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:13,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {5413#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {5404#true} is VALID [2022-04-27 21:35:13,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {5404#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 21:35:13,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5404#true} {5404#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 21:35:13,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {5404#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5413#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {5413#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {5404#true} is VALID [2022-04-27 21:35:13,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {5404#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 21:35:13,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5404#true} {5404#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 21:35:13,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {5404#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 21:35:13,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {5404#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {5404#true} is VALID [2022-04-27 21:35:13,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {5404#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {5409#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 21:35:13,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {5409#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {5410#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:13,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {5410#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [205] L32-->L39: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (<= 0 v_main_~main__t~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {5410#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:13,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {5410#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [208] L39-->L50: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= (ite (<= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8) 1 0) v_main_~__tmp_2~0_1) (= 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {5410#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:13,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {5410#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [212] L50-->L351: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_259_0~0_1)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, ~__tmp_259_0~0=v_~__tmp_259_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[~__tmp_259_0~0] {5410#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:13,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {5410#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} [217] L351-->L195: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_259_0~0_2) (= (+ v_main_~main__t~0_8 1) v_main_~main__t~0_7) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_8)) InVars {main_~main__t~0=v_main_~main__t~0_8, ~__tmp_259_0~0=v_~__tmp_259_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, ~__tmp_259_0~0=v_~__tmp_259_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {5411#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:13,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {5411#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [222] L195-->L101: 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_11 v_main_~main__tagbuf_len~0_11)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet6=|v_main_#t~nondet6_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__tagbuf_len~0=v_main_~main__tagbuf_len~0_11, 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] {5411#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:13,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {5411#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [227] L101-->L105: 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] {5411#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:13,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {5411#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [238] L105-->L249: 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[] {5411#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:13,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {5411#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [254] L249-->L174: Formula: (and (= v_main_~__tmp_9~0_1 (ite (<= 0 v_main_~main__t~0_19) 1 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__t~0=v_main_~main__t~0_19} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__t~0=v_main_~main__t~0_19, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {5411#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 21:35:13,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {5411#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} [272] L174-->L186: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (= (ite (<= v_main_~main__t~0_20 v_main_~main__tagbuf_len~0_16) 1 0) v_main_~__tmp_10~0_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_20, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~main__t~0=v_main_~main__t~0_20, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {5412#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-27 21:35:13,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {5412#(not (= main_~__VERIFIER_assert__cond~9 0))} [287] L186-->L188: 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[] {5405#false} is VALID [2022-04-27 21:35:13,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {5405#false} [293] L188-->mainErr8ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5405#false} is VALID [2022-04-27 21:35:13,147 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,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:13,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583351666] [2022-04-27 21:35:13,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583351666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:13,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:13,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:35:13,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575023725] [2022-04-27 21:35:13,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:13,148 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:13,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:13,148 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:13,160 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:13,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:35:13,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:13,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:35:13,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:35:13,161 INFO L87 Difference]: Start difference. First operand 63 states and 70 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:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:13,493 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-04-27 21:35:13,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:35:13,493 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:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:13,493 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:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-04-27 21:35:13,494 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:13,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2022-04-27 21:35:13,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 100 transitions. [2022-04-27 21:35:13,577 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:13,578 INFO L225 Difference]: With dead ends: 91 [2022-04-27 21:35:13,578 INFO L226 Difference]: Without dead ends: 89 [2022-04-27 21:35:13,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 21:35:13,578 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 54 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:13,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 162 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:13,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-27 21:35:13,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2022-04-27 21:35:13,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:13,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 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:13,595 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 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:13,596 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 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:13,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:13,597 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-04-27 21:35:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-04-27 21:35:13,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:13,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:13,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 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 89 states. [2022-04-27 21:35:13,597 INFO L87 Difference]: Start difference. First operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 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 89 states. [2022-04-27 21:35:13,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:13,598 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-04-27 21:35:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-04-27 21:35:13,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:13,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:13,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:13,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 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:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-04-27 21:35:13,600 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 19 [2022-04-27 21:35:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:13,600 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-04-27 21:35:13,600 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:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-04-27 21:35:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 21:35:13,600 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:13,601 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:13,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 21:35:13,601 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:13,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:13,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1475844669, now seen corresponding path program 1 times [2022-04-27 21:35:13,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:13,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241412278] [2022-04-27 21:35:13,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:13,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:13,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:13,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {5792#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {5785#true} is VALID [2022-04-27 21:35:13,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {5785#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5785#true} is VALID [2022-04-27 21:35:13,635 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5785#true} {5785#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5785#true} is VALID [2022-04-27 21:35:13,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {5785#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5792#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {5792#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {5785#true} is VALID [2022-04-27 21:35:13,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {5785#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5785#true} is VALID [2022-04-27 21:35:13,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5785#true} {5785#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5785#true} is VALID [2022-04-27 21:35:13,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {5785#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5785#true} is VALID [2022-04-27 21:35:13,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {5785#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {5785#true} is VALID [2022-04-27 21:35:13,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {5785#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {5790#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:13,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {5790#(<= 0 main_~main__tagbuf_len~0)} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {5790#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:13,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {5790#(<= 0 main_~main__tagbuf_len~0)} [205] L32-->L39: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (<= 0 v_main_~main__t~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {5790#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:13,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {5790#(<= 0 main_~main__tagbuf_len~0)} [208] L39-->L50: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= (ite (<= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8) 1 0) v_main_~__tmp_2~0_1) (= 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {5790#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:13,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {5790#(<= 0 main_~main__tagbuf_len~0)} [212] L50-->L351: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_259_0~0_1)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, ~__tmp_259_0~0=v_~__tmp_259_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[~__tmp_259_0~0] {5790#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:13,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {5790#(<= 0 main_~main__tagbuf_len~0)} [217] L351-->L195: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_259_0~0_2) (= (+ v_main_~main__t~0_8 1) v_main_~main__t~0_7) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_8)) InVars {main_~main__t~0=v_main_~main__t~0_8, ~__tmp_259_0~0=v_~__tmp_259_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, ~__tmp_259_0~0=v_~__tmp_259_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {5790#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:13,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {5790#(<= 0 main_~main__tagbuf_len~0)} [222] L195-->L101: 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_11 v_main_~main__tagbuf_len~0_11)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet6=|v_main_#t~nondet6_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__tagbuf_len~0=v_main_~main__tagbuf_len~0_11, 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] {5790#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:13,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {5790#(<= 0 main_~main__tagbuf_len~0)} [227] L101-->L105: 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] {5790#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:13,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {5790#(<= 0 main_~main__tagbuf_len~0)} [237] L105-->L112: Formula: (and (= v_main_~__tmp_5~0_1 (ite (<= 0 v_main_~main__t~0_12) 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_12, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_12, 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] {5790#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:13,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {5790#(<= 0 main_~main__tagbuf_len~0)} [253] L112-->L124: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= v_main_~main__t~0_13 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~main__t~0=v_main_~main__t~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~main__t~0=v_main_~main__t~0_13, 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_12, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {5790#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:13,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {5790#(<= 0 main_~main__tagbuf_len~0)} [270] L124-->L133: Formula: (and (= v_main_~main____CPAchecker_TMP_5~0_1 v_main_~main__t~0_15) (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) (= v_main_~main__t~0_14 (+ v_main_~main__t~0_15 1))) InVars {main_~main__t~0=v_main_~main__t~0_15, 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_14, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_5~0] {5790#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:13,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {5790#(<= 0 main_~main__tagbuf_len~0)} [283] L133-->L140: Formula: (and (= v_main_~__tmp_7~0_1 (ite (<= 0 v_main_~main__t~0_16) 1 0)) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= v_main_~main__t~0_16 v_main_~main__tagbuf_len~0_13)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~main__t~0=v_main_~main__t~0_16} OutVars{main_~main__t~0=v_main_~main__t~0_16, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {5791#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-27 21:35:13,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {5791#(not (= main_~__VERIFIER_assert__cond~6 0))} [291] L140-->L142: 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[] {5786#false} is VALID [2022-04-27 21:35:13,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {5786#false} [295] L142-->mainErr5ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5786#false} is VALID [2022-04-27 21:35:13,641 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,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:13,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241412278] [2022-04-27 21:35:13,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241412278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:13,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:13,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:35:13,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997482010] [2022-04-27 21:35:13,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:13,642 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:13,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:13,642 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:13,654 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:13,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:35:13,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:13,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:35:13,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:35:13,654 INFO L87 Difference]: Start difference. First operand 66 states and 73 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:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:13,792 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-04-27 21:35:13,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:35:13,792 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:13,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:13,793 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:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-27 21:35:13,793 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:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-27 21:35:13,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-27 21:35:13,841 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:13,842 INFO L225 Difference]: With dead ends: 66 [2022-04-27 21:35:13,842 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 21:35:13,842 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:13,842 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:13,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 75 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:35:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 21:35:13,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-27 21:35:13,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:13,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 55 states have (on average 1.2363636363636363) 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:13,860 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 55 states have (on average 1.2363636363636363) 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:13,860 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 55 states have (on average 1.2363636363636363) 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:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:13,861 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-04-27 21:35:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-27 21:35:13,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:13,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:13,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 55 states have (on average 1.2363636363636363) 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 64 states. [2022-04-27 21:35:13,862 INFO L87 Difference]: Start difference. First operand has 64 states, 55 states have (on average 1.2363636363636363) 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 64 states. [2022-04-27 21:35:13,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:13,863 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-04-27 21:35:13,863 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-27 21:35:13,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:13,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:13,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:13,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:13,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2363636363636363) 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:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-04-27 21:35:13,864 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 20 [2022-04-27 21:35:13,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:13,864 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-04-27 21:35:13,864 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:13,864 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-27 21:35:13,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 21:35:13,865 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:13,865 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:13,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 21:35:13,865 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:13,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1493454195, now seen corresponding path program 1 times [2022-04-27 21:35:13,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:13,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596441144] [2022-04-27 21:35:13,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:13,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:13,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:13,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {6088#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6081#true} is VALID [2022-04-27 21:35:13,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {6081#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6081#true} is VALID [2022-04-27 21:35:13,899 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6081#true} {6081#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6081#true} is VALID [2022-04-27 21:35:13,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {6081#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6088#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {6088#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6081#true} is VALID [2022-04-27 21:35:13,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {6081#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6081#true} is VALID [2022-04-27 21:35:13,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6081#true} {6081#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6081#true} is VALID [2022-04-27 21:35:13,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {6081#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6081#true} is VALID [2022-04-27 21:35:13,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {6081#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {6081#true} is VALID [2022-04-27 21:35:13,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {6081#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {6081#true} is VALID [2022-04-27 21:35:13,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {6081#true} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {6081#true} is VALID [2022-04-27 21:35:13,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {6081#true} [205] L32-->L39: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (<= 0 v_main_~main__t~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {6081#true} is VALID [2022-04-27 21:35:13,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {6081#true} [208] L39-->L50: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= (ite (<= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8) 1 0) v_main_~__tmp_2~0_1) (= 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {6081#true} is VALID [2022-04-27 21:35:13,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {6081#true} [212] L50-->L351: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_259_0~0_1)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, ~__tmp_259_0~0=v_~__tmp_259_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[~__tmp_259_0~0] {6081#true} is VALID [2022-04-27 21:35:13,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {6081#true} [217] L351-->L195: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_259_0~0_2) (= (+ v_main_~main__t~0_8 1) v_main_~main__t~0_7) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_8)) InVars {main_~main__t~0=v_main_~main__t~0_8, ~__tmp_259_0~0=v_~__tmp_259_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, ~__tmp_259_0~0=v_~__tmp_259_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {6081#true} is VALID [2022-04-27 21:35:13,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {6081#true} [222] L195-->L101: 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_11 v_main_~main__tagbuf_len~0_11)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet6=|v_main_#t~nondet6_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__tagbuf_len~0=v_main_~main__tagbuf_len~0_11, 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] {6081#true} is VALID [2022-04-27 21:35:13,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {6081#true} [227] L101-->L105: 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] {6081#true} is VALID [2022-04-27 21:35:13,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {6081#true} [237] L105-->L112: Formula: (and (= v_main_~__tmp_5~0_1 (ite (<= 0 v_main_~main__t~0_12) 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_12, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_12, 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] {6081#true} is VALID [2022-04-27 21:35:13,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {6081#true} [253] L112-->L124: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= v_main_~main__t~0_13 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~main__t~0=v_main_~main__t~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~main__t~0=v_main_~main__t~0_13, 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_12, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {6081#true} is VALID [2022-04-27 21:35:13,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {6081#true} [270] L124-->L133: Formula: (and (= v_main_~main____CPAchecker_TMP_5~0_1 v_main_~main__t~0_15) (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) (= v_main_~main__t~0_14 (+ v_main_~main__t~0_15 1))) InVars {main_~main__t~0=v_main_~main__t~0_15, 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_14, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_5~0] {6081#true} is VALID [2022-04-27 21:35:13,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {6081#true} [283] L133-->L140: Formula: (and (= v_main_~__tmp_7~0_1 (ite (<= 0 v_main_~main__t~0_16) 1 0)) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (= v_main_~main__t~0_16 v_main_~main__tagbuf_len~0_13)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~main__t~0=v_main_~main__t~0_16} OutVars{main_~main__t~0=v_main_~main__t~0_16, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_13, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {6086#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:13,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {6086#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [292] L140-->L152: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (not (= v_main_~__VERIFIER_assert__cond~6_4 0)) (= v_main_~__tmp_8~0_1 (ite (<= v_main_~main__t~0_17 v_main_~main__tagbuf_len~0_14) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_17, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_14, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4} OutVars{main_~main__t~0=v_main_~main__t~0_17, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_14, 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] {6087#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-27 21:35:13,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {6087#(not (= main_~__VERIFIER_assert__cond~7 0))} [297] L152-->L154: 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[] {6082#false} is VALID [2022-04-27 21:35:13,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {6082#false} [299] L154-->mainErr6ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6082#false} is VALID [2022-04-27 21:35:13,905 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,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:13,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596441144] [2022-04-27 21:35:13,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596441144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:13,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:13,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 21:35:13,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168413793] [2022-04-27 21:35:13,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:13,906 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:13,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:13,906 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:13,917 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:13,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 21:35:13,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:13,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 21:35:13,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:35:13,917 INFO L87 Difference]: Start difference. First operand 64 states and 71 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:14,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:14,056 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-04-27 21:35:14,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 21:35:14,056 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:14,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:14,056 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:14,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-27 21:35:14,057 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:14,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-04-27 21:35:14,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-04-27 21:35:14,088 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:14,089 INFO L225 Difference]: With dead ends: 64 [2022-04-27 21:35:14,089 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 21:35:14,089 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:14,089 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:14,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 101 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:35:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 21:35:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-27 21:35:14,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:14,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 52 states have (on average 1.2307692307692308) 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:14,107 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 52 states have (on average 1.2307692307692308) 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:14,107 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 52 states have (on average 1.2307692307692308) 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:14,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:14,108 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-04-27 21:35:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-04-27 21:35:14,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:14,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:14,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 52 states have (on average 1.2307692307692308) 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 60 states. [2022-04-27 21:35:14,108 INFO L87 Difference]: Start difference. First operand has 60 states, 52 states have (on average 1.2307692307692308) 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 60 states. [2022-04-27 21:35:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:14,109 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-04-27 21:35:14,109 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-04-27 21:35:14,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:14,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:14,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:14,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2307692307692308) 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:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-04-27 21:35:14,110 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 21 [2022-04-27 21:35:14,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:14,110 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-04-27 21:35:14,110 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:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-04-27 21:35:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:35:14,111 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:14,111 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:14,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 21:35:14,111 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:14,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:14,111 INFO L85 PathProgramCache]: Analyzing trace with hash 947327570, now seen corresponding path program 1 times [2022-04-27 21:35:14,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:14,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820365372] [2022-04-27 21:35:14,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:14,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:14,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:14,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {6373#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6364#true} is VALID [2022-04-27 21:35:14,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {6364#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6364#true} is VALID [2022-04-27 21:35:14,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6364#true} {6364#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6364#true} is VALID [2022-04-27 21:35:14,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {6364#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6373#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {6373#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6364#true} is VALID [2022-04-27 21:35:14,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {6364#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6364#true} is VALID [2022-04-27 21:35:14,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6364#true} {6364#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6364#true} is VALID [2022-04-27 21:35:14,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {6364#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6364#true} is VALID [2022-04-27 21:35:14,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {6364#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {6364#true} is VALID [2022-04-27 21:35:14,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {6364#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {6364#true} is VALID [2022-04-27 21:35:14,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {6364#true} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {6364#true} is VALID [2022-04-27 21:35:14,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {6364#true} [205] L32-->L39: Formula: (and (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (<= 0 v_main_~main__t~0_5) 1 0) v_main_~__tmp_1~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__t~0=v_main_~main__t~0_5, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0] {6364#true} is VALID [2022-04-27 21:35:14,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {6364#true} [208] L39-->L50: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= (ite (<= v_main_~main__t~0_6 v_main_~main__tagbuf_len~0_8) 1 0) v_main_~__tmp_2~0_1) (= 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8} 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_6, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_8, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {6364#true} is VALID [2022-04-27 21:35:14,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {6364#true} [212] L50-->L351: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (= v_main_~main____CPAchecker_TMP_0~0_4 v_~__tmp_259_0~0_1)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, ~__tmp_259_0~0=v_~__tmp_259_0~0_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_4} AuxVars[] AssignedVars[~__tmp_259_0~0] {6364#true} is VALID [2022-04-27 21:35:14,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {6364#true} [217] L351-->L195: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_259_0~0_2) (= (+ v_main_~main__t~0_8 1) v_main_~main__t~0_7) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_8)) InVars {main_~main__t~0=v_main_~main__t~0_8, ~__tmp_259_0~0=v_~__tmp_259_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, ~__tmp_259_0~0=v_~__tmp_259_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {6364#true} is VALID [2022-04-27 21:35:14,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {6364#true} [222] L195-->L101: 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_11 v_main_~main__tagbuf_len~0_11)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet6=|v_main_#t~nondet6_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__tagbuf_len~0=v_main_~main__tagbuf_len~0_11, 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] {6369#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:14,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {6369#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [227] L101-->L105: 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] {6369#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:14,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {6369#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [237] L105-->L112: Formula: (and (= v_main_~__tmp_5~0_1 (ite (<= 0 v_main_~main__t~0_12) 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_12, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_12, 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] {6369#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:14,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {6369#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [253] L112-->L124: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= v_main_~main__t~0_13 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~main__t~0=v_main_~main__t~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~main__t~0=v_main_~main__t~0_13, 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_12, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {6370#(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:14,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {6370#(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)))} [270] L124-->L133: Formula: (and (= v_main_~main____CPAchecker_TMP_5~0_1 v_main_~main__t~0_15) (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) (= v_main_~main__t~0_14 (+ v_main_~main__t~0_15 1))) InVars {main_~main__t~0=v_main_~main__t~0_15, 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_14, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_5~0] {6371#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:14,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {6371#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [284] L133-->L249: Formula: (not (= v_main_~main__t~0_18 v_main_~main__tagbuf_len~0_15)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_15, main_~main__t~0=v_main_~main__t~0_18} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_15, main_~main__t~0=v_main_~main__t~0_18} AuxVars[] AssignedVars[] {6371#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:14,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {6371#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [254] L249-->L174: Formula: (and (= v_main_~__tmp_9~0_1 (ite (<= 0 v_main_~main__t~0_19) 1 0)) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__t~0=v_main_~main__t~0_19} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__t~0=v_main_~main__t~0_19, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~__VERIFIER_assert__cond~8] {6371#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:14,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {6371#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [272] L174-->L186: Formula: (and (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (= (ite (<= v_main_~main__t~0_20 v_main_~main__tagbuf_len~0_16) 1 0) v_main_~__tmp_10~0_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~main__t~0=v_main_~main__t~0_20, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~main__t~0=v_main_~main__t~0_20, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {6372#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-27 21:35:14,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {6372#(not (= main_~__VERIFIER_assert__cond~9 0))} [287] L186-->L188: 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[] {6365#false} is VALID [2022-04-27 21:35:14,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {6365#false} [293] L188-->mainErr8ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6365#false} is VALID [2022-04-27 21:35:14,170 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,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:14,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820365372] [2022-04-27 21:35:14,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820365372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:14,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:14,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:35:14,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715606481] [2022-04-27 21:35:14,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:14,171 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:14,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:14,171 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:14,187 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:14,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:35:14,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:14,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:35:14,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:35:14,188 INFO L87 Difference]: Start difference. First operand 60 states and 67 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:14,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:14,447 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-27 21:35:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:35:14,448 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:14,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:14,448 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:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-27 21:35:14,449 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:14,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-27 21:35:14,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-27 21:35:14,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:14,490 INFO L225 Difference]: With dead ends: 75 [2022-04-27 21:35:14,490 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 21:35:14,491 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:14,491 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 84 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:14,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 67 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:14,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 21:35:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2022-04-27 21:35:14,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:14,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 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,510 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 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,510 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 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,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:14,511 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-04-27 21:35:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2022-04-27 21:35:14,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:14,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:14,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 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 73 states. [2022-04-27 21:35:14,511 INFO L87 Difference]: Start difference. First operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 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 73 states. [2022-04-27 21:35:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:14,512 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-04-27 21:35:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2022-04-27 21:35:14,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:14,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:14,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:14,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 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,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-04-27 21:35:14,513 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 22 [2022-04-27 21:35:14,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:14,513 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-04-27 21:35:14,513 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:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-04-27 21:35:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:35:14,514 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:14,514 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] [2022-04-27 21:35:14,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 21:35:14,514 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:14,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:14,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1627954806, now seen corresponding path program 1 times [2022-04-27 21:35:14,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:14,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514770258] [2022-04-27 21:35:14,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:14,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:14,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:14,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {6699#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6689#true} is VALID [2022-04-27 21:35:14,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {6689#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6689#true} is VALID [2022-04-27 21:35:14,586 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6689#true} {6689#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6689#true} is VALID [2022-04-27 21:35:14,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {6689#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6699#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {6699#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6689#true} is VALID [2022-04-27 21:35:14,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {6689#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6689#true} is VALID [2022-04-27 21:35:14,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6689#true} {6689#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6689#true} is VALID [2022-04-27 21:35:14,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {6689#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6689#true} is VALID [2022-04-27 21:35:14,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {6689#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {6689#true} is VALID [2022-04-27 21:35:14,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {6689#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {6689#true} is VALID [2022-04-27 21:35:14,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {6689#true} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {6689#true} is VALID [2022-04-27 21:35:14,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {6689#true} [206] L32-->L265: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~main____CPAchecker_TMP_0~0_6 0) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {6689#true} is VALID [2022-04-27 21:35:14,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {6689#true} [210] L265-->L276: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 (ite (<= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_18) 1 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_26, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_26, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {6689#true} is VALID [2022-04-27 21:35:14,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {6689#true} [214] L276-->L384: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 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_7} 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_7, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {6689#true} is VALID [2022-04-27 21:35:14,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {6689#true} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {6689#true} is VALID [2022-04-27 21:35:14,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {6689#true} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6694#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:14,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {6694#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [232] L324-->L364: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_5 0) (= v_main_~__tmp_19~0_1 v_main_~__VERIFIER_assert__cond~18_1) (= v_main_~__tmp_19~0_1 (ite (<= 0 v_main_~main__t~0_34) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5} OutVars{main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__tmp_19~0=v_main_~__tmp_19~0_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_1} AuxVars[] AssignedVars[main_~__tmp_19~0, main_~__VERIFIER_assert__cond~18] {6694#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:14,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {6694#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [248] L364-->L376: Formula: (and (= v_main_~__tmp_20~0_1 v_main_~__VERIFIER_assert__cond~19_1) (not (= v_main_~__VERIFIER_assert__cond~18_4 0)) (= (ite (<= v_main_~main__t~0_35 v_main_~main__tagbuf_len~0_23) 1 0) v_main_~__tmp_20~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_35, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} OutVars{main_~main__t~0=v_main_~main__t~0_35, main_~__tmp_20~0=v_main_~__tmp_20~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} AuxVars[] AssignedVars[main_~__tmp_20~0, main_~__VERIFIER_assert__cond~19] {6695#(or (and (= main_~__VERIFIER_assert__cond~19 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:14,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {6695#(or (and (= main_~__VERIFIER_assert__cond~19 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)))} [266] L376-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~19_4 0)) (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_383_0~0_3)) InVars {main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6, ~__tmp_383_0~0=v_~__tmp_383_0~0_3, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4} AuxVars[] AssignedVars[~__tmp_383_0~0] {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:14,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {6697#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:14,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {6697#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6697#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:14,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {6697#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [231] L324-->L331: Formula: (and (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_32) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1) (not (= v_main_~main____CPAchecker_TMP_0~1_3 0))) InVars {main_~main__t~0=v_main_~main__t~0_32, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} OutVars{main_~main__t~0=v_main_~main__t~0_32, 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_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {6697#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:14,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {6697#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [246] L331-->L343: Formula: (and (= v_main_~__tmp_18~0_1 (ite (<= v_main_~main__t~0_33 v_main_~main__tagbuf_len~0_22) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_22} OutVars{main_~main__t~0=v_main_~main__t~0_33, 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_22, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {6698#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2022-04-27 21:35:14,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {6698#(not (= main_~__VERIFIER_assert__cond~17 0))} [261] L343-->L345: 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[] {6690#false} is VALID [2022-04-27 21:35:14,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {6690#false} [277] L345-->mainErr15ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6690#false} is VALID [2022-04-27 21:35:14,592 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:14,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:14,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514770258] [2022-04-27 21:35:14,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514770258] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:35:14,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460399671] [2022-04-27 21:35:14,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:14,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:35:14,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:35:14,593 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:14,596 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:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:14,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 21:35:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:14,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:35:15,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {6689#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6689#true} is VALID [2022-04-27 21:35:15,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {6689#true} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6689#true} is VALID [2022-04-27 21:35:15,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {6689#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6689#true} is VALID [2022-04-27 21:35:15,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6689#true} {6689#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6689#true} is VALID [2022-04-27 21:35:15,233 INFO L272 TraceCheckUtils]: 4: Hoare triple {6689#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6689#true} is VALID [2022-04-27 21:35:15,233 INFO L290 TraceCheckUtils]: 5: Hoare triple {6689#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {6689#true} is VALID [2022-04-27 21:35:15,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {6689#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {6721#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} is VALID [2022-04-27 21:35:15,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {6721#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {6725#(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:15,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {6725#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} [206] L32-->L265: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~main____CPAchecker_TMP_0~0_6 0) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {6725#(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:15,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {6725#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} [210] L265-->L276: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 (ite (<= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_18) 1 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_26, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_26, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {6725#(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:15,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {6725#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} [214] L276-->L384: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 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_7} 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_7, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {6725#(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:15,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {6725#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {6738#(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:15,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {6738#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6742#(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:15,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {6742#(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)))} [232] L324-->L364: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_5 0) (= v_main_~__tmp_19~0_1 v_main_~__VERIFIER_assert__cond~18_1) (= v_main_~__tmp_19~0_1 (ite (<= 0 v_main_~main__t~0_34) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5} OutVars{main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__tmp_19~0=v_main_~__tmp_19~0_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_1} AuxVars[] AssignedVars[main_~__tmp_19~0, main_~__VERIFIER_assert__cond~18] {6742#(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:15,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {6742#(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)))} [248] L364-->L376: Formula: (and (= v_main_~__tmp_20~0_1 v_main_~__VERIFIER_assert__cond~19_1) (not (= v_main_~__VERIFIER_assert__cond~18_4 0)) (= (ite (<= v_main_~main__t~0_35 v_main_~main__tagbuf_len~0_23) 1 0) v_main_~__tmp_20~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_35, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} OutVars{main_~main__t~0=v_main_~main__t~0_35, main_~__tmp_20~0=v_main_~__tmp_20~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} AuxVars[] AssignedVars[main_~__tmp_20~0, main_~__VERIFIER_assert__cond~19] {6742#(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:15,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {6742#(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)))} [266] L376-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~19_4 0)) (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_383_0~0_3)) InVars {main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6, ~__tmp_383_0~0=v_~__tmp_383_0~0_3, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4} AuxVars[] AssignedVars[~__tmp_383_0~0] {6742#(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:15,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {6742#(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)))} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {6755#(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:15,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {6755#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6755#(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:15,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {6755#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} [231] L324-->L331: Formula: (and (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_32) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1) (not (= v_main_~main____CPAchecker_TMP_0~1_3 0))) InVars {main_~main__t~0=v_main_~main__t~0_32, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} OutVars{main_~main__t~0=v_main_~main__t~0_32, 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_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {6755#(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:15,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {6755#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} [246] L331-->L343: Formula: (and (= v_main_~__tmp_18~0_1 (ite (<= v_main_~main__t~0_33 v_main_~main__tagbuf_len~0_22) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_22} OutVars{main_~main__t~0=v_main_~main__t~0_33, 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_22, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {6765#(<= 1 main_~__VERIFIER_assert__cond~17)} is VALID [2022-04-27 21:35:15,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {6765#(<= 1 main_~__VERIFIER_assert__cond~17)} [261] L343-->L345: 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[] {6690#false} is VALID [2022-04-27 21:35:15,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {6690#false} [277] L345-->mainErr15ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6690#false} is VALID [2022-04-27 21:35:15,240 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:15,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:35:15,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {6690#false} [277] L345-->mainErr15ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6690#false} is VALID [2022-04-27 21:35:15,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {6765#(<= 1 main_~__VERIFIER_assert__cond~17)} [261] L343-->L345: 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[] {6690#false} is VALID [2022-04-27 21:35:15,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {6697#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [246] L331-->L343: Formula: (and (= v_main_~__tmp_18~0_1 (ite (<= v_main_~main__t~0_33 v_main_~main__tagbuf_len~0_22) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_22} OutVars{main_~main__t~0=v_main_~main__t~0_33, 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_22, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {6765#(<= 1 main_~__VERIFIER_assert__cond~17)} is VALID [2022-04-27 21:35:15,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {6697#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [231] L324-->L331: Formula: (and (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_32) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1) (not (= v_main_~main____CPAchecker_TMP_0~1_3 0))) InVars {main_~main__t~0=v_main_~main__t~0_32, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} OutVars{main_~main__t~0=v_main_~main__t~0_32, 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_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {6697#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:15,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {6697#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6697#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:15,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {6697#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:15,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [266] L376-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~19_4 0)) (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_383_0~0_3)) InVars {main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6, ~__tmp_383_0~0=v_~__tmp_383_0~0_3, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4} AuxVars[] AssignedVars[~__tmp_383_0~0] {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:15,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [248] L364-->L376: Formula: (and (= v_main_~__tmp_20~0_1 v_main_~__VERIFIER_assert__cond~19_1) (not (= v_main_~__VERIFIER_assert__cond~18_4 0)) (= (ite (<= v_main_~main__t~0_35 v_main_~main__tagbuf_len~0_23) 1 0) v_main_~__tmp_20~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_35, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} OutVars{main_~main__t~0=v_main_~main__t~0_35, main_~__tmp_20~0=v_main_~__tmp_20~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} AuxVars[] AssignedVars[main_~__tmp_20~0, main_~__VERIFIER_assert__cond~19] {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:15,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [232] L324-->L364: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_5 0) (= v_main_~__tmp_19~0_1 v_main_~__VERIFIER_assert__cond~18_1) (= v_main_~__tmp_19~0_1 (ite (<= 0 v_main_~main__t~0_34) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5} OutVars{main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__tmp_19~0=v_main_~__tmp_19~0_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_1} AuxVars[] AssignedVars[main_~__tmp_19~0, main_~__VERIFIER_assert__cond~18] {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:15,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {6697#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:15,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {6697#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:15,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [214] L276-->L384: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 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_7} 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_7, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:15,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [210] L265-->L276: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 (ite (<= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_18) 1 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_26, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_26, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:15,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [206] L32-->L265: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~main____CPAchecker_TMP_0~0_6 0) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:15,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {6697#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {6696#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:15,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {6689#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {6697#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:15,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {6689#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {6689#true} is VALID [2022-04-27 21:35:15,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {6689#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6689#true} is VALID [2022-04-27 21:35:15,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6689#true} {6689#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6689#true} is VALID [2022-04-27 21:35:15,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {6689#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6689#true} is VALID [2022-04-27 21:35:15,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {6689#true} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {6689#true} is VALID [2022-04-27 21:35:15,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {6689#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6689#true} is VALID [2022-04-27 21:35:15,382 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:15,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460399671] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:35:15,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:35:15,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-27 21:35:15,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628306847] [2022-04-27 21:35:15,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:35:15,383 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:15,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:15,383 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:15,409 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:15,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 21:35:15,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:15,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 21:35:15,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-27 21:35:15,410 INFO L87 Difference]: Start difference. First operand 55 states and 62 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:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:16,022 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2022-04-27 21:35:16,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 21:35:16,023 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:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:16,023 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:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 132 transitions. [2022-04-27 21:35:16,024 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:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 132 transitions. [2022-04-27 21:35:16,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 132 transitions. [2022-04-27 21:35:16,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:16,113 INFO L225 Difference]: With dead ends: 117 [2022-04-27 21:35:16,113 INFO L226 Difference]: Without dead ends: 115 [2022-04-27 21:35:16,113 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:16,114 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 307 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:16,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 114 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:35:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-27 21:35:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 51. [2022-04-27 21:35:16,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:16,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 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:16,140 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 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:16,141 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 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:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:16,142 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2022-04-27 21:35:16,142 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-04-27 21:35:16,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:16,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:16,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 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 115 states. [2022-04-27 21:35:16,142 INFO L87 Difference]: Start difference. First operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 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 115 states. [2022-04-27 21:35:16,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:16,144 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2022-04-27 21:35:16,144 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-04-27 21:35:16,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:16,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:16,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:16,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:16,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 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:16,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-04-27 21:35:16,145 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2022-04-27 21:35:16,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:16,145 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-04-27 21:35:16,145 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:16,145 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-04-27 21:35:16,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 21:35:16,145 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:16,145 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:16,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 21:35:16,359 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:16,360 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:16,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:16,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1627986645, now seen corresponding path program 1 times [2022-04-27 21:35:16,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:16,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597085204] [2022-04-27 21:35:16,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:16,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:16,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:16,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {7295#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {7285#true} is VALID [2022-04-27 21:35:16,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {7285#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7285#true} is VALID [2022-04-27 21:35:16,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7285#true} {7285#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7285#true} is VALID [2022-04-27 21:35:16,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {7285#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7295#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {7295#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {7285#true} is VALID [2022-04-27 21:35:16,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {7285#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7285#true} is VALID [2022-04-27 21:35:16,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7285#true} {7285#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7285#true} is VALID [2022-04-27 21:35:16,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {7285#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7285#true} is VALID [2022-04-27 21:35:16,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {7285#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {7285#true} is VALID [2022-04-27 21:35:16,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {7285#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {7285#true} is VALID [2022-04-27 21:35:16,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {7285#true} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {7285#true} is VALID [2022-04-27 21:35:16,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {7285#true} [206] L32-->L265: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~main____CPAchecker_TMP_0~0_6 0) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {7285#true} is VALID [2022-04-27 21:35:16,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {7285#true} [210] L265-->L276: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 (ite (<= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_18) 1 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_26, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_26, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {7285#true} is VALID [2022-04-27 21:35:16,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {7285#true} [214] L276-->L384: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 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_7} 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_7, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {7285#true} is VALID [2022-04-27 21:35:16,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {7285#true} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {7285#true} is VALID [2022-04-27 21:35:16,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {7285#true} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {7290#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:16,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {7290#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [232] L324-->L364: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_5 0) (= v_main_~__tmp_19~0_1 v_main_~__VERIFIER_assert__cond~18_1) (= v_main_~__tmp_19~0_1 (ite (<= 0 v_main_~main__t~0_34) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5} OutVars{main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__tmp_19~0=v_main_~__tmp_19~0_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_1} AuxVars[] AssignedVars[main_~__tmp_19~0, main_~__VERIFIER_assert__cond~18] {7290#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:16,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {7290#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [248] L364-->L376: Formula: (and (= v_main_~__tmp_20~0_1 v_main_~__VERIFIER_assert__cond~19_1) (not (= v_main_~__VERIFIER_assert__cond~18_4 0)) (= (ite (<= v_main_~main__t~0_35 v_main_~main__tagbuf_len~0_23) 1 0) v_main_~__tmp_20~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_35, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} OutVars{main_~main__t~0=v_main_~main__t~0_35, main_~__tmp_20~0=v_main_~__tmp_20~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} AuxVars[] AssignedVars[main_~__tmp_20~0, main_~__VERIFIER_assert__cond~19] {7291#(or (and (= main_~__VERIFIER_assert__cond~19 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:16,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {7291#(or (and (= main_~__VERIFIER_assert__cond~19 0) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)))} [266] L376-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~19_4 0)) (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_383_0~0_3)) InVars {main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6, ~__tmp_383_0~0=v_~__tmp_383_0~0_3, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4} AuxVars[] AssignedVars[~__tmp_383_0~0] {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:16,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {7293#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:16,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {7293#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {7293#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:16,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {7293#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [232] L324-->L364: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_5 0) (= v_main_~__tmp_19~0_1 v_main_~__VERIFIER_assert__cond~18_1) (= v_main_~__tmp_19~0_1 (ite (<= 0 v_main_~main__t~0_34) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5} OutVars{main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__tmp_19~0=v_main_~__tmp_19~0_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_1} AuxVars[] AssignedVars[main_~__tmp_19~0, main_~__VERIFIER_assert__cond~18] {7293#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:16,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {7293#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [248] L364-->L376: Formula: (and (= v_main_~__tmp_20~0_1 v_main_~__VERIFIER_assert__cond~19_1) (not (= v_main_~__VERIFIER_assert__cond~18_4 0)) (= (ite (<= v_main_~main__t~0_35 v_main_~main__tagbuf_len~0_23) 1 0) v_main_~__tmp_20~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_35, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} OutVars{main_~main__t~0=v_main_~main__t~0_35, main_~__tmp_20~0=v_main_~__tmp_20~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} AuxVars[] AssignedVars[main_~__tmp_20~0, main_~__VERIFIER_assert__cond~19] {7294#(not (= main_~__VERIFIER_assert__cond~19 0))} is VALID [2022-04-27 21:35:16,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {7294#(not (= main_~__VERIFIER_assert__cond~19 0))} [265] L376-->L378: Formula: (= v_main_~__VERIFIER_assert__cond~19_3 0) InVars {main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_3} OutVars{main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_3} AuxVars[] AssignedVars[] {7286#false} is VALID [2022-04-27 21:35:16,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {7286#false} [279] L378-->mainErr17ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7286#false} is VALID [2022-04-27 21:35:16,439 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:16,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:16,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597085204] [2022-04-27 21:35:16,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597085204] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:35:16,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924468674] [2022-04-27 21:35:16,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:16,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:35:16,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:35:16,441 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:16,442 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:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:16,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 21:35:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:16,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:35:16,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {7285#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7285#true} is VALID [2022-04-27 21:35:16,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {7285#true} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {7285#true} is VALID [2022-04-27 21:35:16,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {7285#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7285#true} is VALID [2022-04-27 21:35:16,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7285#true} {7285#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7285#true} is VALID [2022-04-27 21:35:16,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {7285#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7285#true} is VALID [2022-04-27 21:35:16,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {7285#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {7285#true} is VALID [2022-04-27 21:35:16,972 INFO L290 TraceCheckUtils]: 6: Hoare triple {7285#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {7317#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} is VALID [2022-04-27 21:35:16,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {7317#(and (<= 0 main_~main__tagbuf_len~0) (<= main_~main__t~0 0))} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {7321#(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:16,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {7321#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} [206] L32-->L265: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~main____CPAchecker_TMP_0~0_6 0) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {7321#(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:16,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {7321#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} [210] L265-->L276: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 (ite (<= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_18) 1 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_26, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_26, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {7321#(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:16,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {7321#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} [214] L276-->L384: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 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_7} 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_7, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {7321#(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:16,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {7321#(and (<= 0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= main_~main__t~0 0))} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {7334#(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:16,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {7334#(and (<= main_~main__t~0 1) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {7338#(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:16,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {7338#(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)))} [232] L324-->L364: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_5 0) (= v_main_~__tmp_19~0_1 v_main_~__VERIFIER_assert__cond~18_1) (= v_main_~__tmp_19~0_1 (ite (<= 0 v_main_~main__t~0_34) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5} OutVars{main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__tmp_19~0=v_main_~__tmp_19~0_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_1} AuxVars[] AssignedVars[main_~__tmp_19~0, main_~__VERIFIER_assert__cond~18] {7338#(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:16,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {7338#(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)))} [248] L364-->L376: Formula: (and (= v_main_~__tmp_20~0_1 v_main_~__VERIFIER_assert__cond~19_1) (not (= v_main_~__VERIFIER_assert__cond~18_4 0)) (= (ite (<= v_main_~main__t~0_35 v_main_~main__tagbuf_len~0_23) 1 0) v_main_~__tmp_20~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_35, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} OutVars{main_~main__t~0=v_main_~main__t~0_35, main_~__tmp_20~0=v_main_~__tmp_20~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} AuxVars[] AssignedVars[main_~__tmp_20~0, main_~__VERIFIER_assert__cond~19] {7338#(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:16,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {7338#(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)))} [266] L376-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~19_4 0)) (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_383_0~0_3)) InVars {main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6, ~__tmp_383_0~0=v_~__tmp_383_0~0_3, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4} AuxVars[] AssignedVars[~__tmp_383_0~0] {7338#(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:16,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {7338#(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)))} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {7351#(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:16,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {7351#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {7351#(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:16,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {7351#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} [232] L324-->L364: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_5 0) (= v_main_~__tmp_19~0_1 v_main_~__VERIFIER_assert__cond~18_1) (= v_main_~__tmp_19~0_1 (ite (<= 0 v_main_~main__t~0_34) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5} OutVars{main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__tmp_19~0=v_main_~__tmp_19~0_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_1} AuxVars[] AssignedVars[main_~__tmp_19~0, main_~__VERIFIER_assert__cond~18] {7351#(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:16,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {7351#(and (<= main_~main__t~0 2) (< main_~main__t~0 (+ main_~main__tagbuf_len~0 1)) (<= 0 main_~main__tagbuf_len~0))} [248] L364-->L376: Formula: (and (= v_main_~__tmp_20~0_1 v_main_~__VERIFIER_assert__cond~19_1) (not (= v_main_~__VERIFIER_assert__cond~18_4 0)) (= (ite (<= v_main_~main__t~0_35 v_main_~main__tagbuf_len~0_23) 1 0) v_main_~__tmp_20~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_35, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} OutVars{main_~main__t~0=v_main_~main__t~0_35, main_~__tmp_20~0=v_main_~__tmp_20~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} AuxVars[] AssignedVars[main_~__tmp_20~0, main_~__VERIFIER_assert__cond~19] {7361#(<= 1 main_~__VERIFIER_assert__cond~19)} is VALID [2022-04-27 21:35:16,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {7361#(<= 1 main_~__VERIFIER_assert__cond~19)} [265] L376-->L378: Formula: (= v_main_~__VERIFIER_assert__cond~19_3 0) InVars {main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_3} OutVars{main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_3} AuxVars[] AssignedVars[] {7286#false} is VALID [2022-04-27 21:35:16,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {7286#false} [279] L378-->mainErr17ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7286#false} is VALID [2022-04-27 21:35:16,978 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:16,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:35:17,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {7286#false} [279] L378-->mainErr17ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7286#false} is VALID [2022-04-27 21:35:17,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {7361#(<= 1 main_~__VERIFIER_assert__cond~19)} [265] L376-->L378: Formula: (= v_main_~__VERIFIER_assert__cond~19_3 0) InVars {main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_3} OutVars{main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_3} AuxVars[] AssignedVars[] {7286#false} is VALID [2022-04-27 21:35:17,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {7293#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [248] L364-->L376: Formula: (and (= v_main_~__tmp_20~0_1 v_main_~__VERIFIER_assert__cond~19_1) (not (= v_main_~__VERIFIER_assert__cond~18_4 0)) (= (ite (<= v_main_~main__t~0_35 v_main_~main__tagbuf_len~0_23) 1 0) v_main_~__tmp_20~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_35, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} OutVars{main_~main__t~0=v_main_~main__t~0_35, main_~__tmp_20~0=v_main_~__tmp_20~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} AuxVars[] AssignedVars[main_~__tmp_20~0, main_~__VERIFIER_assert__cond~19] {7361#(<= 1 main_~__VERIFIER_assert__cond~19)} is VALID [2022-04-27 21:35:17,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {7293#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [232] L324-->L364: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_5 0) (= v_main_~__tmp_19~0_1 v_main_~__VERIFIER_assert__cond~18_1) (= v_main_~__tmp_19~0_1 (ite (<= 0 v_main_~main__t~0_34) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5} OutVars{main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__tmp_19~0=v_main_~__tmp_19~0_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_1} AuxVars[] AssignedVars[main_~__tmp_19~0, main_~__VERIFIER_assert__cond~18] {7293#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:17,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {7293#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {7293#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:17,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {7293#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:17,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [266] L376-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~19_4 0)) (= v_main_~main____CPAchecker_TMP_0~1_6 v_~__tmp_383_0~0_3)) InVars {main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6} OutVars{main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_6, ~__tmp_383_0~0=v_~__tmp_383_0~0_3, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_4} AuxVars[] AssignedVars[~__tmp_383_0~0] {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:17,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [248] L364-->L376: Formula: (and (= v_main_~__tmp_20~0_1 v_main_~__VERIFIER_assert__cond~19_1) (not (= v_main_~__VERIFIER_assert__cond~18_4 0)) (= (ite (<= v_main_~main__t~0_35 v_main_~main__tagbuf_len~0_23) 1 0) v_main_~__tmp_20~0_1)) InVars {main_~main__t~0=v_main_~main__t~0_35, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} OutVars{main_~main__t~0=v_main_~main__t~0_35, main_~__tmp_20~0=v_main_~__tmp_20~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_23, main_~__VERIFIER_assert__cond~19=v_main_~__VERIFIER_assert__cond~19_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_4} AuxVars[] AssignedVars[main_~__tmp_20~0, main_~__VERIFIER_assert__cond~19] {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:17,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [232] L324-->L364: Formula: (and (= v_main_~main____CPAchecker_TMP_0~1_5 0) (= v_main_~__tmp_19~0_1 v_main_~__VERIFIER_assert__cond~18_1) (= v_main_~__tmp_19~0_1 (ite (<= 0 v_main_~main__t~0_34) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5} OutVars{main_~main__t~0=v_main_~main__t~0_34, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_5, main_~__tmp_19~0=v_main_~__tmp_19~0_1, main_~__VERIFIER_assert__cond~18=v_main_~__VERIFIER_assert__cond~18_1} AuxVars[] AssignedVars[main_~__tmp_19~0, main_~__VERIFIER_assert__cond~18] {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:17,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {7293#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:17,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {7293#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:17,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [214] L276-->L384: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 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_7} 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_7, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:17,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [210] L265-->L276: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 (ite (<= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_18) 1 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_26, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_26, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:17,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [206] L32-->L265: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~main____CPAchecker_TMP_0~0_6 0) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:17,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {7293#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {7292#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:17,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {7285#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {7293#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:17,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {7285#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {7285#true} is VALID [2022-04-27 21:35:17,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {7285#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7285#true} is VALID [2022-04-27 21:35:17,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7285#true} {7285#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7285#true} is VALID [2022-04-27 21:35:17,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {7285#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7285#true} is VALID [2022-04-27 21:35:17,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {7285#true} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {7285#true} is VALID [2022-04-27 21:35:17,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {7285#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7285#true} is VALID [2022-04-27 21:35:17,149 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:17,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924468674] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:35:17,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:35:17,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-27 21:35:17,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968889322] [2022-04-27 21:35:17,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:35:17,149 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:17,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:17,150 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:17,175 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:17,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 21:35:17,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:17,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 21:35:17,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-27 21:35:17,176 INFO L87 Difference]: Start difference. First operand 51 states and 58 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:17,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:17,824 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2022-04-27 21:35:17,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 21:35:17,824 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:17,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:17,825 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:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 111 transitions. [2022-04-27 21:35:17,826 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:17,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 111 transitions. [2022-04-27 21:35:17,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 111 transitions. [2022-04-27 21:35:17,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:17,905 INFO L225 Difference]: With dead ends: 98 [2022-04-27 21:35:17,905 INFO L226 Difference]: Without dead ends: 96 [2022-04-27 21:35:17,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 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:17,906 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 247 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:17,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 129 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:35:17,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-27 21:35:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 44. [2022-04-27 21:35:17,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:17,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 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:17,934 INFO L74 IsIncluded]: Start isIncluded. First operand 96 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:17,934 INFO L87 Difference]: Start difference. First operand 96 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:17,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:17,935 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2022-04-27 21:35:17,935 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 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 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 96 states. [2022-04-27 21:35:17,936 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 96 states. [2022-04-27 21:35:17,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:17,937 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2022-04-27 21:35:17,937 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2022-04-27 21:35:17,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:17,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:17,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:17,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:17,938 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:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-04-27 21:35:17,938 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 22 [2022-04-27 21:35:17,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:17,939 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-04-27 21:35:17,939 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:17,939 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-27 21:35:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 21:35:17,941 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:17,941 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:17,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 21:35:18,146 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:18,146 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:18,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:18,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1633367914, now seen corresponding path program 1 times [2022-04-27 21:35:18,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:18,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142653390] [2022-04-27 21:35:18,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:18,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:18,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:18,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {7825#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {7815#true} is VALID [2022-04-27 21:35:18,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {7815#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7815#true} is VALID [2022-04-27 21:35:18,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7815#true} {7815#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7815#true} is VALID [2022-04-27 21:35:18,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {7815#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7825#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {7825#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {7815#true} is VALID [2022-04-27 21:35:18,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {7815#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7815#true} is VALID [2022-04-27 21:35:18,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7815#true} {7815#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7815#true} is VALID [2022-04-27 21:35:18,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {7815#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7815#true} is VALID [2022-04-27 21:35:18,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {7815#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {7815#true} is VALID [2022-04-27 21:35:18,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {7815#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {7815#true} is VALID [2022-04-27 21:35:18,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {7815#true} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {7815#true} is VALID [2022-04-27 21:35:18,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {7815#true} [206] L32-->L265: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~main____CPAchecker_TMP_0~0_6 0) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {7815#true} is VALID [2022-04-27 21:35:18,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {7815#true} [210] L265-->L276: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 (ite (<= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_18) 1 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_26, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_26, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {7815#true} is VALID [2022-04-27 21:35:18,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {7815#true} [214] L276-->L384: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 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_7} 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_7, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {7815#true} is VALID [2022-04-27 21:35:18,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {7815#true} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {7815#true} is VALID [2022-04-27 21:35:18,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {7815#true} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {7820#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:18,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {7820#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [231] L324-->L331: Formula: (and (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_32) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1) (not (= v_main_~main____CPAchecker_TMP_0~1_3 0))) InVars {main_~main__t~0=v_main_~main__t~0_32, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} OutVars{main_~main__t~0=v_main_~main__t~0_32, 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_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {7820#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:18,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {7820#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [246] L331-->L343: Formula: (and (= v_main_~__tmp_18~0_1 (ite (<= v_main_~main__t~0_33 v_main_~main__tagbuf_len~0_22) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_22} OutVars{main_~main__t~0=v_main_~main__t~0_33, 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_22, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {7821#(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,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {7821#(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))))} [262] L343-->L351: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~17_4 0)) (= v_main_~main____CPAchecker_TMP_0~1_4 v_~__tmp_259_0~0_3)) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{~__tmp_259_0~0=v_~__tmp_259_0~0_3, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[~__tmp_259_0~0] {7822#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:18,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {7822#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [217] L351-->L195: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_259_0~0_2) (= (+ v_main_~main__t~0_8 1) v_main_~main__t~0_7) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_8)) InVars {main_~main__t~0=v_main_~main__t~0_8, ~__tmp_259_0~0=v_~__tmp_259_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, ~__tmp_259_0~0=v_~__tmp_259_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {7823#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:18,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {7823#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [222] L195-->L101: 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_11 v_main_~main__tagbuf_len~0_11)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet6=|v_main_#t~nondet6_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__tagbuf_len~0=v_main_~main__tagbuf_len~0_11, 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] {7823#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:18,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {7823#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [227] L101-->L105: 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] {7823#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:18,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {7823#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [237] L105-->L112: Formula: (and (= v_main_~__tmp_5~0_1 (ite (<= 0 v_main_~main__t~0_12) 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_12, main_~main____CPAchecker_TMP_4~0=v_main_~main____CPAchecker_TMP_4~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_12, 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] {7823#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:18,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {7823#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [253] L112-->L124: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= v_main_~main__t~0_13 v_main_~main__tagbuf_len~0_12) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~main__t~0=v_main_~main__t~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_12} OutVars{main_~main__t~0=v_main_~main__t~0_13, 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_12, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {7824#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-27 21:35:18,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {7824#(not (= main_~__VERIFIER_assert__cond~5 0))} [269] L124-->L126: 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[] {7816#false} is VALID [2022-04-27 21:35:18,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {7816#false} [281] L126-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7816#false} is VALID [2022-04-27 21:35:18,219 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,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:18,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142653390] [2022-04-27 21:35:18,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142653390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:18,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:18,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 21:35:18,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439103859] [2022-04-27 21:35:18,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:18,220 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 21:35:18,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:18,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:18,232 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:18,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 21:35:18,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:18,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 21:35:18,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:35:18,233 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:18,457 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-04-27 21:35:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 21:35:18,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 21:35:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-27 21:35:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2022-04-27 21:35:18,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2022-04-27 21:35:18,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:18,495 INFO L225 Difference]: With dead ends: 56 [2022-04-27 21:35:18,495 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 21:35:18,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:35:18,496 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 67 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:18,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 53 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 21:35:18,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2022-04-27 21:35:18,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:18,523 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:18,523 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:18,523 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:18,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:18,524 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-27 21:35:18,524 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-27 21:35:18,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:18,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:18,524 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:18,524 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:18,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:18,525 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-27 21:35:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-27 21:35:18,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:18,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:18,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:18,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:18,525 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:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-04-27 21:35:18,526 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2022-04-27 21:35:18,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:18,526 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-04-27 21:35:18,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-27 21:35:18,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 21:35:18,526 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:35:18,526 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:18,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 21:35:18,527 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 21:35:18,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:35:18,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1634354094, now seen corresponding path program 1 times [2022-04-27 21:35:18,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:35:18,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616898330] [2022-04-27 21:35:18,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:35:18,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:35:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:18,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:35:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:35:18,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {8072#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {8062#true} is VALID [2022-04-27 21:35:18,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {8062#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8062#true} is VALID [2022-04-27 21:35:18,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8062#true} {8062#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8062#true} is VALID [2022-04-27 21:35:18,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {8062#true} [194] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8072#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~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,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {8072#(and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [196] 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_~__return_main~0_23 0) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~__tmp_259_0~0_4 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_259_0~0=v_~__tmp_259_0~0_4, ~__return_main~0=v_~__return_main~0_23, #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_259_0~0, ~__return_main~0, ~__tmp_383_0~0, #NULL.offset, ~__return_305~0, #NULL.base] {8062#true} is VALID [2022-04-27 21:35:18,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {8062#true} [199] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8062#true} is VALID [2022-04-27 21:35:18,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8062#true} {8062#true} [301] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8062#true} is VALID [2022-04-27 21:35:18,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {8062#true} [195] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8062#true} is VALID [2022-04-27 21:35:18,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {8062#true} [198] mainENTRY-->L20: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__tagbuf_len~0_1) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_1, main_~main__t~0=v_main_~main__t~0_1} AuxVars[] AssignedVars[main_~main__t~0, main_#t~nondet4, main_~main__tagbuf_len~0] {8062#true} is VALID [2022-04-27 21:35:18,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {8062#true} [200] L20-->L24: Formula: (and (<= 1 v_main_~main__tagbuf_len~0_5) (= (+ (- 1) v_main_~main__tagbuf_len~0_5) v_main_~main__tagbuf_len~0_4) (= 0 v_main_~main__t~0_2)) InVars {main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_5} OutVars{main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_4, main_~main__t~0=v_main_~main__t~0_2} AuxVars[] AssignedVars[main_~main__t~0, main_~main__tagbuf_len~0] {8062#true} is VALID [2022-04-27 21:35:18,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {8062#true} [203] L24-->L32: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (not (= v_main_~main__t~0_4 v_main_~main__tagbuf_len~0_7)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~main__t~0=v_main_~main__t~0_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} OutVars{main_~main__t~0=v_main_~main__t~0_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_7} AuxVars[] AssignedVars[main_#t~nondet5, main_~main____CPAchecker_TMP_0~0] {8062#true} is VALID [2022-04-27 21:35:18,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {8062#true} [206] L32-->L265: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (= v_main_~main____CPAchecker_TMP_0~0_6 0) (= v_main_~__tmp_13~0_1 (ite (<= 0 v_main_~main__t~0_25) 1 0))) InVars {main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6} OutVars{main_~main__t~0=v_main_~main__t~0_25, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_6, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {8062#true} is VALID [2022-04-27 21:35:18,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {8062#true} [210] L265-->L276: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= v_main_~__tmp_14~0_1 (ite (<= v_main_~main__t~0_26 v_main_~main__tagbuf_len~0_18) 1 0)) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~main__t~0=v_main_~main__t~0_26, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__t~0=v_main_~main__t~0_26, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_18, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {8062#true} is VALID [2022-04-27 21:35:18,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {8062#true} [214] L276-->L384: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_7 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_7} 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_7, ~__tmp_383_0~0=v_~__tmp_383_0~0_1} AuxVars[] AssignedVars[~__tmp_383_0~0] {8062#true} is VALID [2022-04-27 21:35:18,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {8062#true} [220] L384-->L288: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_1 v_main_~main__t~0_28) (= v_main_~main____CPAchecker_TMP_0~0_8 v_~__tmp_383_0~0_2) (= v_main_~main__t~0_27 (+ v_main_~main__t~0_28 1))) InVars {main_~main__t~0=v_main_~main__t~0_28, ~__tmp_383_0~0=v_~__tmp_383_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_27, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_8, 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] {8062#true} is VALID [2022-04-27 21:35:18,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {8062#true} [224] L288-->L324: Formula: (and (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (not (= v_main_~main__t~0_31 v_main_~main__tagbuf_len~0_21)) (<= |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_31, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_21} OutVars{main_~main__t~0=v_main_~main__t~0_31, 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_21} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_0~1, main_#t~nondet9] {8067#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:18,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {8067#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [231] L324-->L331: Formula: (and (= v_main_~__tmp_17~0_1 (ite (<= 0 v_main_~main__t~0_32) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1) (not (= v_main_~main____CPAchecker_TMP_0~1_3 0))) InVars {main_~main__t~0=v_main_~main__t~0_32, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_3} OutVars{main_~main__t~0=v_main_~main__t~0_32, 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_3} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {8067#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:18,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {8067#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} [246] L331-->L343: Formula: (and (= v_main_~__tmp_18~0_1 (ite (<= v_main_~main__t~0_33 v_main_~main__tagbuf_len~0_22) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1)) InVars {main_~main__t~0=v_main_~main__t~0_33, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_22} OutVars{main_~main__t~0=v_main_~main__t~0_33, 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_22, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {8068#(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,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {8068#(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))))} [262] L343-->L351: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~17_4 0)) (= v_main_~main____CPAchecker_TMP_0~1_4 v_~__tmp_259_0~0_3)) InVars {main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{~__tmp_259_0~0=v_~__tmp_259_0~0_3, main_~main____CPAchecker_TMP_0~1=v_main_~main____CPAchecker_TMP_0~1_4, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[~__tmp_259_0~0] {8069#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 21:35:18,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {8069#(not (<= main_~main__tagbuf_len~0 main_~main__t~0))} [217] L351-->L195: Formula: (and (= v_main_~main____CPAchecker_TMP_0~0_5 v_~__tmp_259_0~0_2) (= (+ v_main_~main__t~0_8 1) v_main_~main__t~0_7) (= v_main_~main____CPAchecker_TMP_2~0_1 v_main_~main__t~0_8)) InVars {main_~main__t~0=v_main_~main__t~0_8, ~__tmp_259_0~0=v_~__tmp_259_0~0_2} OutVars{main_~main__t~0=v_main_~main__t~0_7, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, ~__tmp_259_0~0=v_~__tmp_259_0~0_2, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_5} AuxVars[] AssignedVars[main_~main__t~0, main_~main____CPAchecker_TMP_2~0, main_~main____CPAchecker_TMP_0~0] {8070#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:18,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {8070#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [222] L195-->L101: 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_11 v_main_~main__tagbuf_len~0_11)) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648))) InVars {main_~main__t~0=v_main_~main__t~0_11, main_#t~nondet6=|v_main_#t~nondet6_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__tagbuf_len~0=v_main_~main__tagbuf_len~0_11, 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] {8070#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:18,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {8070#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [228] L101-->L215: 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] {8070#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:18,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {8070#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [239] L215-->L222: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (<= 0 v_main_~main__t~0_23) 1 0) v_main_~__tmp_11~0_1) (not (= v_main_~main____CPAchecker_TMP_6~0_3 0))) InVars {main_~main__t~0=v_main_~main__t~0_23, main_~main____CPAchecker_TMP_6~0=v_main_~main____CPAchecker_TMP_6~0_3} OutVars{main_~main__t~0=v_main_~main__t~0_23, 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] {8070#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 21:35:18,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {8070#(<= main_~main__t~0 main_~main__tagbuf_len~0)} [256] L222-->L234: Formula: (and (= (ite (<= v_main_~main__t~0_24 v_main_~main__tagbuf_len~0_17) 1 0) v_main_~__tmp_12~0_1) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__t~0=v_main_~main__t~0_24, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~main__t~0=v_main_~main__t~0_24, main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~main__tagbuf_len~0=v_main_~main__tagbuf_len~0_17, 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] {8071#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-27 21:35:18,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {8071#(not (= main_~__VERIFIER_assert__cond~11 0))} [275] L234-->L236: 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[] {8063#false} is VALID [2022-04-27 21:35:18,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {8063#false} [289] L236-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8063#false} is VALID [2022-04-27 21:35:18,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:35:18,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:35:18,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616898330] [2022-04-27 21:35:18,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616898330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:35:18,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:35:18,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 21:35:18,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828332397] [2022-04-27 21:35:18,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:35:18,601 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 21:35:18,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:35:18,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:18,616 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:18,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 21:35:18,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:35:18,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 21:35:18,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:35:18,616 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:18,804 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-27 21:35:18,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:35:18,804 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 21:35:18,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:35:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 21:35:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-27 21:35:18,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-27 21:35:18,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:35:18,833 INFO L225 Difference]: With dead ends: 39 [2022-04-27 21:35:18,833 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:35:18,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-27 21:35:18,833 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 72 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:35:18,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 43 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:35:18,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:35:18,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:35:18,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:35:18,834 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:18,834 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:18,834 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:18,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:18,834 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:35:18,834 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:35:18,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:18,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:18,834 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:18,835 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:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:35:18,835 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:35:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:35:18,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:18,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:35:18,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:35:18,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:35:18,835 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:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:35:18,835 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-04-27 21:35:18,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:35:18,835 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:35:18,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:35:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:35:18,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:35:18,837 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-04-27 21:35:18,837 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-04-27 21:35:18,837 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-04-27 21:35:18,837 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-04-27 21:35:18,838 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-04-27 21:35:18,838 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-04-27 21:35:18,838 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-04-27 21:35:18,838 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-04-27 21:35:18,838 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-04-27 21:35:18,838 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-04-27 21:35:18,838 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-04-27 21:35:18,838 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-04-27 21:35:18,838 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-04-27 21:35:18,838 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-04-27 21:35:18,838 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-04-27 21:35:18,838 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-04-27 21:35:18,838 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-04-27 21:35:18,838 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-04-27 21:35:18,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 21:35:18,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:37:05,453 WARN L232 SmtUtils]: Spent 1.78m on a formula simplification. DAG size of input: 88 DAG size of output: 89 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 21:37:14,805 WARN L232 SmtUtils]: Spent 9.34s on a formula simplification. DAG size of input: 87 DAG size of output: 46 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 21:38:31,543 WARN L232 SmtUtils]: Spent 1.25m on a formula simplification. DAG size of input: 76 DAG size of output: 75 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 21:38:32,013 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:38:32,013 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:38:32,013 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:38:32,013 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:38:32,013 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:38:32,013 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:38:32,013 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:38:32,013 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 15 402) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-04-27 21:38:32,013 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 401) no Hoare annotation was computed. [2022-04-27 21:38:32,013 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 396) no Hoare annotation was computed. [2022-04-27 21:38:32,013 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 15 402) no Hoare annotation was computed. [2022-04-27 21:38:32,013 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 395) no Hoare annotation was computed. [2022-04-27 21:38:32,013 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 15 402) no Hoare annotation was computed. [2022-04-27 21:38:32,013 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 255) no Hoare annotation was computed. [2022-04-27 21:38:32,013 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 393) no Hoare annotation was computed. [2022-04-27 21:38:32,014 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 253) no Hoare annotation was computed. [2022-04-27 21:38:32,014 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 391) no Hoare annotation was computed. [2022-04-27 21:38:32,014 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-04-27 21:38:32,014 INFO L895 garLoopResultBuilder]: At program point L351(lines 32 395) the Hoare annotation is: (or (and (let ((.cse0 (<= main_~main__t~0 1))) (let ((.cse1 (<= 1 main_~__VERIFIER_assert__cond~17)) (.cse2 (let ((.cse3 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~17 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~16 0))) (.cse6 (<= 1 main_~main__t~0))) (or (and .cse3 .cse4 .cse5 .cse6 (not (= main_~__VERIFIER_assert__cond~19 0))) (and .cse0 .cse3 .cse4 .cse5 .cse6))))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 (<= 1 main_~__VERIFIER_assert__cond~19))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) (and (= main_~main__t~0 0) (< 0 main_~main__tagbuf_len~0))) [2022-04-27 21:38:32,014 INFO L899 garLoopResultBuilder]: For program point L278(line 278) no Hoare annotation was computed. [2022-04-27 21:38:32,014 INFO L895 garLoopResultBuilder]: At program point L384(lines 282 391) the Hoare annotation is: (let ((.cse1 (= main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (not (= main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse3 (<= 1 main_~main__t~0)) (and .cse3 .cse1))))) (or (and .cse2 (not (= main_~__VERIFIER_assert__cond~18 0))) (and .cse2 .cse1))))) (or (and .cse0 .cse1 (< 0 main_~main__tagbuf_len~0)) (and (<= 1 main_~__VERIFIER_assert__cond~19) .cse0 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)))))) [2022-04-27 21:38:32,014 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) no Hoare annotation was computed. [2022-04-27 21:38:32,014 INFO L895 garLoopResultBuilder]: At program point L195(lines 56 253) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-27 21:38:32,014 INFO L899 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 278) no Hoare annotation was computed. [2022-04-27 21:38:32,014 INFO L899 garLoopResultBuilder]: For program point L288(lines 288 390) no Hoare annotation was computed. [2022-04-27 21:38:32,014 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 94) no Hoare annotation was computed. [2022-04-27 21:38:32,014 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 251) no Hoare annotation was computed. [2022-04-27 21:38:32,014 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 317) no Hoare annotation was computed. [2022-04-27 21:38:32,014 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 389) no Hoare annotation was computed. [2022-04-27 21:38:32,014 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2022-04-27 21:38:32,014 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 92) no Hoare annotation was computed. [2022-04-27 21:38:32,015 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 209) no Hoare annotation was computed. [2022-04-27 21:38:32,015 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 250) no Hoare annotation was computed. [2022-04-27 21:38:32,015 INFO L899 garLoopResultBuilder]: For program point L297(line 297) no Hoare annotation was computed. [2022-04-27 21:38:32,015 INFO L899 garLoopResultBuilder]: For program point L307(lines 307 315) no Hoare annotation was computed. [2022-04-27 21:38:32,015 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 354) no Hoare annotation was computed. [2022-04-27 21:38:32,015 INFO L899 garLoopResultBuilder]: For program point L364(lines 364 387) no Hoare annotation was computed. [2022-04-27 21:38:32,015 INFO L899 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 72) no Hoare annotation was computed. [2022-04-27 21:38:32,015 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2022-04-27 21:38:32,015 INFO L902 garLoopResultBuilder]: At program point L314(lines 32 395) the Hoare annotation is: true [2022-04-27 21:38:32,015 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 203) no Hoare annotation was computed. [2022-04-27 21:38:32,015 INFO L895 garLoopResultBuilder]: At program point L249(lines 101 251) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-27 21:38:32,015 INFO L899 garLoopResultBuilder]: For program point L222(lines 222 244) no Hoare annotation was computed. [2022-04-27 21:38:32,015 INFO L899 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 297) no Hoare annotation was computed. [2022-04-27 21:38:32,015 INFO L899 garLoopResultBuilder]: For program point L309(line 309) no Hoare annotation was computed. [2022-04-27 21:38:32,015 INFO L899 garLoopResultBuilder]: For program point L333(line 333) no Hoare annotation was computed. [2022-04-27 21:38:32,015 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 352) no Hoare annotation was computed. [2022-04-27 21:38:32,015 INFO L899 garLoopResultBuilder]: For program point L366(line 366) no Hoare annotation was computed. [2022-04-27 21:38:32,015 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 385) no Hoare annotation was computed. [2022-04-27 21:38:32,015 INFO L899 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 84) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 201) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point L174(lines 174 198) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point L224(line 224) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 242) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 309) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 333) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point L345(line 345) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 366) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point L378(line 378) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 200) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 196) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point L236(line 236) no Hoare annotation was computed. [2022-04-27 21:38:32,016 INFO L899 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 345) no Hoare annotation was computed. [2022-04-27 21:38:32,017 INFO L899 garLoopResultBuilder]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 378) no Hoare annotation was computed. [2022-04-27 21:38:32,017 INFO L899 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 126) no Hoare annotation was computed. [2022-04-27 21:38:32,017 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 162) no Hoare annotation was computed. [2022-04-27 21:38:32,017 INFO L899 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 176) no Hoare annotation was computed. [2022-04-27 21:38:32,017 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-04-27 21:38:32,017 INFO L899 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 236) no Hoare annotation was computed. [2022-04-27 21:38:32,017 INFO L899 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-04-27 21:38:32,017 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2022-04-27 21:38:32,017 INFO L899 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2022-04-27 21:38:32,017 INFO L899 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 142) no Hoare annotation was computed. [2022-04-27 21:38:32,017 INFO L899 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2022-04-27 21:38:32,017 INFO L899 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2022-04-27 21:38:32,019 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:38:32,020 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:38:32,023 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:38:32,023 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 21:38:32,023 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:38:32,023 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 21:38:32,023 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 21:38:32,023 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:38:32,023 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 21:38:32,023 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-27 21:38:32,024 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:38:32,024 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 21:38:32,024 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 21:38:32,024 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:38:32,024 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 21:38:32,024 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 21:38:32,024 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2022-04-27 21:38:32,024 WARN L170 areAnnotationChecker]: L265 has no Hoare annotation [2022-04-27 21:38:32,024 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:38:32,024 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 21:38:32,024 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-27 21:38:32,025 WARN L170 areAnnotationChecker]: L276 has no Hoare annotation [2022-04-27 21:38:32,025 WARN L170 areAnnotationChecker]: L276 has no Hoare annotation [2022-04-27 21:38:32,025 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 21:38:32,025 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 21:38:32,027 WARN L170 areAnnotationChecker]: L278 has no Hoare annotation [2022-04-27 21:38:32,027 WARN L170 areAnnotationChecker]: L278 has no Hoare annotation [2022-04-27 21:38:32,027 WARN L170 areAnnotationChecker]: L288 has no Hoare annotation [2022-04-27 21:38:32,027 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-27 21:38:32,027 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-04-27 21:38:32,027 WARN L170 areAnnotationChecker]: L288 has no Hoare annotation [2022-04-27 21:38:32,027 WARN L170 areAnnotationChecker]: L288 has no Hoare annotation [2022-04-27 21:38:32,027 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-27 21:38:32,027 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-27 21:38:32,027 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-04-27 21:38:32,027 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L295 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L295 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L324 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L324 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L215 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L215 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L297 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L297 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L307 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L307 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L331 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L331 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L364 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L364 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L174 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2022-04-27 21:38:32,028 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L309 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L309 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L333 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L343 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L343 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L366 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L366 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L376 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L376 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L174 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L174 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L345 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L345 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L378 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L378 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2022-04-27 21:38:32,029 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2022-04-27 21:38:32,030 WARN L170 areAnnotationChecker]: L176 has no Hoare annotation [2022-04-27 21:38:32,030 WARN L170 areAnnotationChecker]: L176 has no Hoare annotation [2022-04-27 21:38:32,030 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2022-04-27 21:38:32,030 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2022-04-27 21:38:32,030 WARN L170 areAnnotationChecker]: L236 has no Hoare annotation [2022-04-27 21:38:32,030 WARN L170 areAnnotationChecker]: L236 has no Hoare annotation [2022-04-27 21:38:32,030 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-04-27 21:38:32,030 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-04-27 21:38:32,030 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2022-04-27 21:38:32,030 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2022-04-27 21:38:32,030 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-04-27 21:38:32,030 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-04-27 21:38:32,030 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2022-04-27 21:38:32,030 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2022-04-27 21:38:32,030 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2022-04-27 21:38:32,030 WARN L170 areAnnotationChecker]: L154 has no Hoare annotation [2022-04-27 21:38:32,030 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:38:32,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:38:32 BasicIcfg [2022-04-27 21:38:32,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:38:32,040 INFO L158 Benchmark]: Toolchain (without parser) took 206953.83ms. Allocated memory was 202.4MB in the beginning and 486.5MB in the end (delta: 284.2MB). Free memory was 147.8MB in the beginning and 370.3MB in the end (delta: -222.6MB). Peak memory consumption was 271.4MB. Max. memory is 8.0GB. [2022-04-27 21:38:32,040 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory is still 164.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:38:32,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.48ms. Allocated memory was 202.4MB in the beginning and 336.6MB in the end (delta: 134.2MB). Free memory was 147.5MB in the beginning and 302.5MB in the end (delta: -155.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 21:38:32,041 INFO L158 Benchmark]: Boogie Preprocessor took 42.93ms. Allocated memory is still 336.6MB. Free memory was 302.5MB in the beginning and 300.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:38:32,041 INFO L158 Benchmark]: RCFGBuilder took 329.87ms. Allocated memory is still 336.6MB. Free memory was 300.4MB in the beginning and 283.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-27 21:38:32,041 INFO L158 Benchmark]: IcfgTransformer took 37.91ms. Allocated memory is still 336.6MB. Free memory was 283.1MB in the beginning and 280.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-27 21:38:32,041 INFO L158 Benchmark]: TraceAbstraction took 206322.25ms. Allocated memory was 336.6MB in the beginning and 486.5MB in the end (delta: 149.9MB). Free memory was 279.5MB in the beginning and 370.3MB in the end (delta: -90.9MB). Peak memory consumption was 268.3MB. Max. memory is 8.0GB. [2022-04-27 21:38:32,042 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory is still 164.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.48ms. Allocated memory was 202.4MB in the beginning and 336.6MB in the end (delta: 134.2MB). Free memory was 147.5MB in the beginning and 302.5MB in the end (delta: -155.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.93ms. Allocated memory is still 336.6MB. Free memory was 302.5MB in the beginning and 300.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 329.87ms. Allocated memory is still 336.6MB. Free memory was 300.4MB in the beginning and 283.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * IcfgTransformer took 37.91ms. Allocated memory is still 336.6MB. Free memory was 283.1MB in the beginning and 280.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 206322.25ms. Allocated memory was 336.6MB in the beginning and 486.5MB in the end (delta: 149.9MB). Free memory was 279.5MB in the beginning and 370.3MB in the end (delta: -90.9MB). Peak memory consumption was 268.3MB. 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: 52]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 278]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 72]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 297]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 84]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 309]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 366]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 114]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 224]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 345]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 378]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 126]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 176]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 236]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 188]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 142]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 154]: 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, 80 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 206.3s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 193.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1835 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1835 mSDsluCounter, 3028 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1935 mSDsCounter, 218 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3589 IncrementalHoareTripleChecker+Invalid, 3807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 218 mSolverCounterUnsat, 1093 mSDtfsCounter, 3589 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 147 SyntacticMatches, 10 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 509 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 259 HoareAnnotationTreeSize, 9 FomulaSimplifications, 3325031 FormulaSimplificationTreeSizeReduction, 192.7s HoareSimplificationTime, 9 FomulaSimplificationsInter, 6109741 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 473 ConstructedInterpolants, 0 QuantifiedInterpolants, 1950 SizeOfPredicates, 6 NumberOfNonLiveVariables, 301 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 18 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((main__t <= 1 && 1 <= __VERIFIER_assert__cond) && (((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) || ((((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t))) || ((1 <= __VERIFIER_assert__cond && (((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) || ((((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t))) && 1 <= __VERIFIER_assert__cond)) && !(main__tagbuf_len <= main__t)) || (main__t == 0 && 0 < main__tagbuf_len) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && 1 <= main__t - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: ((((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0)) && main__t == 0) && 0 < main__tagbuf_len) || ((1 <= __VERIFIER_assert__cond && ((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0))) && !(main__tagbuf_len <= main__t)) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len RESULT: Ultimate proved your program to be correct! [2022-04-27 21:38:32,065 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...