/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:51:04,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:51:04,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:51:04,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:51:04,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:51:04,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:51:05,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:51:05,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:51:05,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:51:05,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:51:05,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:51:05,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:51:05,010 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:51:05,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:51:05,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:51:05,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:51:05,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:51:05,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:51:05,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:51:05,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:51:05,024 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:51:05,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:51:05,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:51:05,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:51:05,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:51:05,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:51:05,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:51:05,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:51:05,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:51:05,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:51:05,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:51:05,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:51:05,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:51:05,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:51:05,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:51:05,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:51:05,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:51:05,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:51:05,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:51:05,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:51:05,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:51:05,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:51:05,039 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:51:05,046 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:51:05,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:51:05,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:51:05,048 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:51:05,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:51:05,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:51:05,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:51:05,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:51:05,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:51:05,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:51:05,049 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:51:05,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:51:05,049 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:51:05,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:51:05,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:51:05,050 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:51:05,050 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:51:05,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:51:05,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:51:05,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:51:05,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:51:05,050 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:51:05,050 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:51:05,050 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:51:05,050 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:51:05,050 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 03:51:05,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:51:05,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:51:05,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:51:05,284 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:51:05,285 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:51:05,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-04-08 03:51:05,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db25b7402/5478a4358af7417489046c1b39ee28d4/FLAG87b711361 [2022-04-08 03:51:05,643 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:51:05,644 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-04-08 03:51:05,659 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db25b7402/5478a4358af7417489046c1b39ee28d4/FLAG87b711361 [2022-04-08 03:51:06,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db25b7402/5478a4358af7417489046c1b39ee28d4 [2022-04-08 03:51:06,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:51:06,060 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:51:06,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:51:06,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:51:06,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:51:06,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:51:06" (1/1) ... [2022-04-08 03:51:06,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2198fe5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:51:06, skipping insertion in model container [2022-04-08 03:51:06,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:51:06" (1/1) ... [2022-04-08 03:51:06,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:51:06,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:51:06,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.p+lhb-reducer.c[919,932] [2022-04-08 03:51:06,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.p+lhb-reducer.c[1134,1147] [2022-04-08 03:51:06,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2022-04-08 03:51:06,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2022-04-08 03:51:06,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-04-08 03:51:06,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-04-08 03:51:06,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2022-04-08 03:51:06,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-04-08 03:51:06,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-04-08 03:51:06,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-04-08 03:51:06,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-04-08 03:51:06,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-04-08 03:51:06,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-04-08 03:51:06,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-04-08 03:51:06,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-04-08 03:51:06,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-04-08 03:51:06,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:51:06,391 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:51:06,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2022-04-08 03:51:06,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2022-04-08 03:51:06,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2022-04-08 03:51:06,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2022-04-08 03:51:06,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-04-08 03:51:06,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-04-08 03:51:06,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2022-04-08 03:51:06,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-04-08 03:51:06,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-04-08 03:51:06,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-04-08 03:51:06,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-04-08 03:51:06,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-04-08 03:51:06,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-04-08 03:51:06,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-04-08 03:51:06,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-04-08 03:51:06,469 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-04-08 03:51:06,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:51:06,484 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:51:06,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:51:06 WrapperNode [2022-04-08 03:51:06,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:51:06,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:51:06,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:51:06,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:51:06,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:51:06" (1/1) ... [2022-04-08 03:51:06,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:51:06" (1/1) ... [2022-04-08 03:51:06,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:51:06" (1/1) ... [2022-04-08 03:51:06,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:51:06" (1/1) ... [2022-04-08 03:51:06,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:51:06" (1/1) ... [2022-04-08 03:51:06,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:51:06" (1/1) ... [2022-04-08 03:51:06,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:51:06" (1/1) ... [2022-04-08 03:51:06,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:51:06,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:51:06,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:51:06,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:51:06,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:51:06" (1/1) ... [2022-04-08 03:51:06,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:51:06,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:51:06,580 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-08 03:51:06,585 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-08 03:51:06,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:51:06,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:51:06,623 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:51:06,623 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 03:51:06,623 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:51:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:51:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:51:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:51:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:51:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 03:51:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:51:06,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 03:51:06,624 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:51:06,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:51:06,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:51:06,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:51:06,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:51:06,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:51:06,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:51:06,736 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:51:06,737 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:51:07,239 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:51:07,246 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:51:07,247 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-08 03:51:07,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:51:07 BoogieIcfgContainer [2022-04-08 03:51:07,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:51:07,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:51:07,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:51:07,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:51:07,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:51:06" (1/3) ... [2022-04-08 03:51:07,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f4ae82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:51:07, skipping insertion in model container [2022-04-08 03:51:07,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:51:06" (2/3) ... [2022-04-08 03:51:07,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f4ae82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:51:07, skipping insertion in model container [2022-04-08 03:51:07,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:51:07" (3/3) ... [2022-04-08 03:51:07,255 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2022-04-08 03:51:07,259 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:51:07,259 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-04-08 03:51:07,296 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:51:07,306 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 03:51:07,306 INFO L341 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-04-08 03:51:07,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 104 states have (on average 1.9038461538461537) internal successors, (198), 120 states have internal predecessors, (198), 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-08 03:51:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 03:51:07,330 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:07,330 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:07,331 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:07,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:07,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1600664684, now seen corresponding path program 1 times [2022-04-08 03:51:07,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:07,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1973579043] [2022-04-08 03:51:07,346 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:07,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1600664684, now seen corresponding path program 2 times [2022-04-08 03:51:07,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:07,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883290664] [2022-04-08 03:51:07,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:07,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:07,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:07,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {135#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {128#true} is VALID [2022-04-08 03:51:07,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#true} assume true; {128#true} is VALID [2022-04-08 03:51:07,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128#true} {128#true} #398#return; {128#true} is VALID [2022-04-08 03:51:07,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {128#true} call ULTIMATE.init(); {135#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:07,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {128#true} is VALID [2022-04-08 03:51:07,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {128#true} assume true; {128#true} is VALID [2022-04-08 03:51:07,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128#true} {128#true} #398#return; {128#true} is VALID [2022-04-08 03:51:07,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {128#true} call #t~ret18 := main(); {128#true} is VALID [2022-04-08 03:51:07,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {128#true} is VALID [2022-04-08 03:51:07,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {133#(<= 0 main_~main__t~0)} is VALID [2022-04-08 03:51:07,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#(<= 0 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0; {133#(<= 0 main_~main__t~0)} is VALID [2022-04-08 03:51:07,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#(<= 0 main_~main__t~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {134#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-08 03:51:07,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {134#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {129#false} is VALID [2022-04-08 03:51:07,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {129#false} assume !false; {129#false} is VALID [2022-04-08 03:51:07,543 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-08 03:51:07,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:07,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883290664] [2022-04-08 03:51:07,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883290664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:07,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:07,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:51:07,546 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:07,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1973579043] [2022-04-08 03:51:07,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1973579043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:07,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:07,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:51:07,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298931099] [2022-04-08 03:51:07,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:07,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 03:51:07,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:07,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:07,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:07,565 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:51:07,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:07,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:51:07,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:51:07,585 INFO L87 Difference]: Start difference. First operand has 125 states, 104 states have (on average 1.9038461538461537) internal successors, (198), 120 states have internal predecessors, (198), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:08,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:08,499 INFO L93 Difference]: Finished difference Result 143 states and 221 transitions. [2022-04-08 03:51:08,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:51:08,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 03:51:08,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions. [2022-04-08 03:51:08,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions. [2022-04-08 03:51:08,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 221 transitions. [2022-04-08 03:51:08,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:08,691 INFO L225 Difference]: With dead ends: 143 [2022-04-08 03:51:08,691 INFO L226 Difference]: Without dead ends: 123 [2022-04-08 03:51:08,693 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:51:08,695 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 269 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:08,695 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 118 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:51:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-08 03:51:08,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2022-04-08 03:51:08,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:08,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 118 states, 100 states have (on average 1.36) internal successors, (136), 114 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:08,780 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 118 states, 100 states have (on average 1.36) internal successors, (136), 114 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:08,780 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 118 states, 100 states have (on average 1.36) internal successors, (136), 114 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:08,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:08,785 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2022-04-08 03:51:08,785 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2022-04-08 03:51:08,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:08,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:08,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 100 states have (on average 1.36) internal successors, (136), 114 states have internal predecessors, (136), 2 states have call successors, (2), 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 123 states. [2022-04-08 03:51:08,787 INFO L87 Difference]: Start difference. First operand has 118 states, 100 states have (on average 1.36) internal successors, (136), 114 states have internal predecessors, (136), 2 states have call successors, (2), 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 123 states. [2022-04-08 03:51:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:08,791 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2022-04-08 03:51:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2022-04-08 03:51:08,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:08,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:08,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:08,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.36) internal successors, (136), 114 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2022-04-08 03:51:08,797 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2022-04-08 03:51:08,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:08,797 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2022-04-08 03:51:08,797 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:08,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 139 transitions. [2022-04-08 03:51:08,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:08,921 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2022-04-08 03:51:08,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 03:51:08,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:08,922 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:08,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:51:08,922 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:08,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:08,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1919005414, now seen corresponding path program 1 times [2022-04-08 03:51:08,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:08,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1392797026] [2022-04-08 03:51:08,923 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:08,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1919005414, now seen corresponding path program 2 times [2022-04-08 03:51:08,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:08,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849235243] [2022-04-08 03:51:08,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:08,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:09,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:09,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {920#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {912#true} is VALID [2022-04-08 03:51:09,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-08 03:51:09,009 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {912#true} {912#true} #398#return; {912#true} is VALID [2022-04-08 03:51:09,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {920#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:09,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {920#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {912#true} is VALID [2022-04-08 03:51:09,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-08 03:51:09,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #398#return; {912#true} is VALID [2022-04-08 03:51:09,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret18 := main(); {912#true} is VALID [2022-04-08 03:51:09,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {912#true} is VALID [2022-04-08 03:51:09,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {912#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {917#(or (= main_~main__t~0 0) (<= main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2022-04-08 03:51:09,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {917#(or (= main_~main__t~0 0) (<= main_~main__t~0 main_~main__tagbuf_len~0))} assume ~main__t~0 == ~main__tagbuf_len~0; {918#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:09,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {918#(<= main_~main__t~0 main_~main__tagbuf_len~0)} havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {918#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:09,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {918#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {919#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-08 03:51:09,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {919#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {913#false} is VALID [2022-04-08 03:51:09,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-08 03:51:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:51:09,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:09,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849235243] [2022-04-08 03:51:09,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849235243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:09,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:09,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:51:09,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:09,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1392797026] [2022-04-08 03:51:09,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1392797026] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:09,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:09,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:51:09,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683891706] [2022-04-08 03:51:09,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:09,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 03:51:09,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:09,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:09,024 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-08 03:51:09,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:51:09,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:09,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:51:09,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:51:09,025 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:09,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:09,601 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2022-04-08 03:51:09,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:51:09,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 03:51:09,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2022-04-08 03:51:09,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2022-04-08 03:51:09,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 142 transitions. [2022-04-08 03:51:09,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:09,704 INFO L225 Difference]: With dead ends: 121 [2022-04-08 03:51:09,704 INFO L226 Difference]: Without dead ends: 113 [2022-04-08 03:51:09,704 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-08 03:51:09,705 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 102 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:09,706 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 217 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:51:09,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-08 03:51:09,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-04-08 03:51:09,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:09,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 113 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 109 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:09,768 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 113 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 109 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:09,768 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 113 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 109 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:09,771 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-04-08 03:51:09,771 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-04-08 03:51:09,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:09,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:09,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 109 states have internal predecessors, (122), 2 states have call successors, (2), 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 113 states. [2022-04-08 03:51:09,772 INFO L87 Difference]: Start difference. First operand has 113 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 109 states have internal predecessors, (122), 2 states have call successors, (2), 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 113 states. [2022-04-08 03:51:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:09,775 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-04-08 03:51:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-04-08 03:51:09,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:09,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:09,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:09,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:09,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 109 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2022-04-08 03:51:09,779 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2022-04-08 03:51:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:09,779 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2022-04-08 03:51:09,779 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:09,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 125 transitions. [2022-04-08 03:51:09,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-04-08 03:51:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 03:51:09,872 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:09,872 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:09,872 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:51:09,872 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:09,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:09,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1908131676, now seen corresponding path program 1 times [2022-04-08 03:51:09,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:09,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1672870653] [2022-04-08 03:51:09,873 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:09,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1908131676, now seen corresponding path program 2 times [2022-04-08 03:51:09,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:09,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244052901] [2022-04-08 03:51:09,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:09,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:09,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:09,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {1631#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {1623#true} is VALID [2022-04-08 03:51:09,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-08 03:51:09,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1623#true} {1623#true} #398#return; {1623#true} is VALID [2022-04-08 03:51:09,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {1623#true} call ULTIMATE.init(); {1631#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:09,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {1631#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {1623#true} is VALID [2022-04-08 03:51:09,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {1623#true} assume true; {1623#true} is VALID [2022-04-08 03:51:09,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1623#true} {1623#true} #398#return; {1623#true} is VALID [2022-04-08 03:51:09,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {1623#true} call #t~ret18 := main(); {1623#true} is VALID [2022-04-08 03:51:09,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {1623#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {1623#true} is VALID [2022-04-08 03:51:09,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {1623#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1628#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:09,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {1628#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {1628#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:09,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {1628#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1628#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:09,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {1628#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1628#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:09,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {1628#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {1629#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:09,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {1629#(<= 1 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {1629#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:09,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {1629#(<= 1 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {1630#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-08 03:51:09,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {1630#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {1624#false} is VALID [2022-04-08 03:51:09,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {1624#false} assume !false; {1624#false} is VALID [2022-04-08 03:51:09,939 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-08 03:51:09,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:09,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244052901] [2022-04-08 03:51:09,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244052901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:09,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:09,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:51:09,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:09,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1672870653] [2022-04-08 03:51:09,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1672870653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:09,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:09,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:51:09,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800082520] [2022-04-08 03:51:09,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:09,941 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-08 03:51:09,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:09,941 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-08 03:51:09,950 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-08 03:51:09,950 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:51:09,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:09,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:51:09,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:51:09,951 INFO L87 Difference]: Start difference. First operand 113 states and 125 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-08 03:51:10,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:10,637 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-04-08 03:51:10,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:51:10,638 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-08 03:51:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:10,638 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-08 03:51:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2022-04-08 03:51:10,639 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-08 03:51:10,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2022-04-08 03:51:10,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 125 transitions. [2022-04-08 03:51:10,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:10,742 INFO L225 Difference]: With dead ends: 113 [2022-04-08 03:51:10,742 INFO L226 Difference]: Without dead ends: 111 [2022-04-08 03:51:10,742 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-08 03:51:10,743 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 140 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:10,743 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 118 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:51:10,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-08 03:51:10,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-08 03:51:10,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:10,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 111 states, 95 states have (on average 1.263157894736842) internal successors, (120), 107 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:10,868 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 111 states, 95 states have (on average 1.263157894736842) internal successors, (120), 107 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:10,868 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 111 states, 95 states have (on average 1.263157894736842) internal successors, (120), 107 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:10,871 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-04-08 03:51:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-04-08 03:51:10,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:10,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:10,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 95 states have (on average 1.263157894736842) internal successors, (120), 107 states have internal predecessors, (120), 2 states have call successors, (2), 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-08 03:51:10,872 INFO L87 Difference]: Start difference. First operand has 111 states, 95 states have (on average 1.263157894736842) internal successors, (120), 107 states have internal predecessors, (120), 2 states have call successors, (2), 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-08 03:51:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:10,874 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-04-08 03:51:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-04-08 03:51:10,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:10,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:10,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:10,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.263157894736842) internal successors, (120), 107 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2022-04-08 03:51:10,877 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2022-04-08 03:51:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:10,877 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2022-04-08 03:51:10,877 INFO L479 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-08 03:51:10,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 123 transitions. [2022-04-08 03:51:10,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-04-08 03:51:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 03:51:10,970 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:10,971 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:10,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 03:51:10,971 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:10,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:10,971 INFO L85 PathProgramCache]: Analyzing trace with hash -977457091, now seen corresponding path program 1 times [2022-04-08 03:51:10,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:10,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1772769857] [2022-04-08 03:51:10,972 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:10,972 INFO L85 PathProgramCache]: Analyzing trace with hash -977457091, now seen corresponding path program 2 times [2022-04-08 03:51:10,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:10,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078132693] [2022-04-08 03:51:10,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:10,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:11,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:11,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {2317#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {2310#true} is VALID [2022-04-08 03:51:11,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {2310#true} assume true; {2310#true} is VALID [2022-04-08 03:51:11,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2310#true} {2310#true} #398#return; {2310#true} is VALID [2022-04-08 03:51:11,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {2310#true} call ULTIMATE.init(); {2317#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:11,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {2317#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {2310#true} is VALID [2022-04-08 03:51:11,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {2310#true} assume true; {2310#true} is VALID [2022-04-08 03:51:11,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2310#true} {2310#true} #398#return; {2310#true} is VALID [2022-04-08 03:51:11,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {2310#true} call #t~ret18 := main(); {2310#true} is VALID [2022-04-08 03:51:11,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {2310#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {2310#true} is VALID [2022-04-08 03:51:11,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {2310#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2310#true} is VALID [2022-04-08 03:51:11,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {2310#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {2310#true} is VALID [2022-04-08 03:51:11,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {2310#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2310#true} is VALID [2022-04-08 03:51:11,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {2310#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2310#true} is VALID [2022-04-08 03:51:11,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {2310#true} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {2310#true} is VALID [2022-04-08 03:51:11,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {2310#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {2310#true} is VALID [2022-04-08 03:51:11,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {2310#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {2315#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:11,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {2315#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {2316#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-08 03:51:11,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {2316#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {2311#false} is VALID [2022-04-08 03:51:11,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {2311#false} assume !false; {2311#false} is VALID [2022-04-08 03:51:11,024 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-08 03:51:11,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:11,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078132693] [2022-04-08 03:51:11,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078132693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:11,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:11,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:51:11,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:11,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1772769857] [2022-04-08 03:51:11,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1772769857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:11,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:11,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:51:11,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374896448] [2022-04-08 03:51:11,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:11,026 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-08 03:51:11,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:11,026 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-08 03:51:11,035 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-08 03:51:11,035 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:51:11,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:11,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:51:11,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:51:11,036 INFO L87 Difference]: Start difference. First operand 111 states and 123 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-08 03:51:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:11,565 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-04-08 03:51:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:51:11,565 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-08 03:51:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:11,565 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-08 03:51:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2022-04-08 03:51:11,567 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-08 03:51:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2022-04-08 03:51:11,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 123 transitions. [2022-04-08 03:51:11,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:11,699 INFO L225 Difference]: With dead ends: 111 [2022-04-08 03:51:11,699 INFO L226 Difference]: Without dead ends: 107 [2022-04-08 03:51:11,699 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:51:11,700 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 65 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:11,700 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 199 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:51:11,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-08 03:51:11,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-04-08 03:51:11,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:11,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:11,830 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:11,831 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:11,833 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-04-08 03:51:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-04-08 03:51:11,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:11,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:11,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 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 107 states. [2022-04-08 03:51:11,834 INFO L87 Difference]: Start difference. First operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 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 107 states. [2022-04-08 03:51:11,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:11,837 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-04-08 03:51:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-04-08 03:51:11,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:11,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:11,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:11,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 103 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:11,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2022-04-08 03:51:11,840 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2022-04-08 03:51:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:11,840 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2022-04-08 03:51:11,841 INFO L479 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-08 03:51:11,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 119 transitions. [2022-04-08 03:51:11,949 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-08 03:51:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-04-08 03:51:11,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 03:51:11,950 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:11,950 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:11,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 03:51:11,951 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:11,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:11,951 INFO L85 PathProgramCache]: Analyzing trace with hash -223130707, now seen corresponding path program 1 times [2022-04-08 03:51:11,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:11,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [920840886] [2022-04-08 03:51:11,952 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:11,952 INFO L85 PathProgramCache]: Analyzing trace with hash -223130707, now seen corresponding path program 2 times [2022-04-08 03:51:11,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:11,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880090870] [2022-04-08 03:51:11,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:11,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:12,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:12,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {2983#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {2975#true} is VALID [2022-04-08 03:51:12,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {2975#true} assume true; {2975#true} is VALID [2022-04-08 03:51:12,007 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2975#true} {2975#true} #398#return; {2975#true} is VALID [2022-04-08 03:51:12,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {2975#true} call ULTIMATE.init(); {2983#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:12,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {2983#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {2975#true} is VALID [2022-04-08 03:51:12,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {2975#true} assume true; {2975#true} is VALID [2022-04-08 03:51:12,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2975#true} {2975#true} #398#return; {2975#true} is VALID [2022-04-08 03:51:12,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {2975#true} call #t~ret18 := main(); {2975#true} is VALID [2022-04-08 03:51:12,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {2975#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {2975#true} is VALID [2022-04-08 03:51:12,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {2975#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2980#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:12,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {2980#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {2980#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:12,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {2980#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2980#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:12,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {2980#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2980#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:12,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {2980#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {2981#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:12,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {2981#(<= 1 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {2981#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:12,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {2981#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {2981#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:12,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {2981#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {2981#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:12,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {2981#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {2982#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-08 03:51:12,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {2982#(not (= main_~__VERIFIER_assert__cond~6 0))} assume 0 == ~__VERIFIER_assert__cond~6; {2976#false} is VALID [2022-04-08 03:51:12,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {2976#false} assume !false; {2976#false} is VALID [2022-04-08 03:51:12,014 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-08 03:51:12,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:12,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880090870] [2022-04-08 03:51:12,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880090870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:12,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:12,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:51:12,015 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:12,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [920840886] [2022-04-08 03:51:12,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [920840886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:12,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:12,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:51:12,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024841035] [2022-04-08 03:51:12,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:12,016 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-08 03:51:12,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:12,016 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-08 03:51:12,027 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-08 03:51:12,028 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:51:12,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:12,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:51:12,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:51:12,029 INFO L87 Difference]: Start difference. First operand 107 states and 119 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-08 03:51:12,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:12,745 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2022-04-08 03:51:12,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:51:12,745 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-08 03:51:12,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:12,746 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-08 03:51:12,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2022-04-08 03:51:12,748 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-08 03:51:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2022-04-08 03:51:12,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 139 transitions. [2022-04-08 03:51:12,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:12,857 INFO L225 Difference]: With dead ends: 125 [2022-04-08 03:51:12,857 INFO L226 Difference]: Without dead ends: 123 [2022-04-08 03:51:12,858 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-08 03:51:12,858 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 157 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:12,859 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 128 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:51:12,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-08 03:51:12,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-04-08 03:51:12,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:12,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 101 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:12,958 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 101 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:12,959 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 101 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:12,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:12,961 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2022-04-08 03:51:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2022-04-08 03:51:12,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:12,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:12,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 101 states have internal predecessors, (114), 2 states have call successors, (2), 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 123 states. [2022-04-08 03:51:12,962 INFO L87 Difference]: Start difference. First operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 101 states have internal predecessors, (114), 2 states have call successors, (2), 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 123 states. [2022-04-08 03:51:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:12,964 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2022-04-08 03:51:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2022-04-08 03:51:12,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:12,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:12,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:12,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:12,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 101 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:12,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-04-08 03:51:12,967 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2022-04-08 03:51:12,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:12,967 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-04-08 03:51:12,967 INFO L479 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-08 03:51:12,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 117 transitions. [2022-04-08 03:51:13,068 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-08 03:51:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-04-08 03:51:13,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 03:51:13,069 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:13,069 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:13,069 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 03:51:13,069 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:13,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:13,070 INFO L85 PathProgramCache]: Analyzing trace with hash -221591507, now seen corresponding path program 1 times [2022-04-08 03:51:13,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:13,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1642353899] [2022-04-08 03:51:13,070 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:13,070 INFO L85 PathProgramCache]: Analyzing trace with hash -221591507, now seen corresponding path program 2 times [2022-04-08 03:51:13,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:13,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870974311] [2022-04-08 03:51:13,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:13,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:13,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:13,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {3706#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {3698#true} is VALID [2022-04-08 03:51:13,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {3698#true} assume true; {3698#true} is VALID [2022-04-08 03:51:13,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3698#true} {3698#true} #398#return; {3698#true} is VALID [2022-04-08 03:51:13,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {3698#true} call ULTIMATE.init(); {3706#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:13,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {3706#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {3698#true} is VALID [2022-04-08 03:51:13,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {3698#true} assume true; {3698#true} is VALID [2022-04-08 03:51:13,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3698#true} {3698#true} #398#return; {3698#true} is VALID [2022-04-08 03:51:13,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {3698#true} call #t~ret18 := main(); {3698#true} is VALID [2022-04-08 03:51:13,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {3698#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {3698#true} is VALID [2022-04-08 03:51:13,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {3698#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3703#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:13,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {3703#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {3703#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:13,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {3703#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3703#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:13,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {3703#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3703#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:13,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {3703#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {3704#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:13,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {3704#(<= 1 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {3704#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:13,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {3704#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {3704#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:13,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {3704#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet8;havoc #t~nondet8; {3704#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:13,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {3704#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {3705#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-08 03:51:13,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {3705#(not (= main_~__VERIFIER_assert__cond~12 0))} assume 0 == ~__VERIFIER_assert__cond~12; {3699#false} is VALID [2022-04-08 03:51:13,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {3699#false} assume !false; {3699#false} is VALID [2022-04-08 03:51:13,145 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-08 03:51:13,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:13,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870974311] [2022-04-08 03:51:13,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870974311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:13,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:13,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:51:13,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:13,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1642353899] [2022-04-08 03:51:13,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1642353899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:13,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:13,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:51:13,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105769987] [2022-04-08 03:51:13,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:13,147 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-08 03:51:13,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:13,147 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-08 03:51:13,157 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-08 03:51:13,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:51:13,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:13,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:51:13,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:51:13,158 INFO L87 Difference]: Start difference. First operand 105 states and 117 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-08 03:51:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:13,777 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2022-04-08 03:51:13,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:51:13,778 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-08 03:51:13,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:13,778 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-08 03:51:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2022-04-08 03:51:13,779 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-08 03:51:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2022-04-08 03:51:13,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 117 transitions. [2022-04-08 03:51:13,870 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-08 03:51:13,872 INFO L225 Difference]: With dead ends: 105 [2022-04-08 03:51:13,872 INFO L226 Difference]: Without dead ends: 103 [2022-04-08 03:51:13,872 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-08 03:51:13,872 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 130 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:13,873 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 100 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:51:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-08 03:51:13,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-08 03:51:13,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:13,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 99 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:13,970 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 99 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:13,970 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 99 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:13,972 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2022-04-08 03:51:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-08 03:51:13,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:13,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:13,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 99 states have internal predecessors, (112), 2 states have call successors, (2), 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 103 states. [2022-04-08 03:51:13,973 INFO L87 Difference]: Start difference. First operand has 103 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 99 states have internal predecessors, (112), 2 states have call successors, (2), 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 103 states. [2022-04-08 03:51:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:13,975 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2022-04-08 03:51:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-08 03:51:13,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:13,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:13,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:13,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 99 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2022-04-08 03:51:13,978 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2022-04-08 03:51:13,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:13,978 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2022-04-08 03:51:13,978 INFO L479 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-08 03:51:13,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 115 transitions. [2022-04-08 03:51:14,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-08 03:51:14,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 03:51:14,070 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:14,070 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:14,070 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 03:51:14,070 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:14,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:14,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1674251212, now seen corresponding path program 1 times [2022-04-08 03:51:14,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:14,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1020382927] [2022-04-08 03:51:14,071 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:14,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1674251212, now seen corresponding path program 2 times [2022-04-08 03:51:14,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:14,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351472425] [2022-04-08 03:51:14,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:14,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:14,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:14,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {4345#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {4337#true} is VALID [2022-04-08 03:51:14,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {4337#true} assume true; {4337#true} is VALID [2022-04-08 03:51:14,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4337#true} {4337#true} #398#return; {4337#true} is VALID [2022-04-08 03:51:14,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {4337#true} call ULTIMATE.init(); {4345#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:14,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {4345#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {4337#true} is VALID [2022-04-08 03:51:14,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {4337#true} assume true; {4337#true} is VALID [2022-04-08 03:51:14,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4337#true} {4337#true} #398#return; {4337#true} is VALID [2022-04-08 03:51:14,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {4337#true} call #t~ret18 := main(); {4337#true} is VALID [2022-04-08 03:51:14,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {4337#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {4337#true} is VALID [2022-04-08 03:51:14,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {4337#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4342#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:14,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {4342#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {4342#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:14,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {4342#(= main_~main__t~0 0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4342#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:14,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {4342#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4342#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:14,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {4342#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {4343#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:14,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {4343#(<= 1 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {4343#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:14,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {4343#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {4343#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:14,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {4343#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {4343#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:14,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {4343#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_4~0); {4343#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:14,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {4343#(<= 1 main_~main__t~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4344#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-08 03:51:14,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {4344#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {4338#false} is VALID [2022-04-08 03:51:14,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {4338#false} assume !false; {4338#false} is VALID [2022-04-08 03:51:14,124 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-08 03:51:14,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:14,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351472425] [2022-04-08 03:51:14,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351472425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:14,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:14,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:51:14,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:14,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1020382927] [2022-04-08 03:51:14,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1020382927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:14,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:14,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:51:14,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375457834] [2022-04-08 03:51:14,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:14,125 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-08 03:51:14,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:14,125 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-08 03:51:14,135 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-08 03:51:14,136 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:51:14,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:14,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:51:14,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:51:14,136 INFO L87 Difference]: Start difference. First operand 103 states and 115 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-08 03:51:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:14,865 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2022-04-08 03:51:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:51:14,866 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-08 03:51:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:14,866 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-08 03:51:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2022-04-08 03:51:14,867 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-08 03:51:14,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2022-04-08 03:51:14,869 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 138 transitions. [2022-04-08 03:51:14,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:14,976 INFO L225 Difference]: With dead ends: 124 [2022-04-08 03:51:14,976 INFO L226 Difference]: Without dead ends: 122 [2022-04-08 03:51:14,976 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-08 03:51:14,976 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 148 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:14,977 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 120 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:51:14,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-08 03:51:15,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2022-04-08 03:51:15,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:15,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 101 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 97 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:15,074 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 101 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 97 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:15,075 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 101 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 97 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:15,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:15,077 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2022-04-08 03:51:15,077 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2022-04-08 03:51:15,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:15,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:15,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 97 states have internal predecessors, (110), 2 states have call successors, (2), 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 122 states. [2022-04-08 03:51:15,078 INFO L87 Difference]: Start difference. First operand has 101 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 97 states have internal predecessors, (110), 2 states have call successors, (2), 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 122 states. [2022-04-08 03:51:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:15,080 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2022-04-08 03:51:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2022-04-08 03:51:15,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:15,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:15,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:15,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 97 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2022-04-08 03:51:15,082 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2022-04-08 03:51:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:15,082 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2022-04-08 03:51:15,082 INFO L479 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-08 03:51:15,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 113 transitions. [2022-04-08 03:51:15,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:15,178 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2022-04-08 03:51:15,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 03:51:15,178 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:15,178 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:15,178 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 03:51:15,178 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:15,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:15,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1672885792, now seen corresponding path program 1 times [2022-04-08 03:51:15,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:15,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [102768172] [2022-04-08 03:51:15,179 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:15,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1672885792, now seen corresponding path program 2 times [2022-04-08 03:51:15,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:15,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378649592] [2022-04-08 03:51:15,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:15,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:15,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:15,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {5057#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {5048#true} is VALID [2022-04-08 03:51:15,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {5048#true} assume true; {5048#true} is VALID [2022-04-08 03:51:15,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5048#true} {5048#true} #398#return; {5048#true} is VALID [2022-04-08 03:51:15,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {5048#true} call ULTIMATE.init(); {5057#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:15,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {5057#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {5048#true} is VALID [2022-04-08 03:51:15,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {5048#true} assume true; {5048#true} is VALID [2022-04-08 03:51:15,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5048#true} {5048#true} #398#return; {5048#true} is VALID [2022-04-08 03:51:15,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {5048#true} call #t~ret18 := main(); {5048#true} is VALID [2022-04-08 03:51:15,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {5048#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {5048#true} is VALID [2022-04-08 03:51:15,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {5048#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5053#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-08 03:51:15,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {5053#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {5054#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:15,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {5054#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5054#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:15,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {5054#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5054#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:15,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {5054#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {5055#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:15,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {5055#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {5055#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:15,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {5055#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {5055#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:15,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {5055#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {5055#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:15,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {5055#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5055#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:15,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {5055#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5056#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-08 03:51:15,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {5056#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {5049#false} is VALID [2022-04-08 03:51:15,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {5049#false} assume !false; {5049#false} is VALID [2022-04-08 03:51:15,286 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-08 03:51:15,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:15,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378649592] [2022-04-08 03:51:15,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378649592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:15,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:15,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:51:15,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:15,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [102768172] [2022-04-08 03:51:15,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [102768172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:15,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:15,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:51:15,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003023371] [2022-04-08 03:51:15,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:15,287 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-08 03:51:15,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:15,287 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-08 03:51:15,300 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-08 03:51:15,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:51:15,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:15,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:51:15,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:51:15,301 INFO L87 Difference]: Start difference. First operand 101 states and 113 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-08 03:51:16,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:16,190 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2022-04-08 03:51:16,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:51:16,190 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-08 03:51:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:16,191 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-08 03:51:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2022-04-08 03:51:16,192 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-08 03:51:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2022-04-08 03:51:16,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 150 transitions. [2022-04-08 03:51:16,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:16,304 INFO L225 Difference]: With dead ends: 134 [2022-04-08 03:51:16,304 INFO L226 Difference]: Without dead ends: 132 [2022-04-08 03:51:16,304 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-04-08 03:51:16,305 INFO L913 BasicCegarLoop]: 107 mSDtfsCounter, 100 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:16,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 252 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 03:51:16,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-08 03:51:16,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 107. [2022-04-08 03:51:16,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:16,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:16,437 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:16,437 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:16,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:16,440 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-04-08 03:51:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 148 transitions. [2022-04-08 03:51:16,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:16,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:16,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 2 states have call successors, (2), 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 132 states. [2022-04-08 03:51:16,440 INFO L87 Difference]: Start difference. First operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 2 states have call successors, (2), 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 132 states. [2022-04-08 03:51:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:16,442 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-04-08 03:51:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 148 transitions. [2022-04-08 03:51:16,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:16,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:16,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:16,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:16,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2022-04-08 03:51:16,450 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 18 [2022-04-08 03:51:16,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:16,451 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2022-04-08 03:51:16,451 INFO L479 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-08 03:51:16,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 121 transitions. [2022-04-08 03:51:16,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:16,560 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-04-08 03:51:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 03:51:16,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:16,561 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:16,561 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 03:51:16,561 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:16,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:16,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1720601042, now seen corresponding path program 1 times [2022-04-08 03:51:16,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:16,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1635309106] [2022-04-08 03:51:16,562 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:16,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1720601042, now seen corresponding path program 2 times [2022-04-08 03:51:16,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:16,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676010960] [2022-04-08 03:51:16,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:16,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:16,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:16,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {5823#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {5814#true} is VALID [2022-04-08 03:51:16,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {5814#true} assume true; {5814#true} is VALID [2022-04-08 03:51:16,656 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5814#true} {5814#true} #398#return; {5814#true} is VALID [2022-04-08 03:51:16,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {5814#true} call ULTIMATE.init(); {5823#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:16,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {5823#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {5814#true} is VALID [2022-04-08 03:51:16,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {5814#true} assume true; {5814#true} is VALID [2022-04-08 03:51:16,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5814#true} {5814#true} #398#return; {5814#true} is VALID [2022-04-08 03:51:16,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {5814#true} call #t~ret18 := main(); {5814#true} is VALID [2022-04-08 03:51:16,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {5814#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {5814#true} is VALID [2022-04-08 03:51:16,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {5814#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5819#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-08 03:51:16,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {5819#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {5820#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:16,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {5820#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5820#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:16,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {5820#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5820#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:16,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {5820#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {5821#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:16,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {5821#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {5821#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:16,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {5821#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {5821#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:16,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {5821#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet8;havoc #t~nondet8; {5821#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:16,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {5821#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {5821#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:16,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {5821#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {5822#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-08 03:51:16,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {5822#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {5815#false} is VALID [2022-04-08 03:51:16,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {5815#false} assume !false; {5815#false} is VALID [2022-04-08 03:51:16,662 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-08 03:51:16,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:16,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676010960] [2022-04-08 03:51:16,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676010960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:16,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:16,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:51:16,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:16,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1635309106] [2022-04-08 03:51:16,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1635309106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:16,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:16,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:51:16,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037779794] [2022-04-08 03:51:16,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:16,663 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-08 03:51:16,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:16,664 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-08 03:51:16,675 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-08 03:51:16,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:51:16,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:16,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:51:16,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:51:16,675 INFO L87 Difference]: Start difference. First operand 107 states and 121 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-08 03:51:17,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:17,387 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2022-04-08 03:51:17,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:51:17,388 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-08 03:51:17,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:17,388 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-08 03:51:17,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-08 03:51:17,389 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-08 03:51:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-08 03:51:17,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 131 transitions. [2022-04-08 03:51:17,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:17,498 INFO L225 Difference]: With dead ends: 117 [2022-04-08 03:51:17,498 INFO L226 Difference]: Without dead ends: 113 [2022-04-08 03:51:17,499 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-04-08 03:51:17,499 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 79 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:17,499 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 188 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:51:17,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-08 03:51:17,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-04-08 03:51:17,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:17,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 108 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:17,689 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 108 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:17,689 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 108 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:17,700 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2022-04-08 03:51:17,700 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2022-04-08 03:51:17,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:17,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:17,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 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 113 states. [2022-04-08 03:51:17,702 INFO L87 Difference]: Start difference. First operand has 108 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 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 113 states. [2022-04-08 03:51:17,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:17,704 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2022-04-08 03:51:17,704 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2022-04-08 03:51:17,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:17,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:17,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:17,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.2395833333333333) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2022-04-08 03:51:17,708 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 18 [2022-04-08 03:51:17,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:17,708 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2022-04-08 03:51:17,708 INFO L479 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-08 03:51:17,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 122 transitions. [2022-04-08 03:51:17,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:17,823 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2022-04-08 03:51:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 03:51:17,823 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:17,823 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:17,823 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 03:51:17,824 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:17,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash 362183168, now seen corresponding path program 1 times [2022-04-08 03:51:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:17,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [186284724] [2022-04-08 03:51:17,825 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash 362183168, now seen corresponding path program 2 times [2022-04-08 03:51:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:17,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098131402] [2022-04-08 03:51:17,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:17,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:17,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:17,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {6519#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {6510#true} is VALID [2022-04-08 03:51:17,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {6510#true} assume true; {6510#true} is VALID [2022-04-08 03:51:17,944 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6510#true} {6510#true} #398#return; {6510#true} is VALID [2022-04-08 03:51:17,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {6510#true} call ULTIMATE.init(); {6519#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:17,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {6519#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {6510#true} is VALID [2022-04-08 03:51:17,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {6510#true} assume true; {6510#true} is VALID [2022-04-08 03:51:17,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6510#true} {6510#true} #398#return; {6510#true} is VALID [2022-04-08 03:51:17,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {6510#true} call #t~ret18 := main(); {6510#true} is VALID [2022-04-08 03:51:17,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {6510#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {6510#true} is VALID [2022-04-08 03:51:17,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {6510#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6515#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-08 03:51:17,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {6515#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {6516#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:17,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {6516#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6516#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:17,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {6516#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6516#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:17,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {6516#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {6517#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:17,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {6517#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {6517#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:17,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {6517#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {6517#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:17,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {6517#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {6517#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:17,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {6517#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_4~0); {6517#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:17,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {6517#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} havoc ~__tmp_11~0;~__tmp_11~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {6517#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-08 03:51:17,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {6517#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {6518#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-08 03:51:17,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {6518#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {6511#false} is VALID [2022-04-08 03:51:17,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {6511#false} assume !false; {6511#false} is VALID [2022-04-08 03:51:17,954 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-08 03:51:17,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:17,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098131402] [2022-04-08 03:51:17,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098131402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:17,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:17,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:51:17,954 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:17,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [186284724] [2022-04-08 03:51:17,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [186284724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:17,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:17,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:51:17,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141652316] [2022-04-08 03:51:17,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:17,955 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-08 03:51:17,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:17,956 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-08 03:51:17,967 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-08 03:51:17,967 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:51:17,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:17,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:51:17,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:51:17,968 INFO L87 Difference]: Start difference. First operand 108 states and 122 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-08 03:51:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:18,689 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2022-04-08 03:51:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:51:18,689 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-08 03:51:18,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:18,690 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-08 03:51:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2022-04-08 03:51:18,691 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-08 03:51:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2022-04-08 03:51:18,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 151 transitions. [2022-04-08 03:51:18,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:18,796 INFO L225 Difference]: With dead ends: 135 [2022-04-08 03:51:18,797 INFO L226 Difference]: Without dead ends: 133 [2022-04-08 03:51:18,797 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-04-08 03:51:18,797 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 95 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:18,797 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 242 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:51:18,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-08 03:51:18,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2022-04-08 03:51:18,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:18,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 111 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 107 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:18,920 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 111 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 107 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:18,921 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 111 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 107 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:18,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:18,923 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2022-04-08 03:51:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2022-04-08 03:51:18,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:18,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:18,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 107 states have internal predecessors, (122), 2 states have call successors, (2), 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 133 states. [2022-04-08 03:51:18,924 INFO L87 Difference]: Start difference. First operand has 111 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 107 states have internal predecessors, (122), 2 states have call successors, (2), 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 133 states. [2022-04-08 03:51:18,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:18,925 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2022-04-08 03:51:18,925 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2022-04-08 03:51:18,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:18,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:18,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:18,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 107 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-04-08 03:51:18,927 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 19 [2022-04-08 03:51:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:18,927 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-04-08 03:51:18,928 INFO L479 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-08 03:51:18,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 125 transitions. [2022-04-08 03:51:19,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-08 03:51:19,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 03:51:19,057 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:19,058 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:19,058 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 03:51:19,058 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:19,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1325574371, now seen corresponding path program 1 times [2022-04-08 03:51:19,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:19,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1628533263] [2022-04-08 03:51:19,059 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:19,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1325574371, now seen corresponding path program 2 times [2022-04-08 03:51:19,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:19,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300651227] [2022-04-08 03:51:19,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:19,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:19,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:19,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {7295#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {7288#true} is VALID [2022-04-08 03:51:19,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {7288#true} assume true; {7288#true} is VALID [2022-04-08 03:51:19,131 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7288#true} {7288#true} #398#return; {7288#true} is VALID [2022-04-08 03:51:19,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {7288#true} call ULTIMATE.init(); {7295#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:19,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {7295#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {7288#true} is VALID [2022-04-08 03:51:19,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {7288#true} assume true; {7288#true} is VALID [2022-04-08 03:51:19,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7288#true} {7288#true} #398#return; {7288#true} is VALID [2022-04-08 03:51:19,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {7288#true} call #t~ret18 := main(); {7288#true} is VALID [2022-04-08 03:51:19,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {7288#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {7288#true} is VALID [2022-04-08 03:51:19,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {7288#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {7293#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:19,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {7293#(<= 0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {7293#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:19,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {7293#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7293#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:19,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {7293#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7293#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:19,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {7293#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {7293#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:19,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {7293#(<= 0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {7293#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:19,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {7293#(<= 0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {7293#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:19,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {7293#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {7293#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:19,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {7293#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7293#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:19,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {7293#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7293#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:19,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {7293#(<= 0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {7293#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:19,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {7293#(<= 0 main_~main__tagbuf_len~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7294#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-08 03:51:19,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {7294#(not (= main_~__VERIFIER_assert__cond~8 0))} assume 0 == ~__VERIFIER_assert__cond~8; {7289#false} is VALID [2022-04-08 03:51:19,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {7289#false} assume !false; {7289#false} is VALID [2022-04-08 03:51:19,139 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-08 03:51:19,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:19,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300651227] [2022-04-08 03:51:19,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300651227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:19,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:19,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:51:19,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:19,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1628533263] [2022-04-08 03:51:19,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1628533263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:19,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:19,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:51:19,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125363662] [2022-04-08 03:51:19,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:19,140 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-08 03:51:19,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:19,141 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-08 03:51:19,152 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-08 03:51:19,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:51:19,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:19,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:51:19,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:51:19,153 INFO L87 Difference]: Start difference. First operand 111 states and 125 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-08 03:51:19,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:19,581 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-08 03:51:19,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:51:19,582 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-08 03:51:19,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:19,582 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-08 03:51:19,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-04-08 03:51:19,583 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-08 03:51:19,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-04-08 03:51:19,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 113 transitions. [2022-04-08 03:51:19,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:19,670 INFO L225 Difference]: With dead ends: 111 [2022-04-08 03:51:19,670 INFO L226 Difference]: Without dead ends: 109 [2022-04-08 03:51:19,670 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:51:19,670 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 152 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:19,671 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 115 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:51:19,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-08 03:51:19,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-08 03:51:19,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:19,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 109 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:19,805 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 109 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:19,805 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 109 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:19,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:19,808 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-04-08 03:51:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-04-08 03:51:19,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:19,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:19,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 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-08 03:51:19,809 INFO L87 Difference]: Start difference. First operand has 109 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 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-08 03:51:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:19,810 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-04-08 03:51:19,810 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-04-08 03:51:19,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:19,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:19,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:19,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:19,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 105 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:19,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2022-04-08 03:51:19,815 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 20 [2022-04-08 03:51:19,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:19,815 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2022-04-08 03:51:19,816 INFO L479 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-08 03:51:19,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 123 transitions. [2022-04-08 03:51:19,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-04-08 03:51:19,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 03:51:19,923 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:19,923 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:19,923 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 03:51:19,924 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:19,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:19,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1856864327, now seen corresponding path program 1 times [2022-04-08 03:51:19,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:19,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1797869097] [2022-04-08 03:51:19,924 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:19,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1856864327, now seen corresponding path program 2 times [2022-04-08 03:51:19,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:19,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968774842] [2022-04-08 03:51:19,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:19,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:19,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:20,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {7967#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {7960#true} is VALID [2022-04-08 03:51:20,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {7960#true} assume true; {7960#true} is VALID [2022-04-08 03:51:20,001 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7960#true} {7960#true} #398#return; {7960#true} is VALID [2022-04-08 03:51:20,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {7960#true} call ULTIMATE.init(); {7967#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:20,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {7967#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {7960#true} is VALID [2022-04-08 03:51:20,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {7960#true} assume true; {7960#true} is VALID [2022-04-08 03:51:20,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7960#true} {7960#true} #398#return; {7960#true} is VALID [2022-04-08 03:51:20,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {7960#true} call #t~ret18 := main(); {7960#true} is VALID [2022-04-08 03:51:20,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {7960#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {7960#true} is VALID [2022-04-08 03:51:20,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {7960#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {7960#true} is VALID [2022-04-08 03:51:20,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {7960#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {7960#true} is VALID [2022-04-08 03:51:20,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {7960#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7960#true} is VALID [2022-04-08 03:51:20,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {7960#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7960#true} is VALID [2022-04-08 03:51:20,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {7960#true} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {7960#true} is VALID [2022-04-08 03:51:20,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {7960#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {7960#true} is VALID [2022-04-08 03:51:20,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {7960#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {7960#true} is VALID [2022-04-08 03:51:20,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {7960#true} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {7960#true} is VALID [2022-04-08 03:51:20,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {7960#true} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7960#true} is VALID [2022-04-08 03:51:20,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {7960#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7960#true} is VALID [2022-04-08 03:51:20,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {7960#true} assume !(0 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {7960#true} is VALID [2022-04-08 03:51:20,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {7960#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_9~0;~__tmp_9~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7965#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:20,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {7965#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7966#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-08 03:51:20,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {7966#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {7961#false} is VALID [2022-04-08 03:51:20,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {7961#false} assume !false; {7961#false} is VALID [2022-04-08 03:51:20,004 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-08 03:51:20,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:20,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968774842] [2022-04-08 03:51:20,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968774842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:20,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:20,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:51:20,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:20,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1797869097] [2022-04-08 03:51:20,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1797869097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:20,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:20,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:51:20,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378029175] [2022-04-08 03:51:20,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:20,006 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-08 03:51:20,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:20,006 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-08 03:51:20,018 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-08 03:51:20,018 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:51:20,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:20,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:51:20,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:51:20,019 INFO L87 Difference]: Start difference. First operand 109 states and 123 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-08 03:51:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:20,512 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-04-08 03:51:20,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:51:20,513 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-08 03:51:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:20,513 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-08 03:51:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-04-08 03:51:20,514 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-08 03:51:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-04-08 03:51:20,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 111 transitions. [2022-04-08 03:51:20,609 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-08 03:51:20,610 INFO L225 Difference]: With dead ends: 109 [2022-04-08 03:51:20,610 INFO L226 Difference]: Without dead ends: 105 [2022-04-08 03:51:20,610 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:51:20,611 INFO L913 BasicCegarLoop]: 101 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:20,611 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 171 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:51:20,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-08 03:51:20,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-04-08 03:51:20,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:20,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 101 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:20,720 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 101 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:20,720 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 101 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:20,721 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2022-04-08 03:51:20,722 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-04-08 03:51:20,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:20,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:20,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 101 states have internal predecessors, (116), 2 states have call successors, (2), 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 105 states. [2022-04-08 03:51:20,722 INFO L87 Difference]: Start difference. First operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 101 states have internal predecessors, (116), 2 states have call successors, (2), 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 105 states. [2022-04-08 03:51:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:20,723 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2022-04-08 03:51:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-04-08 03:51:20,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:20,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:20,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:20,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:20,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 101 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-04-08 03:51:20,725 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 21 [2022-04-08 03:51:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:20,725 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-04-08 03:51:20,725 INFO L479 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-08 03:51:20,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 119 transitions. [2022-04-08 03:51:20,804 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-08 03:51:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-04-08 03:51:20,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 03:51:20,805 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:20,805 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:20,805 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 03:51:20,805 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:20,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:20,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1714979017, now seen corresponding path program 1 times [2022-04-08 03:51:20,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:20,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105898381] [2022-04-08 03:51:20,806 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:20,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1714979017, now seen corresponding path program 2 times [2022-04-08 03:51:20,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:20,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098270747] [2022-04-08 03:51:20,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:20,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:20,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:20,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {8622#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {8613#true} is VALID [2022-04-08 03:51:20,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {8613#true} assume true; {8613#true} is VALID [2022-04-08 03:51:20,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8613#true} {8613#true} #398#return; {8613#true} is VALID [2022-04-08 03:51:20,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {8613#true} call ULTIMATE.init(); {8622#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:20,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {8622#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {8613#true} is VALID [2022-04-08 03:51:20,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {8613#true} assume true; {8613#true} is VALID [2022-04-08 03:51:20,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8613#true} {8613#true} #398#return; {8613#true} is VALID [2022-04-08 03:51:20,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {8613#true} call #t~ret18 := main(); {8613#true} is VALID [2022-04-08 03:51:20,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {8613#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {8613#true} is VALID [2022-04-08 03:51:20,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {8613#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {8613#true} is VALID [2022-04-08 03:51:20,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {8613#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {8613#true} is VALID [2022-04-08 03:51:20,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {8613#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8613#true} is VALID [2022-04-08 03:51:20,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {8613#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8613#true} is VALID [2022-04-08 03:51:20,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {8613#true} assume !(0 == ~__VERIFIER_assert__cond~3);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~0; {8613#true} is VALID [2022-04-08 03:51:20,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {8613#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {8613#true} is VALID [2022-04-08 03:51:20,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {8613#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {8618#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 03:51:20,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {8618#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {8618#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 03:51:20,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {8618#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {8618#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 03:51:20,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {8618#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {8619#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~7 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} is VALID [2022-04-08 03:51:20,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {8619#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~7 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} assume !(0 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8620#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:20,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {8620#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {8620#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:20,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {8620#(<= main_~main__t~0 main_~main__tagbuf_len~0)} havoc ~__tmp_11~0;~__tmp_11~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8620#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:20,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {8620#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {8621#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-08 03:51:20,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {8621#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {8614#false} is VALID [2022-04-08 03:51:20,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {8614#false} assume !false; {8614#false} is VALID [2022-04-08 03:51:20,911 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-08 03:51:20,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:20,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098270747] [2022-04-08 03:51:20,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098270747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:20,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:20,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:51:20,912 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:20,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105898381] [2022-04-08 03:51:20,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105898381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:20,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:20,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:51:20,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21548513] [2022-04-08 03:51:20,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:20,913 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-08 03:51:20,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:20,913 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-08 03:51:20,921 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-08 03:51:20,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:51:20,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:20,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:51:20,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:51:20,922 INFO L87 Difference]: Start difference. First operand 105 states and 119 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-08 03:51:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:21,684 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2022-04-08 03:51:21,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:51:21,685 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-08 03:51:21,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:21,685 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-08 03:51:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2022-04-08 03:51:21,686 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-08 03:51:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2022-04-08 03:51:21,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 125 transitions. [2022-04-08 03:51:21,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:21,784 INFO L225 Difference]: With dead ends: 121 [2022-04-08 03:51:21,784 INFO L226 Difference]: Without dead ends: 119 [2022-04-08 03:51:21,784 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-08 03:51:21,785 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:21,785 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 72 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:51:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-08 03:51:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2022-04-08 03:51:21,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:21,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 100 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:21,961 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 100 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:21,962 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 100 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:21,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:21,963 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-04-08 03:51:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2022-04-08 03:51:21,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:21,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:21,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 2 states have call successors, (2), 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 119 states. [2022-04-08 03:51:21,964 INFO L87 Difference]: Start difference. First operand has 100 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 2 states have call successors, (2), 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 119 states. [2022-04-08 03:51:21,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:21,965 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-04-08 03:51:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2022-04-08 03:51:21,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:21,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:21,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:21,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-04-08 03:51:21,967 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 22 [2022-04-08 03:51:21,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:21,967 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-04-08 03:51:21,967 INFO L479 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-08 03:51:21,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 114 transitions. [2022-04-08 03:51:22,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:22,077 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-04-08 03:51:22,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 03:51:22,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:22,077 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:22,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 03:51:22,077 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:22,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:22,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1738536758, now seen corresponding path program 1 times [2022-04-08 03:51:22,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:22,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1691651394] [2022-04-08 03:51:22,078 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:22,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1738536758, now seen corresponding path program 2 times [2022-04-08 03:51:22,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:22,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097321285] [2022-04-08 03:51:22,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:22,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:22,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:22,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {9327#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {9318#true} is VALID [2022-04-08 03:51:22,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {9318#true} assume true; {9318#true} is VALID [2022-04-08 03:51:22,174 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9318#true} {9318#true} #398#return; {9318#true} is VALID [2022-04-08 03:51:22,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {9318#true} call ULTIMATE.init(); {9327#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:22,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {9327#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {9318#true} is VALID [2022-04-08 03:51:22,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {9318#true} assume true; {9318#true} is VALID [2022-04-08 03:51:22,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9318#true} {9318#true} #398#return; {9318#true} is VALID [2022-04-08 03:51:22,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {9318#true} call #t~ret18 := main(); {9318#true} is VALID [2022-04-08 03:51:22,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {9318#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {9318#true} is VALID [2022-04-08 03:51:22,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {9318#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {9318#true} is VALID [2022-04-08 03:51:22,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {9318#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {9318#true} is VALID [2022-04-08 03:51:22,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {9318#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {9318#true} is VALID [2022-04-08 03:51:22,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {9318#true} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {9318#true} is VALID [2022-04-08 03:51:22,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {9318#true} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9318#true} is VALID [2022-04-08 03:51:22,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {9318#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9323#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 03:51:22,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {9323#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {9323#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 03:51:22,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {9323#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {9324#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~17 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} is VALID [2022-04-08 03:51:22,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {9324#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~17 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} assume !(0 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := 1 + ~main__t~0;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {9325#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:22,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {9325#(<= main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {9325#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:22,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {9325#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {9325#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:22,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {9325#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet7;havoc #t~nondet7; {9325#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:22,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {9325#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_4~0);havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {9325#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:22,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {9325#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {9326#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-08 03:51:22,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {9326#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {9319#false} is VALID [2022-04-08 03:51:22,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {9319#false} assume !false; {9319#false} is VALID [2022-04-08 03:51:22,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-08 03:51:22,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:22,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097321285] [2022-04-08 03:51:22,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097321285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:22,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:22,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:51:22,181 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:22,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1691651394] [2022-04-08 03:51:22,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1691651394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:22,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:22,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:51:22,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256849047] [2022-04-08 03:51:22,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:22,182 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-08 03:51:22,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:22,182 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-08 03:51:22,194 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-08 03:51:22,194 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:51:22,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:22,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:51:22,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:51:22,195 INFO L87 Difference]: Start difference. First operand 100 states and 114 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-08 03:51:22,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:22,836 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2022-04-08 03:51:22,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:51:22,836 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-08 03:51:22,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:22,837 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-08 03:51:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2022-04-08 03:51:22,838 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-08 03:51:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2022-04-08 03:51:22,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 120 transitions. [2022-04-08 03:51:22,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:22,933 INFO L225 Difference]: With dead ends: 113 [2022-04-08 03:51:22,933 INFO L226 Difference]: Without dead ends: 111 [2022-04-08 03:51:22,933 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-08 03:51:22,933 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 249 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:22,934 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 66 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:51:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-08 03:51:23,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2022-04-08 03:51:23,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:23,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 91 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:23,108 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 91 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:23,109 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 91 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:23,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:23,110 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-04-08 03:51:23,110 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2022-04-08 03:51:23,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:23,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:23,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 91 states have internal predecessors, (105), 2 states have call successors, (2), 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-08 03:51:23,111 INFO L87 Difference]: Start difference. First operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 91 states have internal predecessors, (105), 2 states have call successors, (2), 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-08 03:51:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:23,112 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-04-08 03:51:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2022-04-08 03:51:23,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:23,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:23,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:23,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 91 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-04-08 03:51:23,113 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 22 [2022-04-08 03:51:23,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:23,114 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-04-08 03:51:23,114 INFO L479 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-08 03:51:23,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 108 transitions. [2022-04-08 03:51:23,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-04-08 03:51:23,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 03:51:23,219 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:23,219 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:23,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 03:51:23,219 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:23,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:23,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1786252008, now seen corresponding path program 1 times [2022-04-08 03:51:23,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:23,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1535551639] [2022-04-08 03:51:23,220 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1786252008, now seen corresponding path program 2 times [2022-04-08 03:51:23,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:23,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382143380] [2022-04-08 03:51:23,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:23,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:23,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:23,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {9989#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {9980#true} is VALID [2022-04-08 03:51:23,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {9980#true} assume true; {9980#true} is VALID [2022-04-08 03:51:23,299 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9980#true} {9980#true} #398#return; {9980#true} is VALID [2022-04-08 03:51:23,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {9980#true} call ULTIMATE.init(); {9989#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:23,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {9989#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {9980#true} is VALID [2022-04-08 03:51:23,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {9980#true} assume true; {9980#true} is VALID [2022-04-08 03:51:23,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9980#true} {9980#true} #398#return; {9980#true} is VALID [2022-04-08 03:51:23,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {9980#true} call #t~ret18 := main(); {9980#true} is VALID [2022-04-08 03:51:23,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {9980#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {9980#true} is VALID [2022-04-08 03:51:23,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {9980#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {9980#true} is VALID [2022-04-08 03:51:23,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {9980#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {9980#true} is VALID [2022-04-08 03:51:23,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {9980#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {9980#true} is VALID [2022-04-08 03:51:23,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {9980#true} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {9980#true} is VALID [2022-04-08 03:51:23,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {9980#true} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {9980#true} is VALID [2022-04-08 03:51:23,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {9980#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {9985#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 03:51:23,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {9985#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {9985#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 03:51:23,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {9985#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {9986#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~17 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} is VALID [2022-04-08 03:51:23,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {9986#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~17 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} assume !(0 == ~__VERIFIER_assert__cond~17);~main____CPAchecker_TMP_2~1 := ~main__t~0;~main__t~0 := 1 + ~main__t~0;~__tmp_2624_0~0 := ~main____CPAchecker_TMP_0~1;~__tmp_2624_1~0 := ~main____CPAchecker_TMP_2~1; {9987#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:23,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {9987#(<= main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {9987#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:23,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {9987#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {9987#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:23,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {9987#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet8;havoc #t~nondet8; {9987#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:23,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {9987#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_6~0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9987#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:23,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {9987#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9988#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-08 03:51:23,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {9988#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {9981#false} is VALID [2022-04-08 03:51:23,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {9981#false} assume !false; {9981#false} is VALID [2022-04-08 03:51:23,305 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-08 03:51:23,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:23,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382143380] [2022-04-08 03:51:23,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382143380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:23,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:23,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:51:23,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:23,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1535551639] [2022-04-08 03:51:23,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1535551639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:23,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:23,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:51:23,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908199029] [2022-04-08 03:51:23,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:23,306 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-08 03:51:23,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:23,306 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-08 03:51:23,322 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-08 03:51:23,322 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:51:23,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:23,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:51:23,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:51:23,322 INFO L87 Difference]: Start difference. First operand 95 states and 108 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-08 03:51:24,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:24,016 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2022-04-08 03:51:24,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:51:24,016 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-08 03:51:24,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:24,016 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-08 03:51:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-04-08 03:51:24,017 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-08 03:51:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-04-08 03:51:24,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 103 transitions. [2022-04-08 03:51:24,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:24,099 INFO L225 Difference]: With dead ends: 95 [2022-04-08 03:51:24,099 INFO L226 Difference]: Without dead ends: 58 [2022-04-08 03:51:24,099 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-08 03:51:24,100 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 173 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:24,100 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 61 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:51:24,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-08 03:51:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-08 03:51:24,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:24,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 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-08 03:51:24,193 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 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-08 03:51:24,193 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 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-08 03:51:24,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:24,194 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-08 03:51:24,194 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-08 03:51:24,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:24,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:24,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 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 58 states. [2022-04-08 03:51:24,194 INFO L87 Difference]: Start difference. First operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 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 58 states. [2022-04-08 03:51:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:24,195 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-08 03:51:24,195 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-08 03:51:24,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:24,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:24,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:24,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 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-08 03:51:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-04-08 03:51:24,196 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 22 [2022-04-08 03:51:24,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:24,196 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-04-08 03:51:24,196 INFO L479 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-08 03:51:24,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 58 transitions. [2022-04-08 03:51:24,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:24,246 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-08 03:51:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 03:51:24,246 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:24,246 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:24,246 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 03:51:24,247 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:24,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:24,247 INFO L85 PathProgramCache]: Analyzing trace with hash -563432656, now seen corresponding path program 1 times [2022-04-08 03:51:24,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:24,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1690914822] [2022-04-08 03:51:24,247 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:24,247 INFO L85 PathProgramCache]: Analyzing trace with hash -563432656, now seen corresponding path program 2 times [2022-04-08 03:51:24,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:24,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814199765] [2022-04-08 03:51:24,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:24,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:24,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:24,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {10440#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {10424#true} is VALID [2022-04-08 03:51:24,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-08 03:51:24,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10424#true} {10424#true} #398#return; {10424#true} is VALID [2022-04-08 03:51:24,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {10424#true} call ULTIMATE.init(); {10440#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:24,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {10440#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {10424#true} is VALID [2022-04-08 03:51:24,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-08 03:51:24,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10424#true} {10424#true} #398#return; {10424#true} is VALID [2022-04-08 03:51:24,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {10424#true} call #t~ret18 := main(); {10424#true} is VALID [2022-04-08 03:51:24,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {10424#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {10424#true} is VALID [2022-04-08 03:51:24,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {10424#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {10429#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:24,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {10429#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {10429#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:24,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {10429#(= main_~main__t~0 0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {10429#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:24,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {10429#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {10429#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:24,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {10429#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {10430#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:24,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {10430#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {10430#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:24,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {10430#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {10430#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:24,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {10430#(<= 1 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {10430#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:24,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {10430#(<= 1 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {10431#(<= 2 main_~main__t~0)} is VALID [2022-04-08 03:51:24,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {10431#(<= 2 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_0~2 := #t~nondet10;havoc #t~nondet10; {10431#(<= 2 main_~main__t~0)} is VALID [2022-04-08 03:51:24,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {10431#(<= 2 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {10431#(<= 2 main_~main__t~0)} is VALID [2022-04-08 03:51:24,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {10431#(<= 2 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {10431#(<= 2 main_~main__t~0)} is VALID [2022-04-08 03:51:24,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {10431#(<= 2 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {10432#(<= 3 main_~main__t~0)} is VALID [2022-04-08 03:51:24,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {10432#(<= 3 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~main____CPAchecker_TMP_0~3 := #t~nondet11;havoc #t~nondet11; {10432#(<= 3 main_~main__t~0)} is VALID [2022-04-08 03:51:24,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {10432#(<= 3 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {10432#(<= 3 main_~main__t~0)} is VALID [2022-04-08 03:51:24,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {10432#(<= 3 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {10432#(<= 3 main_~main__t~0)} is VALID [2022-04-08 03:51:24,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {10432#(<= 3 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {10433#(<= 4 main_~main__t~0)} is VALID [2022-04-08 03:51:24,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {10433#(<= 4 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~main____CPAchecker_TMP_0~4 := #t~nondet12;havoc #t~nondet12; {10433#(<= 4 main_~main__t~0)} is VALID [2022-04-08 03:51:24,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {10433#(<= 4 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_31~0;~__tmp_31~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~30;~__VERIFIER_assert__cond~30 := ~__tmp_31~0; {10433#(<= 4 main_~main__t~0)} is VALID [2022-04-08 03:51:24,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {10433#(<= 4 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~30);havoc ~__tmp_32~0;~__tmp_32~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~31;~__VERIFIER_assert__cond~31 := ~__tmp_32~0; {10433#(<= 4 main_~main__t~0)} is VALID [2022-04-08 03:51:24,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {10433#(<= 4 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~31);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {10434#(<= 5 main_~main__t~0)} is VALID [2022-04-08 03:51:24,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {10434#(<= 5 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~main____CPAchecker_TMP_0~5 := #t~nondet13;havoc #t~nondet13; {10434#(<= 5 main_~main__t~0)} is VALID [2022-04-08 03:51:24,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {10434#(<= 5 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_35~0;~__tmp_35~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {10434#(<= 5 main_~main__t~0)} is VALID [2022-04-08 03:51:24,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {10434#(<= 5 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {10434#(<= 5 main_~main__t~0)} is VALID [2022-04-08 03:51:24,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {10434#(<= 5 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {10435#(<= 6 main_~main__t~0)} is VALID [2022-04-08 03:51:24,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {10435#(<= 6 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~main____CPAchecker_TMP_0~6 := #t~nondet14;havoc #t~nondet14; {10435#(<= 6 main_~main__t~0)} is VALID [2022-04-08 03:51:24,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {10435#(<= 6 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~6);havoc ~__tmp_39~0;~__tmp_39~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {10435#(<= 6 main_~main__t~0)} is VALID [2022-04-08 03:51:24,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {10435#(<= 6 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {10435#(<= 6 main_~main__t~0)} is VALID [2022-04-08 03:51:24,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {10435#(<= 6 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {10436#(<= 7 main_~main__t~0)} is VALID [2022-04-08 03:51:24,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {10436#(<= 7 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~main____CPAchecker_TMP_0~7 := #t~nondet15;havoc #t~nondet15; {10436#(<= 7 main_~main__t~0)} is VALID [2022-04-08 03:51:24,419 INFO L290 TraceCheckUtils]: 36: Hoare triple {10436#(<= 7 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~7);havoc ~__tmp_43~0;~__tmp_43~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {10436#(<= 7 main_~main__t~0)} is VALID [2022-04-08 03:51:24,419 INFO L290 TraceCheckUtils]: 37: Hoare triple {10436#(<= 7 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {10436#(<= 7 main_~main__t~0)} is VALID [2022-04-08 03:51:24,420 INFO L290 TraceCheckUtils]: 38: Hoare triple {10436#(<= 7 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {10437#(<= 8 main_~main__t~0)} is VALID [2022-04-08 03:51:24,420 INFO L290 TraceCheckUtils]: 39: Hoare triple {10437#(<= 8 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~8;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~main____CPAchecker_TMP_0~8 := #t~nondet16;havoc #t~nondet16; {10437#(<= 8 main_~main__t~0)} is VALID [2022-04-08 03:51:24,420 INFO L290 TraceCheckUtils]: 40: Hoare triple {10437#(<= 8 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~8);havoc ~__tmp_47~0;~__tmp_47~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {10437#(<= 8 main_~main__t~0)} is VALID [2022-04-08 03:51:24,421 INFO L290 TraceCheckUtils]: 41: Hoare triple {10437#(<= 8 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {10437#(<= 8 main_~main__t~0)} is VALID [2022-04-08 03:51:24,421 INFO L290 TraceCheckUtils]: 42: Hoare triple {10437#(<= 8 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~8 := ~main__t~0;~main__t~0 := 1 + ~main__t~0;~__tmp_3137_0~0 := ~main____CPAchecker_TMP_1~8;~__tmp_3137_1~0 := ~main____CPAchecker_TMP_0~8; {10438#(<= 9 main_~main__t~0)} is VALID [2022-04-08 03:51:24,421 INFO L290 TraceCheckUtils]: 43: Hoare triple {10438#(<= 9 main_~main__t~0)} ~main____CPAchecker_TMP_1~8 := ~__tmp_3137_0~0;~main____CPAchecker_TMP_0~8 := ~__tmp_3137_1~0; {10438#(<= 9 main_~main__t~0)} is VALID [2022-04-08 03:51:24,422 INFO L290 TraceCheckUtils]: 44: Hoare triple {10438#(<= 9 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~9;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~main____CPAchecker_TMP_0~9 := #t~nondet17;havoc #t~nondet17; {10438#(<= 9 main_~main__t~0)} is VALID [2022-04-08 03:51:24,422 INFO L290 TraceCheckUtils]: 45: Hoare triple {10438#(<= 9 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~9);havoc ~__tmp_51~0;~__tmp_51~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {10439#(not (= main_~__VERIFIER_assert__cond~50 0))} is VALID [2022-04-08 03:51:24,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {10439#(not (= main_~__VERIFIER_assert__cond~50 0))} assume 0 == ~__VERIFIER_assert__cond~50; {10425#false} is VALID [2022-04-08 03:51:24,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {10425#false} assume !false; {10425#false} is VALID [2022-04-08 03:51:24,423 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-08 03:51:24,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:24,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814199765] [2022-04-08 03:51:24,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814199765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:24,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:24,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 03:51:24,425 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:24,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1690914822] [2022-04-08 03:51:24,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1690914822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:24,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:24,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 03:51:24,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049205981] [2022-04-08 03:51:24,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:24,426 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, (2), 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 48 [2022-04-08 03:51:24,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:24,426 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:24,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:24,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 03:51:24,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:24,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 03:51:24,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:51:24,454 INFO L87 Difference]: Start difference. First operand 58 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:25,059 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-08 03:51:25,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 03:51:25,059 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, (2), 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 48 [2022-04-08 03:51:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:25,059 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 67 transitions. [2022-04-08 03:51:25,060 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 67 transitions. [2022-04-08 03:51:25,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 67 transitions. [2022-04-08 03:51:25,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:25,104 INFO L225 Difference]: With dead ends: 67 [2022-04-08 03:51:25,104 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 03:51:25,105 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-04-08 03:51:25,105 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 115 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:25,106 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 58 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 03:51:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 03:51:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2022-04-08 03:51:25,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:25,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 56 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:25,189 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 56 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:25,189 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 56 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:25,189 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-08 03:51:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-08 03:51:25,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:25,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:25,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-08 03:51:25,190 INFO L87 Difference]: Start difference. First operand has 56 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-08 03:51:25,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:25,191 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-08 03:51:25,191 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-08 03:51:25,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:25,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:25,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:25,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-04-08 03:51:25,192 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2022-04-08 03:51:25,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:25,192 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-04-08 03:51:25,192 INFO L479 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:25,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 56 transitions. [2022-04-08 03:51:25,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:25,263 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-08 03:51:25,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 03:51:25,263 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:25,263 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:25,264 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 03:51:25,264 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:25,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:25,264 INFO L85 PathProgramCache]: Analyzing trace with hash -563446558, now seen corresponding path program 1 times [2022-04-08 03:51:25,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:25,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1282990410] [2022-04-08 03:51:25,264 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:25,264 INFO L85 PathProgramCache]: Analyzing trace with hash -563446558, now seen corresponding path program 2 times [2022-04-08 03:51:25,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:25,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996814677] [2022-04-08 03:51:25,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:25,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:25,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:25,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {10855#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {10839#true} is VALID [2022-04-08 03:51:25,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {10839#true} assume true; {10839#true} is VALID [2022-04-08 03:51:25,443 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10839#true} {10839#true} #398#return; {10839#true} is VALID [2022-04-08 03:51:25,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {10839#true} call ULTIMATE.init(); {10855#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:25,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {10855#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {10839#true} is VALID [2022-04-08 03:51:25,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {10839#true} assume true; {10839#true} is VALID [2022-04-08 03:51:25,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10839#true} {10839#true} #398#return; {10839#true} is VALID [2022-04-08 03:51:25,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {10839#true} call #t~ret18 := main(); {10839#true} is VALID [2022-04-08 03:51:25,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {10839#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {10839#true} is VALID [2022-04-08 03:51:25,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {10839#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {10844#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:25,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {10844#(= main_~main__t~0 0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {10844#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:25,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {10844#(= main_~main__t~0 0)} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {10844#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:25,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {10844#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {10844#(= main_~main__t~0 0)} is VALID [2022-04-08 03:51:25,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {10844#(= main_~main__t~0 0)} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {10845#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:25,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {10845#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {10845#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:25,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {10845#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {10845#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:25,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {10845#(<= 1 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {10845#(<= 1 main_~main__t~0)} is VALID [2022-04-08 03:51:25,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {10845#(<= 1 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {10846#(<= 2 main_~main__t~0)} is VALID [2022-04-08 03:51:25,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {10846#(<= 2 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_0~2 := #t~nondet10;havoc #t~nondet10; {10846#(<= 2 main_~main__t~0)} is VALID [2022-04-08 03:51:25,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {10846#(<= 2 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {10846#(<= 2 main_~main__t~0)} is VALID [2022-04-08 03:51:25,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {10846#(<= 2 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {10846#(<= 2 main_~main__t~0)} is VALID [2022-04-08 03:51:25,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {10846#(<= 2 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {10847#(<= 3 main_~main__t~0)} is VALID [2022-04-08 03:51:25,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {10847#(<= 3 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~main____CPAchecker_TMP_0~3 := #t~nondet11;havoc #t~nondet11; {10847#(<= 3 main_~main__t~0)} is VALID [2022-04-08 03:51:25,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {10847#(<= 3 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {10847#(<= 3 main_~main__t~0)} is VALID [2022-04-08 03:51:25,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {10847#(<= 3 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {10847#(<= 3 main_~main__t~0)} is VALID [2022-04-08 03:51:25,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {10847#(<= 3 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {10848#(<= 4 main_~main__t~0)} is VALID [2022-04-08 03:51:25,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {10848#(<= 4 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~main____CPAchecker_TMP_0~4 := #t~nondet12;havoc #t~nondet12; {10848#(<= 4 main_~main__t~0)} is VALID [2022-04-08 03:51:25,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {10848#(<= 4 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_31~0;~__tmp_31~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~30;~__VERIFIER_assert__cond~30 := ~__tmp_31~0; {10848#(<= 4 main_~main__t~0)} is VALID [2022-04-08 03:51:25,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {10848#(<= 4 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~30);havoc ~__tmp_32~0;~__tmp_32~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~31;~__VERIFIER_assert__cond~31 := ~__tmp_32~0; {10848#(<= 4 main_~main__t~0)} is VALID [2022-04-08 03:51:25,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {10848#(<= 4 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~31);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {10849#(<= 5 main_~main__t~0)} is VALID [2022-04-08 03:51:25,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {10849#(<= 5 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~main____CPAchecker_TMP_0~5 := #t~nondet13;havoc #t~nondet13; {10849#(<= 5 main_~main__t~0)} is VALID [2022-04-08 03:51:25,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {10849#(<= 5 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_35~0;~__tmp_35~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {10849#(<= 5 main_~main__t~0)} is VALID [2022-04-08 03:51:25,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {10849#(<= 5 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {10849#(<= 5 main_~main__t~0)} is VALID [2022-04-08 03:51:25,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {10849#(<= 5 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {10850#(<= 6 main_~main__t~0)} is VALID [2022-04-08 03:51:25,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {10850#(<= 6 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~main____CPAchecker_TMP_0~6 := #t~nondet14;havoc #t~nondet14; {10850#(<= 6 main_~main__t~0)} is VALID [2022-04-08 03:51:25,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {10850#(<= 6 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~6);havoc ~__tmp_39~0;~__tmp_39~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {10850#(<= 6 main_~main__t~0)} is VALID [2022-04-08 03:51:25,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {10850#(<= 6 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {10850#(<= 6 main_~main__t~0)} is VALID [2022-04-08 03:51:25,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {10850#(<= 6 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {10851#(<= 7 main_~main__t~0)} is VALID [2022-04-08 03:51:25,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {10851#(<= 7 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~main____CPAchecker_TMP_0~7 := #t~nondet15;havoc #t~nondet15; {10851#(<= 7 main_~main__t~0)} is VALID [2022-04-08 03:51:25,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {10851#(<= 7 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~7);havoc ~__tmp_43~0;~__tmp_43~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {10851#(<= 7 main_~main__t~0)} is VALID [2022-04-08 03:51:25,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {10851#(<= 7 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {10851#(<= 7 main_~main__t~0)} is VALID [2022-04-08 03:51:25,475 INFO L290 TraceCheckUtils]: 38: Hoare triple {10851#(<= 7 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {10852#(<= 8 main_~main__t~0)} is VALID [2022-04-08 03:51:25,475 INFO L290 TraceCheckUtils]: 39: Hoare triple {10852#(<= 8 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~8;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~main____CPAchecker_TMP_0~8 := #t~nondet16;havoc #t~nondet16; {10852#(<= 8 main_~main__t~0)} is VALID [2022-04-08 03:51:25,475 INFO L290 TraceCheckUtils]: 40: Hoare triple {10852#(<= 8 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~8);havoc ~__tmp_47~0;~__tmp_47~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {10852#(<= 8 main_~main__t~0)} is VALID [2022-04-08 03:51:25,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {10852#(<= 8 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {10852#(<= 8 main_~main__t~0)} is VALID [2022-04-08 03:51:25,476 INFO L290 TraceCheckUtils]: 42: Hoare triple {10852#(<= 8 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~8 := ~main__t~0;~main__t~0 := 1 + ~main__t~0;~__tmp_3137_0~0 := ~main____CPAchecker_TMP_1~8;~__tmp_3137_1~0 := ~main____CPAchecker_TMP_0~8; {10853#(<= 9 main_~main__t~0)} is VALID [2022-04-08 03:51:25,476 INFO L290 TraceCheckUtils]: 43: Hoare triple {10853#(<= 9 main_~main__t~0)} ~main____CPAchecker_TMP_1~8 := ~__tmp_3137_0~0;~main____CPAchecker_TMP_0~8 := ~__tmp_3137_1~0; {10853#(<= 9 main_~main__t~0)} is VALID [2022-04-08 03:51:25,476 INFO L290 TraceCheckUtils]: 44: Hoare triple {10853#(<= 9 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~9;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~main____CPAchecker_TMP_0~9 := #t~nondet17;havoc #t~nondet17; {10853#(<= 9 main_~main__t~0)} is VALID [2022-04-08 03:51:25,476 INFO L290 TraceCheckUtils]: 45: Hoare triple {10853#(<= 9 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~9);havoc ~__tmp_49~0;~__tmp_49~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~48;~__VERIFIER_assert__cond~48 := ~__tmp_49~0; {10854#(not (= main_~__VERIFIER_assert__cond~48 0))} is VALID [2022-04-08 03:51:25,477 INFO L290 TraceCheckUtils]: 46: Hoare triple {10854#(not (= main_~__VERIFIER_assert__cond~48 0))} assume 0 == ~__VERIFIER_assert__cond~48; {10840#false} is VALID [2022-04-08 03:51:25,477 INFO L290 TraceCheckUtils]: 47: Hoare triple {10840#false} assume !false; {10840#false} is VALID [2022-04-08 03:51:25,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-08 03:51:25,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:25,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996814677] [2022-04-08 03:51:25,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996814677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:25,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:25,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 03:51:25,477 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:25,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1282990410] [2022-04-08 03:51:25,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1282990410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:25,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:25,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 03:51:25,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299762853] [2022-04-08 03:51:25,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:25,478 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, (2), 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 48 [2022-04-08 03:51:25,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:25,478 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:25,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:25,499 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 03:51:25,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:25,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 03:51:25,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-04-08 03:51:25,499 INFO L87 Difference]: Start difference. First operand 56 states and 56 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:25,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:25,880 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-08 03:51:25,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 03:51:25,880 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, (2), 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 48 [2022-04-08 03:51:25,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:25,881 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:25,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-08 03:51:25,881 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-08 03:51:25,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2022-04-08 03:51:25,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:25,943 INFO L225 Difference]: With dead ends: 56 [2022-04-08 03:51:25,943 INFO L226 Difference]: Without dead ends: 54 [2022-04-08 03:51:25,944 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-04-08 03:51:25,944 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 105 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:25,945 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 42 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:51:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-08 03:51:26,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-08 03:51:26,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:26,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:26,027 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:26,027 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:26,027 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-08 03:51:26,028 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-08 03:51:26,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:26,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:26,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 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-08 03:51:26,029 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 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-08 03:51:26,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:26,030 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-08 03:51:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-08 03:51:26,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:26,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:26,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:26,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:26,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-04-08 03:51:26,031 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2022-04-08 03:51:26,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:26,031 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-04-08 03:51:26,031 INFO L479 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:26,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 54 transitions. [2022-04-08 03:51:26,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:26,083 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-08 03:51:26,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 03:51:26,084 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:26,084 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:26,084 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 03:51:26,084 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:26,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:26,084 INFO L85 PathProgramCache]: Analyzing trace with hash -286539729, now seen corresponding path program 1 times [2022-04-08 03:51:26,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:26,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2062933654] [2022-04-08 03:51:26,085 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:26,085 INFO L85 PathProgramCache]: Analyzing trace with hash -286539729, now seen corresponding path program 2 times [2022-04-08 03:51:26,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:26,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379197896] [2022-04-08 03:51:26,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:26,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:26,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:26,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {11216#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {11206#true} is VALID [2022-04-08 03:51:26,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {11206#true} assume true; {11206#true} is VALID [2022-04-08 03:51:26,260 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11206#true} {11206#true} #398#return; {11206#true} is VALID [2022-04-08 03:51:26,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {11206#true} call ULTIMATE.init(); {11216#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:26,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {11216#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {11206#true} is VALID [2022-04-08 03:51:26,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {11206#true} assume true; {11206#true} is VALID [2022-04-08 03:51:26,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11206#true} {11206#true} #398#return; {11206#true} is VALID [2022-04-08 03:51:26,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {11206#true} call #t~ret18 := main(); {11206#true} is VALID [2022-04-08 03:51:26,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {11206#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {11206#true} is VALID [2022-04-08 03:51:26,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {11206#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {11206#true} is VALID [2022-04-08 03:51:26,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {11206#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {11206#true} is VALID [2022-04-08 03:51:26,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {11206#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {11206#true} is VALID [2022-04-08 03:51:26,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {11206#true} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {11206#true} is VALID [2022-04-08 03:51:26,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {11206#true} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {11206#true} is VALID [2022-04-08 03:51:26,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {11206#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {11211#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 03:51:26,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {11211#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {11211#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 03:51:26,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {11211#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {11212#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~19 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} is VALID [2022-04-08 03:51:26,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {11212#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~19 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} assume !(0 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:26,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_0~2 := #t~nondet10;havoc #t~nondet10; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:26,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~main____CPAchecker_TMP_0~3 := #t~nondet11;havoc #t~nondet11; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:26,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~main____CPAchecker_TMP_0~4 := #t~nondet12;havoc #t~nondet12; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_31~0;~__tmp_31~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~30;~__VERIFIER_assert__cond~30 := ~__tmp_31~0; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~30);havoc ~__tmp_32~0;~__tmp_32~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~31;~__VERIFIER_assert__cond~31 := ~__tmp_32~0; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~31);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:26,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~main____CPAchecker_TMP_0~5 := #t~nondet13;havoc #t~nondet13; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_35~0;~__tmp_35~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:26,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~main____CPAchecker_TMP_0~6 := #t~nondet14;havoc #t~nondet14; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~6);havoc ~__tmp_39~0;~__tmp_39~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:26,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~main____CPAchecker_TMP_0~7 := #t~nondet15;havoc #t~nondet15; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~7);havoc ~__tmp_43~0;~__tmp_43~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:26,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~8;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~main____CPAchecker_TMP_0~8 := #t~nondet16;havoc #t~nondet16; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~8);havoc ~__tmp_47~0;~__tmp_47~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:26,272 INFO L290 TraceCheckUtils]: 42: Hoare triple {11214#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~8 := ~main__t~0;~main__t~0 := 1 + ~main__t~0;~__tmp_3137_0~0 := ~main____CPAchecker_TMP_1~8;~__tmp_3137_1~0 := ~main____CPAchecker_TMP_0~8; {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:26,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} ~main____CPAchecker_TMP_1~8 := ~__tmp_3137_0~0;~main____CPAchecker_TMP_0~8 := ~__tmp_3137_1~0; {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:26,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~9;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~main____CPAchecker_TMP_0~9 := #t~nondet17;havoc #t~nondet17; {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:26,273 INFO L290 TraceCheckUtils]: 45: Hoare triple {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !!(0 == ~main____CPAchecker_TMP_0~9);havoc ~__tmp_51~0;~__tmp_51~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~50;~__VERIFIER_assert__cond~50 := ~__tmp_51~0; {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:26,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {11213#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(0 == ~__VERIFIER_assert__cond~50);havoc ~__tmp_52~0;~__tmp_52~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~51;~__VERIFIER_assert__cond~51 := ~__tmp_52~0; {11215#(not (= main_~__VERIFIER_assert__cond~51 0))} is VALID [2022-04-08 03:51:26,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {11215#(not (= main_~__VERIFIER_assert__cond~51 0))} assume 0 == ~__VERIFIER_assert__cond~51; {11207#false} is VALID [2022-04-08 03:51:26,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {11207#false} assume !false; {11207#false} is VALID [2022-04-08 03:51:26,273 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-08 03:51:26,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:26,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379197896] [2022-04-08 03:51:26,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379197896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:26,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:26,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:51:26,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:26,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2062933654] [2022-04-08 03:51:26,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2062933654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:26,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:26,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:51:26,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936714199] [2022-04-08 03:51:26,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:26,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 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 49 [2022-04-08 03:51:26,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:26,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:26,312 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-08 03:51:26,312 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:51:26,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:26,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:51:26,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:51:26,313 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:26,752 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-08 03:51:26,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 03:51:26,752 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 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 49 [2022-04-08 03:51:26,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-08 03:51:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-08 03:51:26,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2022-04-08 03:51:26,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:26,807 INFO L225 Difference]: With dead ends: 62 [2022-04-08 03:51:26,807 INFO L226 Difference]: Without dead ends: 60 [2022-04-08 03:51:26,807 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-08 03:51:26,808 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 90 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:26,808 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 42 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:51:26,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-08 03:51:26,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2022-04-08 03:51:26,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:26,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:26,930 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:26,930 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:26,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:26,931 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-08 03:51:26,931 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-08 03:51:26,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:26,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:26,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 2 states have call successors, (2), 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-08 03:51:26,932 INFO L87 Difference]: Start difference. First operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 2 states have call successors, (2), 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-08 03:51:26,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:26,932 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-08 03:51:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-08 03:51:26,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:26,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:26,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:26,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:26,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-04-08 03:51:26,934 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2022-04-08 03:51:26,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:26,934 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-04-08 03:51:26,934 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:26,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 52 transitions. [2022-04-08 03:51:26,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-08 03:51:26,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-08 03:51:26,988 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:51:26,988 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:51:26,988 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 03:51:26,988 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-08 03:51:26,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:51:26,989 INFO L85 PathProgramCache]: Analyzing trace with hash -286970705, now seen corresponding path program 1 times [2022-04-08 03:51:26,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:26,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [934194537] [2022-04-08 03:51:26,989 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:51:26,989 INFO L85 PathProgramCache]: Analyzing trace with hash -286970705, now seen corresponding path program 2 times [2022-04-08 03:51:26,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:51:26,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502991966] [2022-04-08 03:51:26,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:51:26,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:51:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:27,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:51:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:51:27,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {11587#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {11577#true} is VALID [2022-04-08 03:51:27,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {11577#true} assume true; {11577#true} is VALID [2022-04-08 03:51:27,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11577#true} {11577#true} #398#return; {11577#true} is VALID [2022-04-08 03:51:27,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {11577#true} call ULTIMATE.init(); {11587#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:51:27,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {11587#(and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(33, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_2598~0 := 0;~__tmp_2624_0~0 := 0;~__tmp_2624_1~0 := 0;~__tmp_3137_0~0 := 0;~__tmp_3137_1~0 := 0; {11577#true} is VALID [2022-04-08 03:51:27,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {11577#true} assume true; {11577#true} is VALID [2022-04-08 03:51:27,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11577#true} {11577#true} #398#return; {11577#true} is VALID [2022-04-08 03:51:27,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {11577#true} call #t~ret18 := main(); {11577#true} is VALID [2022-04-08 03:51:27,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {11577#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__tagbuf_len~0 := #t~nondet4;havoc #t~nondet4; {11577#true} is VALID [2022-04-08 03:51:27,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {11577#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {11577#true} is VALID [2022-04-08 03:51:27,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {11577#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {11577#true} is VALID [2022-04-08 03:51:27,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {11577#true} assume !!(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {11577#true} is VALID [2022-04-08 03:51:27,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {11577#true} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {11577#true} is VALID [2022-04-08 03:51:27,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {11577#true} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {11577#true} is VALID [2022-04-08 03:51:27,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {11577#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet9;havoc #t~nondet9; {11582#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 03:51:27,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {11582#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {11582#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-08 03:51:27,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {11582#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~18);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {11583#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~19 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} is VALID [2022-04-08 03:51:27,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {11583#(and (or (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (<= main_~main__t~0 main_~main__tagbuf_len~0))) (or (= main_~__VERIFIER_assert__cond~19 0) (<= main_~main__t~0 main_~main__tagbuf_len~0)))} assume !(0 == ~__VERIFIER_assert__cond~19);~main____CPAchecker_TMP_1~1 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:27,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~2;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_0~2 := #t~nondet10;havoc #t~nondet10; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~2);havoc ~__tmp_23~0;~__tmp_23~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~22;~__VERIFIER_assert__cond~22 := ~__tmp_23~0; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~22);havoc ~__tmp_24~0;~__tmp_24~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~23;~__VERIFIER_assert__cond~23 := ~__tmp_24~0; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~23);~main____CPAchecker_TMP_1~2 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:27,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~3;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~main____CPAchecker_TMP_0~3 := #t~nondet11;havoc #t~nondet11; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~3);havoc ~__tmp_27~0;~__tmp_27~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~26;~__VERIFIER_assert__cond~26 := ~__tmp_27~0; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~26);havoc ~__tmp_28~0;~__tmp_28~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~27;~__VERIFIER_assert__cond~27 := ~__tmp_28~0; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~27);~main____CPAchecker_TMP_1~3 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:27,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~4;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~main____CPAchecker_TMP_0~4 := #t~nondet12;havoc #t~nondet12; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~4);havoc ~__tmp_31~0;~__tmp_31~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~30;~__VERIFIER_assert__cond~30 := ~__tmp_31~0; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~30);havoc ~__tmp_32~0;~__tmp_32~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~31;~__VERIFIER_assert__cond~31 := ~__tmp_32~0; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~31);~main____CPAchecker_TMP_1~4 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:27,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~5;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~main____CPAchecker_TMP_0~5 := #t~nondet13;havoc #t~nondet13; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,164 INFO L290 TraceCheckUtils]: 28: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~5);havoc ~__tmp_35~0;~__tmp_35~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~34;~__VERIFIER_assert__cond~34 := ~__tmp_35~0; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~34);havoc ~__tmp_36~0;~__tmp_36~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~35;~__VERIFIER_assert__cond~35 := ~__tmp_36~0; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~35);~main____CPAchecker_TMP_1~5 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:27,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~6;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~main____CPAchecker_TMP_0~6 := #t~nondet14;havoc #t~nondet14; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~6);havoc ~__tmp_39~0;~__tmp_39~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~38;~__VERIFIER_assert__cond~38 := ~__tmp_39~0; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~38);havoc ~__tmp_40~0;~__tmp_40~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~39;~__VERIFIER_assert__cond~39 := ~__tmp_40~0; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~39);~main____CPAchecker_TMP_1~6 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:27,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~7;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~main____CPAchecker_TMP_0~7 := #t~nondet15;havoc #t~nondet15; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,167 INFO L290 TraceCheckUtils]: 36: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~7);havoc ~__tmp_43~0;~__tmp_43~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~42;~__VERIFIER_assert__cond~42 := ~__tmp_43~0; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~42);havoc ~__tmp_44~0;~__tmp_44~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~43;~__VERIFIER_assert__cond~43 := ~__tmp_44~0; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~43);~main____CPAchecker_TMP_1~7 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:27,168 INFO L290 TraceCheckUtils]: 39: Hoare triple {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~8;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~main____CPAchecker_TMP_0~8 := #t~nondet16;havoc #t~nondet16; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~8);havoc ~__tmp_47~0;~__tmp_47~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~46;~__VERIFIER_assert__cond~46 := ~__tmp_47~0; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,169 INFO L290 TraceCheckUtils]: 41: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~46);havoc ~__tmp_48~0;~__tmp_48~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~47;~__VERIFIER_assert__cond~47 := ~__tmp_48~0; {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-08 03:51:27,169 INFO L290 TraceCheckUtils]: 42: Hoare triple {11585#(< main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~47);~main____CPAchecker_TMP_1~8 := ~main__t~0;~main__t~0 := 1 + ~main__t~0;~__tmp_3137_0~0 := ~main____CPAchecker_TMP_1~8;~__tmp_3137_1~0 := ~main____CPAchecker_TMP_0~8; {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:27,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} ~main____CPAchecker_TMP_1~8 := ~__tmp_3137_0~0;~main____CPAchecker_TMP_0~8 := ~__tmp_3137_1~0; {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:27,170 INFO L290 TraceCheckUtils]: 44: Hoare triple {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~9;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~main____CPAchecker_TMP_0~9 := #t~nondet17;havoc #t~nondet17; {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:27,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(0 == ~main____CPAchecker_TMP_0~9);havoc ~__tmp_49~0;~__tmp_49~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~48;~__VERIFIER_assert__cond~48 := ~__tmp_49~0; {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-08 03:51:27,170 INFO L290 TraceCheckUtils]: 46: Hoare triple {11584#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} assume !(0 == ~__VERIFIER_assert__cond~48);havoc ~__tmp_50~0;~__tmp_50~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~49;~__VERIFIER_assert__cond~49 := ~__tmp_50~0; {11586#(not (= main_~__VERIFIER_assert__cond~49 0))} is VALID [2022-04-08 03:51:27,171 INFO L290 TraceCheckUtils]: 47: Hoare triple {11586#(not (= main_~__VERIFIER_assert__cond~49 0))} assume 0 == ~__VERIFIER_assert__cond~49; {11578#false} is VALID [2022-04-08 03:51:27,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {11578#false} assume !false; {11578#false} is VALID [2022-04-08 03:51:27,171 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-08 03:51:27,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:51:27,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502991966] [2022-04-08 03:51:27,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502991966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:27,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:27,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:51:27,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:51:27,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [934194537] [2022-04-08 03:51:27,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [934194537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:51:27,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:51:27,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 03:51:27,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105034195] [2022-04-08 03:51:27,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:51:27,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 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 49 [2022-04-08 03:51:27,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:51:27,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:27,208 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-08 03:51:27,208 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 03:51:27,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:51:27,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 03:51:27,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:51:27,209 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:27,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:27,589 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-08 03:51:27,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:51:27,589 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 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 49 [2022-04-08 03:51:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:51:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-08 03:51:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-08 03:51:27,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-04-08 03:51:27,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:27,634 INFO L225 Difference]: With dead ends: 52 [2022-04-08 03:51:27,634 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 03:51:27,635 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-08 03:51:27,635 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 89 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:51:27,635 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 33 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:51:27,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 03:51:27,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 03:51:27,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:51:27,636 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-08 03:51:27,636 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-08 03:51:27,636 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-08 03:51:27,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:27,636 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:51:27,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:51:27,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:27,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:27,636 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-08 03:51:27,636 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-08 03:51:27,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:51:27,636 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 03:51:27,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:51:27,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:27,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:51:27,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:51:27,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:51:27,637 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-08 03:51:27,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 03:51:27,637 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-04-08 03:51:27,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:51:27,637 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 03:51:27,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:51:27,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 03:51:27,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:51:27,637 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 03:51:27,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:51:27,639 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-04-08 03:51:27,642 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-04-08 03:51:27,642 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-04-08 03:51:27,642 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-04-08 03:51:27,642 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-04-08 03:51:27,642 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-04-08 03:51:27,642 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-04-08 03:51:27,642 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-04-08 03:51:27,643 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-04-08 03:51:27,643 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-04-08 03:51:27,643 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-04-08 03:51:27,643 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-04-08 03:51:27,643 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-04-08 03:51:27,643 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-04-08 03:51:27,643 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-04-08 03:51:27,644 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-04-08 03:51:27,647 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 03:51:27,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 03:51:30,603 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-08 03:51:30,603 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-08 03:51:30,603 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-08 03:51:30,603 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-08 03:51:30,603 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-08 03:51:30,604 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-08 03:51:30,604 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-08 03:51:30,604 INFO L878 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 117) the Hoare annotation is: false [2022-04-08 03:51:30,604 INFO L878 garLoopResultBuilder]: At program point L217(lines 217 229) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~10 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,604 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 17 1006) the Hoare annotation is: true [2022-04-08 03:51:30,604 INFO L878 garLoopResultBuilder]: At program point L597(lines 597 969) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 5 main_~main__t~0)) [2022-04-08 03:51:30,604 INFO L878 garLoopResultBuilder]: At program point L366(lines 366 991) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,604 INFO L878 garLoopResultBuilder]: At program point L267(lines 267 275) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~12 0))) (.cse2 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 .cse1 (not (<= main_~main__tagbuf_len~0 0)) .cse2) (and .cse0 .cse1 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse2))) [2022-04-08 03:51:30,604 INFO L878 garLoopResultBuilder]: At program point L581(lines 581 971) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 4 main_~main__t~0)) [2022-04-08 03:51:30,604 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: false [2022-04-08 03:51:30,604 INFO L878 garLoopResultBuilder]: At program point L895(line 895) the Hoare annotation is: false [2022-04-08 03:51:30,605 INFO L878 garLoopResultBuilder]: At program point L317(lines 317 994) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,605 INFO L878 garLoopResultBuilder]: At program point L185(line 185) the Hoare annotation is: false [2022-04-08 03:51:30,605 INFO L878 garLoopResultBuilder]: At program point L400(lines 400 424) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,605 INFO L878 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 919) the Hoare annotation is: false [2022-04-08 03:51:30,605 INFO L878 garLoopResultBuilder]: At program point L136(lines 136 242) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,605 INFO L878 garLoopResultBuilder]: At program point L103(lines 103 125) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,605 INFO L878 garLoopResultBuilder]: At program point L615(lines 615 626) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,605 INFO L878 garLoopResultBuilder]: At program point L929(lines 929 941) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~50 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~51 0)) (<= 9 main_~main__t~0)) [2022-04-08 03:51:30,605 INFO L878 garLoopResultBuilder]: At program point L219(line 219) the Hoare annotation is: false [2022-04-08 03:51:30,605 INFO L878 garLoopResultBuilder]: At program point L665(lines 665 963) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 6 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-04-08 03:51:30,605 INFO L878 garLoopResultBuilder]: At program point L434(lines 434 985) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 2 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-04-08 03:51:30,605 INFO L878 garLoopResultBuilder]: At program point L269(line 269) the Hoare annotation is: false [2022-04-08 03:51:30,605 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 17 1006) the Hoare annotation is: true [2022-04-08 03:51:30,605 INFO L878 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 895) the Hoare annotation is: false [2022-04-08 03:51:30,605 INFO L878 garLoopResultBuilder]: At program point L649(lines 649 965) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 5 main_~main__t~0)) [2022-04-08 03:51:30,606 INFO L878 garLoopResultBuilder]: At program point L385(lines 385 988) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 2 main_~main__t~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,606 INFO L878 garLoopResultBuilder]: At program point L22(lines 22 1005) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-04-08 03:51:30,606 INFO L878 garLoopResultBuilder]: At program point L468(lines 468 492) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,606 INFO L878 garLoopResultBuilder]: At program point L881(lines 881 907) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~48 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0)) [2022-04-08 03:51:30,606 INFO L878 garLoopResultBuilder]: At program point L171(lines 171 193) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,606 INFO L878 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 207) the Hoare annotation is: false [2022-04-08 03:51:30,606 INFO L878 garLoopResultBuilder]: At program point L683(lines 683 694) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,606 INFO L878 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: false [2022-04-08 03:51:30,606 INFO L878 garLoopResultBuilder]: At program point L72(lines 72 288) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (< 0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,606 INFO L878 garLoopResultBuilder]: At program point L931(line 931) the Hoare annotation is: false [2022-04-08 03:51:30,606 INFO L878 garLoopResultBuilder]: At program point L733(lines 733 957) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-04-08 03:51:30,606 INFO L878 garLoopResultBuilder]: At program point L155(lines 155 234) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~7 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,606 INFO L878 garLoopResultBuilder]: At program point L502(lines 502 979) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 3 main_~main__t~0)) [2022-04-08 03:51:30,606 INFO L878 garLoopResultBuilder]: At program point L205(lines 205 231) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~10 0)) (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,607 INFO L878 garLoopResultBuilder]: At program point L717(lines 717 959) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 6 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-04-08 03:51:30,607 INFO L878 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 931) the Hoare annotation is: false [2022-04-08 03:51:30,607 INFO L878 garLoopResultBuilder]: At program point L453(lines 453 982) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 3 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,607 INFO L878 garLoopResultBuilder]: At program point L866(lines 866 946) the Hoare annotation is: (and (<= 9 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,607 INFO L878 garLoopResultBuilder]: At program point L255(lines 255 277) the Hoare annotation is: (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~12 0))) (.cse1 (<= 1 main_~main__t~0))) (or (and (<= main_~main__t~0 1) .cse0 (not (<= main_~main__tagbuf_len~0 0)) .cse1) (and .cse0 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) .cse1))) [2022-04-08 03:51:30,607 INFO L878 garLoopResultBuilder]: At program point L536(lines 536 560) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,607 INFO L878 garLoopResultBuilder]: At program point L883(line 883) the Hoare annotation is: false [2022-04-08 03:51:30,607 INFO L878 garLoopResultBuilder]: At program point L751(lines 751 762) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,607 INFO L878 garLoopResultBuilder]: At program point L173(line 173) the Hoare annotation is: false [2022-04-08 03:51:30,607 INFO L878 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 257) the Hoare annotation is: false [2022-04-08 03:51:30,607 INFO L878 garLoopResultBuilder]: At program point L801(lines 801 951) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 8 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-04-08 03:51:30,607 INFO L878 garLoopResultBuilder]: At program point L157(line 157) the Hoare annotation is: false [2022-04-08 03:51:30,607 INFO L878 garLoopResultBuilder]: At program point L570(lines 570 973) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 4 main_~main__t~0)) [2022-04-08 03:51:30,607 INFO L878 garLoopResultBuilder]: At program point L917(lines 917 943) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~50 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0)) [2022-04-08 03:51:30,608 INFO L878 garLoopResultBuilder]: At program point L785(lines 785 953) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-04-08 03:51:30,608 INFO L878 garLoopResultBuilder]: At program point L207(line 207) the Hoare annotation is: false [2022-04-08 03:51:30,608 INFO L878 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) the Hoare annotation is: false [2022-04-08 03:51:30,608 INFO L878 garLoopResultBuilder]: At program point L521(lines 521 976) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 4 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,608 INFO L878 garLoopResultBuilder]: At program point L868(lines 26 1000) the Hoare annotation is: (and (<= 0 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,608 INFO L878 garLoopResultBuilder]: At program point L257(line 257) the Hoare annotation is: false [2022-04-08 03:51:30,608 INFO L878 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) the Hoare annotation is: false [2022-04-08 03:51:30,608 INFO L878 garLoopResultBuilder]: At program point L604(lines 604 628) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,608 INFO L878 garLoopResultBuilder]: At program point L26(lines 26 1000) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,608 INFO L878 garLoopResultBuilder]: At program point L819(lines 819 830) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,608 INFO L878 garLoopResultBuilder]: At program point L638(lines 638 967) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 5 main_~main__t~0)) [2022-04-08 03:51:30,608 INFO L878 garLoopResultBuilder]: At program point L919(line 919) the Hoare annotation is: false [2022-04-08 03:51:30,608 INFO L878 garLoopResultBuilder]: At program point L853(lines 853 947) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 8 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-04-08 03:51:30,608 INFO L878 garLoopResultBuilder]: At program point L143(lines 143 236) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,608 INFO L878 garLoopResultBuilder]: At program point L589(lines 589 970) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 5 main_~main__t~0)) [2022-04-08 03:51:30,609 INFO L878 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 269) the Hoare annotation is: false [2022-04-08 03:51:30,609 INFO L878 garLoopResultBuilder]: At program point L325(lines 325 993) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,609 INFO L878 garLoopResultBuilder]: At program point L672(lines 672 696) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,609 INFO L878 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 173) the Hoare annotation is: false [2022-04-08 03:51:30,609 INFO L878 garLoopResultBuilder]: At program point L309(lines 309 995) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (< 0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,609 INFO L878 garLoopResultBuilder]: At program point L904(lines 65 999) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,609 INFO L878 garLoopResultBuilder]: At program point L706(lines 706 961) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 6 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-04-08 03:51:30,609 INFO L878 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) the Hoare annotation is: false [2022-04-08 03:51:30,609 INFO L878 garLoopResultBuilder]: At program point L343(lines 343 354) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,609 INFO L878 garLoopResultBuilder]: At program point L145(line 145) the Hoare annotation is: false [2022-04-08 03:51:30,609 INFO L878 garLoopResultBuilder]: At program point L657(lines 657 964) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 6 main_~main__t~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,609 INFO L878 garLoopResultBuilder]: At program point L46(lines 46 56) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (<= 0 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,610 INFO L878 garLoopResultBuilder]: At program point L1004(lines 22 1005) the Hoare annotation is: (or (<= 0 main_~main__t~0) (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|))) [2022-04-08 03:51:30,610 INFO L878 garLoopResultBuilder]: At program point L393(lines 393 987) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 2 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-04-08 03:51:30,610 INFO L878 garLoopResultBuilder]: At program point L740(lines 740 764) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,610 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) the Hoare annotation is: false [2022-04-08 03:51:30,610 INFO L878 garLoopResultBuilder]: At program point L96(lines 96 285) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,610 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 17 1006) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-04-08 03:51:30,610 INFO L878 garLoopResultBuilder]: At program point L377(lines 377 989) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,610 INFO L878 garLoopResultBuilder]: At program point L774(lines 774 955) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-04-08 03:51:30,610 INFO L878 garLoopResultBuilder]: At program point L411(lines 411 422) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,610 INFO L878 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 185) the Hoare annotation is: false [2022-04-08 03:51:30,610 INFO L878 garLoopResultBuilder]: At program point L725(lines 725 958) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (<= 7 main_~main__t~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,610 INFO L878 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: false [2022-04-08 03:51:30,610 INFO L878 garLoopResultBuilder]: At program point L461(lines 461 981) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 3 main_~main__t~0)) [2022-04-08 03:51:30,610 INFO L878 garLoopResultBuilder]: At program point L940(lines 858 947) the Hoare annotation is: (and (<= 9 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,611 INFO L878 garLoopResultBuilder]: At program point L874(lines 874 945) the Hoare annotation is: (and (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0)) [2022-04-08 03:51:30,611 INFO L878 garLoopResultBuilder]: At program point L808(lines 808 832) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,611 INFO L878 garLoopResultBuilder]: At program point L164(lines 164 233) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,611 INFO L878 garLoopResultBuilder]: At program point L65(lines 65 999) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (< 0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,611 INFO L878 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) the Hoare annotation is: false [2022-04-08 03:51:30,611 INFO L878 garLoopResultBuilder]: At program point L445(lines 445 983) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 2 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-04-08 03:51:30,611 INFO L878 garLoopResultBuilder]: At program point L115(lines 115 123) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~5 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,611 INFO L878 garLoopResultBuilder]: At program point L842(lines 842 949) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 8 main_~main__t~0) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-04-08 03:51:30,611 INFO L878 garLoopResultBuilder]: At program point L132(lines 132 284) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,611 INFO L878 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) the Hoare annotation is: false [2022-04-08 03:51:30,611 INFO L878 garLoopResultBuilder]: At program point L479(lines 479 490) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,611 INFO L878 garLoopResultBuilder]: At program point L793(lines 793 952) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (<= 8 main_~main__t~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,611 INFO L878 garLoopResultBuilder]: At program point L248(lines 248 283) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,611 INFO L878 garLoopResultBuilder]: At program point L83(lines 83 286) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (< 0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,611 INFO L878 garLoopResultBuilder]: At program point L529(lines 529 975) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 4 main_~main__t~0)) [2022-04-08 03:51:30,612 INFO L878 garLoopResultBuilder]: At program point L298(lines 298 997) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= main_~main__t~0 0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (< 0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,612 INFO L878 garLoopResultBuilder]: At program point L34(lines 34 58) the Hoare annotation is: (and (<= 0 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,612 INFO L878 garLoopResultBuilder]: At program point L513(lines 513 977) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 3 main_~main__t~0)) [2022-04-08 03:51:30,612 INFO L878 garLoopResultBuilder]: At program point L893(lines 893 905) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~48 0)) (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 9 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~49 0))) [2022-04-08 03:51:30,612 INFO L878 garLoopResultBuilder]: At program point L282(lines 132 284) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,613 INFO L878 garLoopResultBuilder]: At program point L183(lines 183 191) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-08 03:51:30,613 INFO L878 garLoopResultBuilder]: At program point L117(line 117) the Hoare annotation is: false [2022-04-08 03:51:30,613 INFO L878 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 883) the Hoare annotation is: false [2022-04-08 03:51:30,613 INFO L878 garLoopResultBuilder]: At program point L332(lines 332 356) the Hoare annotation is: (and (<= main_~main__t~0 1) (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,613 INFO L878 garLoopResultBuilder]: At program point L547(lines 547 558) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (< main_~main__t~0 main_~main__tagbuf_len~0) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (<= 1 main_~main__t~0)) [2022-04-08 03:51:30,613 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:51:30,613 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 03:51:30,613 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:51:30,613 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 03:51:30,613 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 03:51:30,614 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 03:51:30,614 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 03:51:30,616 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 03:51:30,617 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 03:51:30,619 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 03:51:30,621 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 03:51:30,621 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 03:51:30,622 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 03:51:30,622 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-08 03:51:30,623 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-08 03:51:30,718 INFO L163 areAnnotationChecker]: CFG has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 03:51:30,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:51:30 BoogieIcfgContainer [2022-04-08 03:51:30,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 03:51:30,738 INFO L158 Benchmark]: Toolchain (without parser) took 24677.14ms. Allocated memory was 194.0MB in the beginning and 363.9MB in the end (delta: 169.9MB). Free memory was 138.2MB in the beginning and 127.7MB in the end (delta: 10.5MB). Peak memory consumption was 192.0MB. Max. memory is 8.0GB. [2022-04-08 03:51:30,738 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory was 154.8MB in the beginning and 154.7MB in the end (delta: 68.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:51:30,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.20ms. Allocated memory was 194.0MB in the beginning and 247.5MB in the end (delta: 53.5MB). Free memory was 138.0MB in the beginning and 204.5MB in the end (delta: -66.5MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. [2022-04-08 03:51:30,738 INFO L158 Benchmark]: Boogie Preprocessor took 70.62ms. Allocated memory is still 247.5MB. Free memory was 204.5MB in the beginning and 201.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 03:51:30,738 INFO L158 Benchmark]: RCFGBuilder took 691.37ms. Allocated memory is still 247.5MB. Free memory was 201.9MB in the beginning and 171.0MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-04-08 03:51:30,738 INFO L158 Benchmark]: TraceAbstraction took 23486.98ms. Allocated memory was 247.5MB in the beginning and 363.9MB in the end (delta: 116.4MB). Free memory was 170.5MB in the beginning and 127.7MB in the end (delta: 42.7MB). Peak memory consumption was 170.1MB. Max. memory is 8.0GB. [2022-04-08 03:51:30,741 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 194.0MB. Free memory was 154.8MB in the beginning and 154.7MB in the end (delta: 68.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 424.20ms. Allocated memory was 194.0MB in the beginning and 247.5MB in the end (delta: 53.5MB). Free memory was 138.0MB in the beginning and 204.5MB in the end (delta: -66.5MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 70.62ms. Allocated memory is still 247.5MB. Free memory was 204.5MB in the beginning and 201.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 691.37ms. Allocated memory is still 247.5MB. Free memory was 201.9MB in the beginning and 171.0MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 23486.98ms. Allocated memory was 247.5MB in the beginning and 363.9MB in the end (delta: 116.4MB). Free memory was 170.5MB in the beginning and 127.7MB in the end (delta: 42.7MB). Peak memory consumption was 170.1MB. 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: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 105]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 117]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 173]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 185]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 207]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 219]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 269]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 883]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 895]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 919]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 931]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 132 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 23.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2576 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2576 mSDsluCounter, 2342 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1259 mSDsCounter, 471 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4981 IncrementalHoareTripleChecker+Invalid, 5452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 471 mSolverCounterUnsat, 1083 mSDtfsCounter, 4981 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=0, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 148 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 125 LocationsWithAnnotation, 125 PreInvPairs, 147 NumberOfFragments, 1678 HoareAnnotationTreeSize, 125 FomulaSimplifications, 13187 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 125 FomulaSimplificationsInter, 4837 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 858]: Loop Invariant Derived loop invariant: 9 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 0 <= main__t || ((((__tmp_3137_1 == \old(__tmp_3137_1) && __tmp_2624_1 == \old(__tmp_2624_1)) && __tmp_3137_0 == \old(__tmp_3137_0)) && \old(__return_2598) == __return_2598) && __tmp_2624_0 == \old(__tmp_2624_0)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && 1 <= main__t - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 <= main__t && main__t <= main__tagbuf_len - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 03:51:30,787 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...