/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:45:34,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:45:34,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:45:34,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:45:34,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:45:34,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:45:34,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:45:34,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:45:34,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:45:34,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:45:34,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:45:34,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:45:34,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:45:34,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:45:34,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:45:34,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:45:34,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:45:34,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:45:34,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:45:34,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:45:34,663 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:45:34,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:45:34,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:45:34,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:45:34,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:45:34,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:45:34,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:45:34,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:45:34,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:45:34,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:45:34,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:45:34,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:45:34,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:45:34,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:45:34,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:45:34,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:45:34,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:45:34,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:45:34,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:45:34,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:45:34,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:45:34,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:45:34,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:45:34,685 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:45:34,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:45:34,686 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:45:34,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:45:34,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:45:34,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:45:34,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:45:34,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:45:34,687 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:45:34,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:45:34,687 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:45:34,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:45:34,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:45:34,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:45:34,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:45:34,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:45:34,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:45:34,688 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:45:34,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:45:34,688 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:45:34,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:45:34,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:45:34,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:45:34,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:45:34,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:45:34,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:45:34,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:45:34,689 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:45:34,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:45:34,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:45:34,689 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:45:34,689 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:45:34,689 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:45:34,689 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:45:34,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:45:34,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:45:34,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:45:34,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:45:34,832 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:45:34,833 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-27 10:45:34,865 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/289436eee/86854bf27b6143f9bebe164b3e5ba820/FLAG5184f3fb7 [2022-04-27 10:45:35,223 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:45:35,223 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-04-27 10:45:35,229 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/289436eee/86854bf27b6143f9bebe164b3e5ba820/FLAG5184f3fb7 [2022-04-27 10:45:35,243 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/289436eee/86854bf27b6143f9bebe164b3e5ba820 [2022-04-27 10:45:35,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:45:35,245 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:45:35,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:45:35,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:45:35,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:45:35,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:45:35" (1/1) ... [2022-04-27 10:45:35,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b5f7de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:35, skipping insertion in model container [2022-04-27 10:45:35,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:45:35" (1/1) ... [2022-04-27 10:45:35,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:45:35,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:45:35,399 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-27 10:45:35,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-27 10:45:35,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[2208,2221] [2022-04-27 10:45:35,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[2423,2436] [2022-04-27 10:45:35,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[2918,2931] [2022-04-27 10:45:35,425 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-27 10:45:35,426 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-27 10:45:35,427 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-27 10:45:35,428 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-27 10:45:35,429 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-27 10:45:35,435 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-27 10:45:35,436 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-27 10:45:35,464 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-27 10:45:35,465 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-27 10:45:35,466 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-27 10:45:35,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[16659,16672] [2022-04-27 10:45:35,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:45:35,476 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:45:35,484 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-27 10:45:35,485 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-27 10:45:35,487 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-27 10:45:35,488 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-27 10:45:35,489 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-27 10:45:35,489 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-27 10:45:35,490 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-27 10:45:35,491 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-27 10:45:35,492 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-27 10:45:35,493 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-27 10:45:35,494 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-27 10:45:35,495 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-27 10:45:35,528 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-27 10:45:35,529 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-27 10:45:35,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-04-27 10:45:35,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-04-27 10:45:35,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:45:35,542 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:45:35,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:35 WrapperNode [2022-04-27 10:45:35,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:45:35,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:45:35,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:45:35,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:45:35,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:35" (1/1) ... [2022-04-27 10:45:35,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:35" (1/1) ... [2022-04-27 10:45:35,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:35" (1/1) ... [2022-04-27 10:45:35,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:35" (1/1) ... [2022-04-27 10:45:35,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:35" (1/1) ... [2022-04-27 10:45:35,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:35" (1/1) ... [2022-04-27 10:45:35,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:35" (1/1) ... [2022-04-27 10:45:35,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:45:35,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:45:35,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:45:35,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:45:35,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:35" (1/1) ... [2022-04-27 10:45:35,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:45:35,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:45:35,605 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:45:35,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:45:35,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:45:35,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:45:35,643 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:45:35,643 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 10:45:35,644 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:45:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:45:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:45:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:45:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:45:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 10:45:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:45:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:45:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:45:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:45:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:45:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:45:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:45:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:45:35,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:45:35,722 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:45:35,724 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:45:36,068 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:45:36,074 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:45:36,074 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 10:45:36,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:45:36 BoogieIcfgContainer [2022-04-27 10:45:36,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:45:36,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:45:36,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:45:36,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:45:36,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:45:35" (1/3) ... [2022-04-27 10:45:36,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460fda2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:45:36, skipping insertion in model container [2022-04-27 10:45:36,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:45:35" (2/3) ... [2022-04-27 10:45:36,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@460fda2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:45:36, skipping insertion in model container [2022-04-27 10:45:36,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:45:36" (3/3) ... [2022-04-27 10:45:36,081 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2022-04-27 10:45:36,089 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:45:36,090 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-04-27 10:45:36,120 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:45:36,124 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1c0424fa, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e2c13a1 [2022-04-27 10:45:36,124 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-04-27 10:45:36,131 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-27 10:45:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:45:36,135 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:36,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:36,136 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:36,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:36,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1600664684, now seen corresponding path program 1 times [2022-04-27 10:45:36,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:36,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122460465] [2022-04-27 10:45:36,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:36,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:36,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:36,389 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-27 10:45:36,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#true} assume true; {128#true} is VALID [2022-04-27 10:45:36,390 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128#true} {128#true} #398#return; {128#true} is VALID [2022-04-27 10:45:36,393 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-27 10:45:36,393 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-27 10:45:36,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {128#true} assume true; {128#true} is VALID [2022-04-27 10:45:36,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128#true} {128#true} #398#return; {128#true} is VALID [2022-04-27 10:45:36,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {128#true} call #t~ret18 := main(); {128#true} is VALID [2022-04-27 10:45:36,394 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-27 10:45:36,395 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-27 10:45:36,395 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-27 10:45:36,396 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-27 10:45:36,396 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-27 10:45:36,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {129#false} assume !false; {129#false} is VALID [2022-04-27 10:45:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:36,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:36,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122460465] [2022-04-27 10:45:36,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122460465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:36,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:36,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:45:36,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209842321] [2022-04-27 10:45:36,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:36,403 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-27 10:45:36,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:36,406 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-27 10:45:36,418 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-27 10:45:36,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:45:36,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:36,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:45:36,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:45:36,444 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-27 10:45:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:37,197 INFO L93 Difference]: Finished difference Result 143 states and 221 transitions. [2022-04-27 10:45:37,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:37,198 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-27 10:45:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:37,199 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-27 10:45:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions. [2022-04-27 10:45:37,208 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-27 10:45:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions. [2022-04-27 10:45:37,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 221 transitions. [2022-04-27 10:45:37,363 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-27 10:45:37,371 INFO L225 Difference]: With dead ends: 143 [2022-04-27 10:45:37,371 INFO L226 Difference]: Without dead ends: 123 [2022-04-27 10:45:37,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:45:37,375 INFO L413 NwaCegarLoop]: 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-27 10:45:37,376 INFO L414 NwaCegarLoop]: 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-27 10:45:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-27 10:45:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2022-04-27 10:45:37,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:37,401 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-27 10:45:37,401 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-27 10:45:37,402 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-27 10:45:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:37,407 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2022-04-27 10:45:37,407 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2022-04-27 10:45:37,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:37,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:37,408 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-27 10:45:37,409 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-27 10:45:37,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:37,413 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2022-04-27 10:45:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2022-04-27 10:45:37,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:37,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:37,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:37,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:37,415 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-27 10:45:37,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2022-04-27 10:45:37,419 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2022-04-27 10:45:37,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:37,419 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2022-04-27 10:45:37,419 INFO L496 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-27 10:45:37,419 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2022-04-27 10:45:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:45:37,420 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:37,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:37,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:45:37,420 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:37,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:37,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1919005414, now seen corresponding path program 1 times [2022-04-27 10:45:37,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:37,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797611582] [2022-04-27 10:45:37,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:37,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:37,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:37,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {680#(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; {672#true} is VALID [2022-04-27 10:45:37,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {672#true} assume true; {672#true} is VALID [2022-04-27 10:45:37,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {672#true} {672#true} #398#return; {672#true} is VALID [2022-04-27 10:45:37,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {672#true} call ULTIMATE.init(); {680#(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-27 10:45:37,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#(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; {672#true} is VALID [2022-04-27 10:45:37,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {672#true} assume true; {672#true} is VALID [2022-04-27 10:45:37,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {672#true} {672#true} #398#return; {672#true} is VALID [2022-04-27 10:45:37,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {672#true} call #t~ret18 := main(); {672#true} is VALID [2022-04-27 10:45:37,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {672#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; {672#true} is VALID [2022-04-27 10:45:37,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {672#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {677#(or (= main_~main__t~0 0) (<= main_~main__t~0 main_~main__tagbuf_len~0))} is VALID [2022-04-27 10:45:37,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {677#(or (= main_~main__t~0 0) (<= main_~main__t~0 main_~main__tagbuf_len~0))} assume ~main__t~0 == ~main__tagbuf_len~0; {678#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:37,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {678#(<= 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; {678#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:37,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {678#(<= 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; {679#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-27 10:45:37,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {679#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {673#false} is VALID [2022-04-27 10:45:37,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {673#false} assume !false; {673#false} is VALID [2022-04-27 10:45:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:37,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:37,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797611582] [2022-04-27 10:45:37,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797611582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:37,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:37,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:37,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483114660] [2022-04-27 10:45:37,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:37,506 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-27 10:45:37,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:37,506 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-27 10:45:37,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:37,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:37,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:37,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:37,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:37,514 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-27 10:45:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:38,087 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2022-04-27 10:45:38,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:38,087 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-27 10:45:38,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:38,087 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-27 10:45:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2022-04-27 10:45:38,089 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-27 10:45:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2022-04-27 10:45:38,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 142 transitions. [2022-04-27 10:45:38,187 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-27 10:45:38,189 INFO L225 Difference]: With dead ends: 121 [2022-04-27 10:45:38,189 INFO L226 Difference]: Without dead ends: 113 [2022-04-27 10:45:38,189 INFO L412 NwaCegarLoop]: 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-27 10:45:38,190 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 85 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:38,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 248 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:45:38,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-27 10:45:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-04-27 10:45:38,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:38,195 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-27 10:45:38,196 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-27 10:45:38,196 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-27 10:45:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:38,199 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-04-27 10:45:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-04-27 10:45:38,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:38,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:38,200 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-27 10:45:38,200 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-27 10:45:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:38,202 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-04-27 10:45:38,202 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-04-27 10:45:38,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:38,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:38,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:38,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:38,203 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-27 10:45:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2022-04-27 10:45:38,206 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2022-04-27 10:45:38,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:38,206 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2022-04-27 10:45:38,206 INFO L496 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-27 10:45:38,206 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-04-27 10:45:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:45:38,207 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:38,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:38,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:45:38,207 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:38,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:38,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1908131676, now seen corresponding path program 1 times [2022-04-27 10:45:38,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:38,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226975007] [2022-04-27 10:45:38,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:38,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:38,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:38,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#(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; {1165#true} is VALID [2022-04-27 10:45:38,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-27 10:45:38,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1165#true} {1165#true} #398#return; {1165#true} is VALID [2022-04-27 10:45:38,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {1165#true} call ULTIMATE.init(); {1173#(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-27 10:45:38,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#(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; {1165#true} is VALID [2022-04-27 10:45:38,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {1165#true} assume true; {1165#true} is VALID [2022-04-27 10:45:38,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1165#true} {1165#true} #398#return; {1165#true} is VALID [2022-04-27 10:45:38,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {1165#true} call #t~ret18 := main(); {1165#true} is VALID [2022-04-27 10:45:38,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {1165#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; {1165#true} is VALID [2022-04-27 10:45:38,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {1165#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1170#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:38,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {1170#(= 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; {1170#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:38,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {1170#(= 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; {1170#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:38,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {1170#(= 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; {1170#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:38,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {1170#(= 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; {1171#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:38,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {1171#(<= 1 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {1171#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:38,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {1171#(<= 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; {1172#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-27 10:45:38,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {1172#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {1166#false} is VALID [2022-04-27 10:45:38,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {1166#false} assume !false; {1166#false} is VALID [2022-04-27 10:45:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:38,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:38,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226975007] [2022-04-27 10:45:38,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226975007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:38,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:38,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:38,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194500974] [2022-04-27 10:45:38,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:38,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:45:38,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:38,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:38,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:38,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:38,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:38,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:38,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:38,287 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-27 10:45:38,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:38,819 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-04-27 10:45:38,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:38,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:45:38,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2022-04-27 10:45:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2022-04-27 10:45:38,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 125 transitions. [2022-04-27 10:45:38,911 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-27 10:45:38,912 INFO L225 Difference]: With dead ends: 113 [2022-04-27 10:45:38,912 INFO L226 Difference]: Without dead ends: 111 [2022-04-27 10:45:38,913 INFO L412 NwaCegarLoop]: 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-27 10:45:38,913 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 140 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:38,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 118 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:45:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-27 10:45:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-27 10:45:38,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:38,920 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-27 10:45:38,921 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-27 10:45:38,921 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-27 10:45:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:38,923 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-04-27 10:45:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-04-27 10:45:38,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:38,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:38,924 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-27 10:45:38,924 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-27 10:45:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:38,926 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-04-27 10:45:38,926 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-04-27 10:45:38,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:38,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:38,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:38,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:38,927 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-27 10:45:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2022-04-27 10:45:38,929 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2022-04-27 10:45:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:38,929 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2022-04-27 10:45:38,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-04-27 10:45:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:45:38,929 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:38,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:38,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 10:45:38,930 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:38,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:38,930 INFO L85 PathProgramCache]: Analyzing trace with hash -977457091, now seen corresponding path program 1 times [2022-04-27 10:45:38,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:38,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202934845] [2022-04-27 10:45:38,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:38,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:38,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:38,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {1649#(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; {1642#true} is VALID [2022-04-27 10:45:38,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {1642#true} assume true; {1642#true} is VALID [2022-04-27 10:45:38,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1642#true} {1642#true} #398#return; {1642#true} is VALID [2022-04-27 10:45:38,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {1642#true} call ULTIMATE.init(); {1649#(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-27 10:45:38,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {1649#(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; {1642#true} is VALID [2022-04-27 10:45:38,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {1642#true} assume true; {1642#true} is VALID [2022-04-27 10:45:38,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1642#true} {1642#true} #398#return; {1642#true} is VALID [2022-04-27 10:45:38,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {1642#true} call #t~ret18 := main(); {1642#true} is VALID [2022-04-27 10:45:38,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {1642#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; {1642#true} is VALID [2022-04-27 10:45:38,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {1642#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1642#true} is VALID [2022-04-27 10:45:38,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {1642#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; {1642#true} is VALID [2022-04-27 10:45:38,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {1642#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; {1642#true} is VALID [2022-04-27 10:45:38,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {1642#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; {1642#true} is VALID [2022-04-27 10:45:38,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {1642#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; {1642#true} is VALID [2022-04-27 10:45:38,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {1642#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {1642#true} is VALID [2022-04-27 10:45:38,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {1642#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; {1647#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:38,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {1647#(<= 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; {1648#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-27 10:45:38,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {1648#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {1643#false} is VALID [2022-04-27 10:45:38,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {1643#false} assume !false; {1643#false} is VALID [2022-04-27 10:45:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:38,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:38,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202934845] [2022-04-27 10:45:38,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202934845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:38,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:38,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:45:38,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587154097] [2022-04-27 10:45:38,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:38,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 10:45:38,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:38,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:38,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:38,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:45:38,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:38,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:45:38,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:45:38,988 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-27 10:45:39,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:39,350 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-04-27 10:45:39,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:45:39,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 10:45:39,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2022-04-27 10:45:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2022-04-27 10:45:39,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 123 transitions. [2022-04-27 10:45:39,434 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-27 10:45:39,436 INFO L225 Difference]: With dead ends: 111 [2022-04-27 10:45:39,436 INFO L226 Difference]: Without dead ends: 107 [2022-04-27 10:45:39,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:39,437 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 65 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:39,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 199 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:45:39,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-27 10:45:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-04-27 10:45:39,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:39,451 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-27 10:45:39,452 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-27 10:45:39,452 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-27 10:45:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:39,454 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-04-27 10:45:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-04-27 10:45:39,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:39,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:39,454 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-27 10:45:39,455 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-27 10:45:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:39,456 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-04-27 10:45:39,456 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-04-27 10:45:39,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:39,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:39,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:39,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:39,457 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-27 10:45:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2022-04-27 10:45:39,459 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2022-04-27 10:45:39,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:39,459 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2022-04-27 10:45:39,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:39,459 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-04-27 10:45:39,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:45:39,459 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:39,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:39,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:45:39,460 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:39,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:39,460 INFO L85 PathProgramCache]: Analyzing trace with hash -223130707, now seen corresponding path program 1 times [2022-04-27 10:45:39,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:39,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138671600] [2022-04-27 10:45:39,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:39,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:39,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:39,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {2111#(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; {2103#true} is VALID [2022-04-27 10:45:39,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {2103#true} assume true; {2103#true} is VALID [2022-04-27 10:45:39,504 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2103#true} {2103#true} #398#return; {2103#true} is VALID [2022-04-27 10:45:39,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {2103#true} call ULTIMATE.init(); {2111#(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-27 10:45:39,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {2111#(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; {2103#true} is VALID [2022-04-27 10:45:39,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {2103#true} assume true; {2103#true} is VALID [2022-04-27 10:45:39,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2103#true} {2103#true} #398#return; {2103#true} is VALID [2022-04-27 10:45:39,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {2103#true} call #t~ret18 := main(); {2103#true} is VALID [2022-04-27 10:45:39,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {2103#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; {2103#true} is VALID [2022-04-27 10:45:39,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {2103#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2108#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:39,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {2108#(= 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; {2108#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:39,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {2108#(= 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; {2108#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:39,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {2108#(= 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; {2108#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:39,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {2108#(= 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; {2109#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:39,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {2109#(<= 1 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {2109#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:39,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {2109#(<= 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; {2109#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:39,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {2109#(<= 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; {2109#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:39,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {2109#(<= 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; {2110#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-27 10:45:39,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {2110#(not (= main_~__VERIFIER_assert__cond~6 0))} assume 0 == ~__VERIFIER_assert__cond~6; {2104#false} is VALID [2022-04-27 10:45:39,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {2104#false} assume !false; {2104#false} is VALID [2022-04-27 10:45:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:39,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:39,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138671600] [2022-04-27 10:45:39,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138671600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:39,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:39,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:39,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136473476] [2022-04-27 10:45:39,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:39,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 10:45:39,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:39,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:39,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:39,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:39,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:39,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:39,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:39,520 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-27 10:45:40,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:40,051 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2022-04-27 10:45:40,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:40,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 10:45:40,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2022-04-27 10:45:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2022-04-27 10:45:40,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 139 transitions. [2022-04-27 10:45:40,142 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-27 10:45:40,144 INFO L225 Difference]: With dead ends: 125 [2022-04-27 10:45:40,144 INFO L226 Difference]: Without dead ends: 123 [2022-04-27 10:45:40,144 INFO L412 NwaCegarLoop]: 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-27 10:45:40,145 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 157 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:40,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 128 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:45:40,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-27 10:45:40,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-04-27 10:45:40,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:40,158 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-27 10:45:40,158 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-27 10:45:40,158 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-27 10:45:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:40,160 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2022-04-27 10:45:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2022-04-27 10:45:40,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:40,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:40,161 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-27 10:45:40,161 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-27 10:45:40,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:40,163 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2022-04-27 10:45:40,163 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2022-04-27 10:45:40,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:40,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:40,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:40,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:40,164 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-27 10:45:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-04-27 10:45:40,165 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2022-04-27 10:45:40,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:40,165 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-04-27 10:45:40,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:40,166 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-04-27 10:45:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:45:40,166 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:40,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:40,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 10:45:40,166 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:40,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash -221591507, now seen corresponding path program 1 times [2022-04-27 10:45:40,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:40,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664010343] [2022-04-27 10:45:40,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:40,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:40,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:40,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {2620#(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; {2612#true} is VALID [2022-04-27 10:45:40,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {2612#true} assume true; {2612#true} is VALID [2022-04-27 10:45:40,209 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2612#true} {2612#true} #398#return; {2612#true} is VALID [2022-04-27 10:45:40,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {2612#true} call ULTIMATE.init(); {2620#(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-27 10:45:40,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {2620#(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; {2612#true} is VALID [2022-04-27 10:45:40,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {2612#true} assume true; {2612#true} is VALID [2022-04-27 10:45:40,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2612#true} {2612#true} #398#return; {2612#true} is VALID [2022-04-27 10:45:40,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {2612#true} call #t~ret18 := main(); {2612#true} is VALID [2022-04-27 10:45:40,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {2612#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; {2612#true} is VALID [2022-04-27 10:45:40,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {2612#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2617#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:40,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {2617#(= 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; {2617#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:40,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {2617#(= 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; {2617#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:40,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {2617#(= 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; {2617#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:40,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {2617#(= 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; {2618#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:40,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {2618#(<= 1 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {2618#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:40,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {2618#(<= 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; {2618#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:40,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {2618#(<= 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; {2618#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:40,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {2618#(<= 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; {2619#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-27 10:45:40,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {2619#(not (= main_~__VERIFIER_assert__cond~12 0))} assume 0 == ~__VERIFIER_assert__cond~12; {2613#false} is VALID [2022-04-27 10:45:40,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {2613#false} assume !false; {2613#false} is VALID [2022-04-27 10:45:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:40,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:40,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664010343] [2022-04-27 10:45:40,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664010343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:40,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:40,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:40,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154362446] [2022-04-27 10:45:40,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:40,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 10:45:40,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:40,214 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:40,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:40,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:40,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:40,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:40,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:40,223 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-27 10:45:40,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:40,702 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2022-04-27 10:45:40,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:40,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 10:45:40,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:40,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2022-04-27 10:45:40,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2022-04-27 10:45:40,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 117 transitions. [2022-04-27 10:45:40,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:40,795 INFO L225 Difference]: With dead ends: 105 [2022-04-27 10:45:40,795 INFO L226 Difference]: Without dead ends: 103 [2022-04-27 10:45:40,795 INFO L412 NwaCegarLoop]: 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-27 10:45:40,796 INFO L413 NwaCegarLoop]: 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-27 10:45:40,796 INFO L414 NwaCegarLoop]: 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-27 10:45:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-27 10:45:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-27 10:45:40,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:40,806 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-27 10:45:40,807 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-27 10:45:40,807 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-27 10:45:40,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:40,809 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2022-04-27 10:45:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-27 10:45:40,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:40,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:40,809 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-27 10:45:40,809 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-27 10:45:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:40,811 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2022-04-27 10:45:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-27 10:45:40,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:40,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:40,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:40,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:40,811 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-27 10:45:40,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2022-04-27 10:45:40,813 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2022-04-27 10:45:40,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:40,813 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2022-04-27 10:45:40,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:40,813 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-27 10:45:40,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:45:40,814 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:40,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:40,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 10:45:40,814 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:40,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:40,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1674251212, now seen corresponding path program 1 times [2022-04-27 10:45:40,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:40,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723391571] [2022-04-27 10:45:40,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:40,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:40,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:40,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {3065#(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; {3057#true} is VALID [2022-04-27 10:45:40,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {3057#true} assume true; {3057#true} is VALID [2022-04-27 10:45:40,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3057#true} {3057#true} #398#return; {3057#true} is VALID [2022-04-27 10:45:40,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {3057#true} call ULTIMATE.init(); {3065#(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-27 10:45:40,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {3065#(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; {3057#true} is VALID [2022-04-27 10:45:40,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {3057#true} assume true; {3057#true} is VALID [2022-04-27 10:45:40,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3057#true} {3057#true} #398#return; {3057#true} is VALID [2022-04-27 10:45:40,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {3057#true} call #t~ret18 := main(); {3057#true} is VALID [2022-04-27 10:45:40,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {3057#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; {3057#true} is VALID [2022-04-27 10:45:40,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {3057#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3062#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:40,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {3062#(= 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; {3062#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:40,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {3062#(= 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; {3062#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:40,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {3062#(= 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; {3062#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:40,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {3062#(= 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; {3063#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:40,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {3063#(<= 1 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {3063#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:40,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {3063#(<= 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; {3063#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:40,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {3063#(<= 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; {3063#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:40,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {3063#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_4~0); {3063#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:40,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {3063#(<= 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; {3064#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-27 10:45:40,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {3064#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {3058#false} is VALID [2022-04-27 10:45:40,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {3058#false} assume !false; {3058#false} is VALID [2022-04-27 10:45:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:40,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:40,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723391571] [2022-04-27 10:45:40,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723391571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:40,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:40,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:45:40,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107421374] [2022-04-27 10:45:40,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:40,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:45:40,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:40,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:40,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:40,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:45:40,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:40,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:45:40,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:45:40,902 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-27 10:45:41,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:41,445 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2022-04-27 10:45:41,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:45:41,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:45:41,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2022-04-27 10:45:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2022-04-27 10:45:41,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 138 transitions. [2022-04-27 10:45:41,550 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-27 10:45:41,551 INFO L225 Difference]: With dead ends: 124 [2022-04-27 10:45:41,551 INFO L226 Difference]: Without dead ends: 122 [2022-04-27 10:45:41,552 INFO L412 NwaCegarLoop]: 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-27 10:45:41,552 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 148 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:41,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 120 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:45:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-27 10:45:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2022-04-27 10:45:41,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:41,557 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-27 10:45:41,557 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-27 10:45:41,557 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-27 10:45:41,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:41,559 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2022-04-27 10:45:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2022-04-27 10:45:41,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:41,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:41,560 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-27 10:45:41,560 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-27 10:45:41,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:41,562 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2022-04-27 10:45:41,562 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2022-04-27 10:45:41,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:41,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:41,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:41,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:41,562 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-27 10:45:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2022-04-27 10:45:41,564 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2022-04-27 10:45:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:41,564 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2022-04-27 10:45:41,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:41,564 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2022-04-27 10:45:41,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:45:41,564 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:41,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:41,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 10:45:41,564 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:41,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:41,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1672885792, now seen corresponding path program 1 times [2022-04-27 10:45:41,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:41,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490513368] [2022-04-27 10:45:41,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:41,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:41,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:41,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {3568#(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; {3559#true} is VALID [2022-04-27 10:45:41,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-27 10:45:41,665 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3559#true} {3559#true} #398#return; {3559#true} is VALID [2022-04-27 10:45:41,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {3559#true} call ULTIMATE.init(); {3568#(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-27 10:45:41,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {3568#(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; {3559#true} is VALID [2022-04-27 10:45:41,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {3559#true} assume true; {3559#true} is VALID [2022-04-27 10:45:41,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3559#true} {3559#true} #398#return; {3559#true} is VALID [2022-04-27 10:45:41,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {3559#true} call #t~ret18 := main(); {3559#true} is VALID [2022-04-27 10:45:41,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {3559#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; {3559#true} is VALID [2022-04-27 10:45:41,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {3559#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3564#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 10:45:41,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {3564#(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; {3565#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:41,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {3565#(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; {3565#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:41,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {3565#(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; {3565#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:41,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {3565#(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; {3566#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:41,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {3566#(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; {3566#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:41,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {3566#(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; {3566#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:41,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {3566#(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; {3566#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:41,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {3566#(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; {3566#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:41,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {3566#(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; {3567#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-27 10:45:41,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {3567#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {3560#false} is VALID [2022-04-27 10:45:41,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {3560#false} assume !false; {3560#false} is VALID [2022-04-27 10:45:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:41,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:41,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490513368] [2022-04-27 10:45:41,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490513368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:41,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:41,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:45:41,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317955085] [2022-04-27 10:45:41,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:41,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:45:41,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:41,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:41,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:41,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:45:41,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:41,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:45:41,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:41,686 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-27 10:45:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:42,237 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2022-04-27 10:45:42,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:45:42,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:45:42,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:42,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2022-04-27 10:45:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:42,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2022-04-27 10:45:42,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 150 transitions. [2022-04-27 10:45:42,336 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-27 10:45:42,337 INFO L225 Difference]: With dead ends: 134 [2022-04-27 10:45:42,338 INFO L226 Difference]: Without dead ends: 132 [2022-04-27 10:45:42,338 INFO L412 NwaCegarLoop]: 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-27 10:45:42,338 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 104 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:42,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 214 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:45:42,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-27 10:45:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 107. [2022-04-27 10:45:42,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:42,357 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-27 10:45:42,357 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-27 10:45:42,357 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-27 10:45:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:42,359 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-04-27 10:45:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 148 transitions. [2022-04-27 10:45:42,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:42,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:42,359 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-27 10:45:42,360 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-27 10:45:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:42,362 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-04-27 10:45:42,362 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 148 transitions. [2022-04-27 10:45:42,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:42,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:42,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:42,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:42,362 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-27 10:45:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2022-04-27 10:45:42,364 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 18 [2022-04-27 10:45:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:42,364 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2022-04-27 10:45:42,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-04-27 10:45:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 10:45:42,364 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:42,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:42,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 10:45:42,364 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:42,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:42,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1720601042, now seen corresponding path program 1 times [2022-04-27 10:45:42,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:42,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446791335] [2022-04-27 10:45:42,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:42,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:42,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:42,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {4112#(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; {4103#true} is VALID [2022-04-27 10:45:42,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {4103#true} assume true; {4103#true} is VALID [2022-04-27 10:45:42,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4103#true} {4103#true} #398#return; {4103#true} is VALID [2022-04-27 10:45:42,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {4103#true} call ULTIMATE.init(); {4112#(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-27 10:45:42,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {4112#(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; {4103#true} is VALID [2022-04-27 10:45:42,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {4103#true} assume true; {4103#true} is VALID [2022-04-27 10:45:42,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4103#true} {4103#true} #398#return; {4103#true} is VALID [2022-04-27 10:45:42,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {4103#true} call #t~ret18 := main(); {4103#true} is VALID [2022-04-27 10:45:42,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {4103#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; {4103#true} is VALID [2022-04-27 10:45:42,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {4103#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4108#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 10:45:42,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {4108#(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; {4109#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:42,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {4109#(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; {4109#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:42,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {4109#(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; {4109#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:42,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {4109#(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; {4110#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:42,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {4110#(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; {4110#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:42,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {4110#(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; {4110#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:42,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {4110#(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; {4110#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:42,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {4110#(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; {4110#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:42,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {4110#(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; {4111#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-27 10:45:42,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {4111#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {4104#false} is VALID [2022-04-27 10:45:42,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {4104#false} assume !false; {4104#false} is VALID [2022-04-27 10:45:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:42,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:42,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446791335] [2022-04-27 10:45:42,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446791335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:42,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:42,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:45:42,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289861346] [2022-04-27 10:45:42,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:42,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:45:42,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:42,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:42,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:42,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:45:42,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:42,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:45:42,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:42,477 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-27 10:45:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:42,959 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2022-04-27 10:45:42,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:45:42,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 10:45:42,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-27 10:45:42,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:42,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2022-04-27 10:45:42,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 131 transitions. [2022-04-27 10:45:43,043 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-27 10:45:43,044 INFO L225 Difference]: With dead ends: 117 [2022-04-27 10:45:43,044 INFO L226 Difference]: Without dead ends: 113 [2022-04-27 10:45:43,044 INFO L412 NwaCegarLoop]: 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-27 10:45:43,046 INFO L413 NwaCegarLoop]: 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-27 10:45:43,046 INFO L414 NwaCegarLoop]: 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-27 10:45:43,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-27 10:45:43,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-04-27 10:45:43,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:43,065 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-27 10:45:43,065 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-27 10:45:43,065 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-27 10:45:43,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:43,067 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2022-04-27 10:45:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2022-04-27 10:45:43,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:43,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:43,068 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-27 10:45:43,068 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-27 10:45:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:43,070 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2022-04-27 10:45:43,070 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2022-04-27 10:45:43,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:43,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:43,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:43,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:43,070 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-27 10:45:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2022-04-27 10:45:43,077 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 18 [2022-04-27 10:45:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:43,077 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2022-04-27 10:45:43,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:43,077 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2022-04-27 10:45:43,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 10:45:43,077 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:43,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:43,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 10:45:43,078 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:43,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:43,078 INFO L85 PathProgramCache]: Analyzing trace with hash 362183168, now seen corresponding path program 1 times [2022-04-27 10:45:43,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:43,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279861770] [2022-04-27 10:45:43,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:43,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:43,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:43,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {4600#(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; {4591#true} is VALID [2022-04-27 10:45:43,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {4591#true} assume true; {4591#true} is VALID [2022-04-27 10:45:43,181 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4591#true} {4591#true} #398#return; {4591#true} is VALID [2022-04-27 10:45:43,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {4591#true} call ULTIMATE.init(); {4600#(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-27 10:45:43,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {4600#(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; {4591#true} is VALID [2022-04-27 10:45:43,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {4591#true} assume true; {4591#true} is VALID [2022-04-27 10:45:43,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4591#true} {4591#true} #398#return; {4591#true} is VALID [2022-04-27 10:45:43,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {4591#true} call #t~ret18 := main(); {4591#true} is VALID [2022-04-27 10:45:43,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {4591#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; {4591#true} is VALID [2022-04-27 10:45:43,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {4591#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4596#(and (< 0 (+ main_~main__tagbuf_len~0 1)) (= main_~main__t~0 0))} is VALID [2022-04-27 10:45:43,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {4596#(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; {4597#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:43,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {4597#(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; {4597#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:43,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {4597#(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; {4597#(and (= main_~main__t~0 0) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:43,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {4597#(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; {4598#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:43,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {4598#(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; {4598#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:43,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {4598#(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; {4598#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:43,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {4598#(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; {4598#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:43,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {4598#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} assume !!(0 == ~main____CPAchecker_TMP_4~0); {4598#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:43,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {4598#(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; {4598#(and (<= main_~main__t~0 1) (not (<= main_~main__tagbuf_len~0 0)))} is VALID [2022-04-27 10:45:43,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {4598#(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; {4599#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-27 10:45:43,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {4599#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {4592#false} is VALID [2022-04-27 10:45:43,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {4592#false} assume !false; {4592#false} is VALID [2022-04-27 10:45:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:43,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:43,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279861770] [2022-04-27 10:45:43,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279861770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:43,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:43,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:45:43,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603533218] [2022-04-27 10:45:43,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:43,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 10:45:43,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:43,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:43,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:43,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:45:43,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:43,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:45:43,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:43,201 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-27 10:45:43,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:43,736 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2022-04-27 10:45:43,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:45:43,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 10:45:43,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2022-04-27 10:45:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2022-04-27 10:45:43,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 151 transitions. [2022-04-27 10:45:43,846 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-27 10:45:43,847 INFO L225 Difference]: With dead ends: 135 [2022-04-27 10:45:43,847 INFO L226 Difference]: Without dead ends: 133 [2022-04-27 10:45:43,847 INFO L412 NwaCegarLoop]: 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-27 10:45:43,848 INFO L413 NwaCegarLoop]: 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-27 10:45:43,848 INFO L414 NwaCegarLoop]: 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-27 10:45:43,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-27 10:45:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2022-04-27 10:45:43,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:43,866 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-27 10:45:43,866 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-27 10:45:43,867 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-27 10:45:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:43,868 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2022-04-27 10:45:43,868 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2022-04-27 10:45:43,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:43,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:43,869 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-27 10:45:43,869 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-27 10:45:43,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:43,871 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2022-04-27 10:45:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2022-04-27 10:45:43,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:43,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:43,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:43,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:43,871 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-27 10:45:43,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-04-27 10:45:43,873 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 19 [2022-04-27 10:45:43,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:43,873 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-04-27 10:45:43,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:43,873 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-27 10:45:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 10:45:43,873 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:43,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:43,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 10:45:43,874 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:43,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:43,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1325574371, now seen corresponding path program 1 times [2022-04-27 10:45:43,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:43,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457841237] [2022-04-27 10:45:43,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:43,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:43,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:43,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {5150#(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; {5143#true} is VALID [2022-04-27 10:45:43,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-27 10:45:43,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5143#true} {5143#true} #398#return; {5143#true} is VALID [2022-04-27 10:45:43,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {5143#true} call ULTIMATE.init(); {5150#(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-27 10:45:43,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {5150#(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; {5143#true} is VALID [2022-04-27 10:45:43,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {5143#true} assume true; {5143#true} is VALID [2022-04-27 10:45:43,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5143#true} {5143#true} #398#return; {5143#true} is VALID [2022-04-27 10:45:43,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {5143#true} call #t~ret18 := main(); {5143#true} is VALID [2022-04-27 10:45:43,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {5143#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; {5143#true} is VALID [2022-04-27 10:45:43,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {5143#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5148#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:43,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {5148#(<= 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; {5148#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:43,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {5148#(<= 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; {5148#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:43,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {5148#(<= 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; {5148#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:43,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {5148#(<= 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; {5148#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:43,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {5148#(<= 0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {5148#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:43,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {5148#(<= 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; {5148#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:43,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {5148#(<= 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; {5148#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:43,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {5148#(<= 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; {5148#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:43,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {5148#(<= 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; {5148#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:43,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {5148#(<= 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; {5148#(<= 0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:43,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {5148#(<= 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; {5149#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-27 10:45:43,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {5149#(not (= main_~__VERIFIER_assert__cond~8 0))} assume 0 == ~__VERIFIER_assert__cond~8; {5144#false} is VALID [2022-04-27 10:45:43,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {5144#false} assume !false; {5144#false} is VALID [2022-04-27 10:45:43,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:43,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:43,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457841237] [2022-04-27 10:45:43,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457841237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:43,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:43,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:45:43,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246834236] [2022-04-27 10:45:43,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:43,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 10:45:43,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:43,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:43,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:43,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:45:43,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:43,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:45:43,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:45:43,943 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-27 10:45:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:44,254 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-27 10:45:44,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:45:44,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 10:45:44,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-04-27 10:45:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:44,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-04-27 10:45:44,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 113 transitions. [2022-04-27 10:45:44,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:44,337 INFO L225 Difference]: With dead ends: 111 [2022-04-27 10:45:44,337 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 10:45:44,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:44,338 INFO L413 NwaCegarLoop]: 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-27 10:45:44,338 INFO L414 NwaCegarLoop]: 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-27 10:45:44,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 10:45:44,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-27 10:45:44,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:44,349 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-27 10:45:44,349 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-27 10:45:44,350 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-27 10:45:44,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:44,351 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-04-27 10:45:44,351 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-04-27 10:45:44,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:44,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:44,351 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-27 10:45:44,351 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-27 10:45:44,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:44,353 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-04-27 10:45:44,353 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-04-27 10:45:44,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:44,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:44,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:44,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:44,353 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-27 10:45:44,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2022-04-27 10:45:44,354 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 20 [2022-04-27 10:45:44,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:44,354 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2022-04-27 10:45:44,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:44,354 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-04-27 10:45:44,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 10:45:44,355 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:44,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:44,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 10:45:44,355 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:44,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:44,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1856864327, now seen corresponding path program 1 times [2022-04-27 10:45:44,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:44,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208223124] [2022-04-27 10:45:44,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:44,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:44,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:44,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {5620#(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; {5613#true} is VALID [2022-04-27 10:45:44,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-27 10:45:44,393 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5613#true} {5613#true} #398#return; {5613#true} is VALID [2022-04-27 10:45:44,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {5613#true} call ULTIMATE.init(); {5620#(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-27 10:45:44,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {5620#(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; {5613#true} is VALID [2022-04-27 10:45:44,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {5613#true} assume true; {5613#true} is VALID [2022-04-27 10:45:44,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5613#true} {5613#true} #398#return; {5613#true} is VALID [2022-04-27 10:45:44,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {5613#true} call #t~ret18 := main(); {5613#true} is VALID [2022-04-27 10:45:44,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {5613#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; {5613#true} is VALID [2022-04-27 10:45:44,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {5613#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5613#true} is VALID [2022-04-27 10:45:44,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {5613#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; {5613#true} is VALID [2022-04-27 10:45:44,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {5613#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; {5613#true} is VALID [2022-04-27 10:45:44,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {5613#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; {5613#true} is VALID [2022-04-27 10:45:44,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {5613#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; {5613#true} is VALID [2022-04-27 10:45:44,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {5613#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {5613#true} is VALID [2022-04-27 10:45:44,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {5613#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; {5613#true} is VALID [2022-04-27 10:45:44,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {5613#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; {5613#true} is VALID [2022-04-27 10:45:44,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {5613#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; {5613#true} is VALID [2022-04-27 10:45:44,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {5613#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; {5613#true} is VALID [2022-04-27 10:45:44,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {5613#true} assume !(0 == ~__VERIFIER_assert__cond~7);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5613#true} is VALID [2022-04-27 10:45:44,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {5613#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; {5618#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:44,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {5618#(<= 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; {5619#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-27 10:45:44,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {5619#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {5614#false} is VALID [2022-04-27 10:45:44,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {5614#false} assume !false; {5614#false} is VALID [2022-04-27 10:45:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:44,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:44,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208223124] [2022-04-27 10:45:44,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208223124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:44,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:44,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:45:44,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3322663] [2022-04-27 10:45:44,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:44,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 10:45:44,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:44,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:44,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:44,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:45:44,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:44,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:45:44,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:45:44,408 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-27 10:45:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:44,743 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-04-27 10:45:44,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:45:44,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 10:45:44,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:44,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-04-27 10:45:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2022-04-27 10:45:44,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 111 transitions. [2022-04-27 10:45:44,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:44,821 INFO L225 Difference]: With dead ends: 109 [2022-04-27 10:45:44,822 INFO L226 Difference]: Without dead ends: 105 [2022-04-27 10:45:44,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:44,822 INFO L413 NwaCegarLoop]: 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-27 10:45:44,822 INFO L414 NwaCegarLoop]: 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-27 10:45:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-27 10:45:44,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-04-27 10:45:44,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:44,833 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-27 10:45:44,833 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-27 10:45:44,833 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-27 10:45:44,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:44,834 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2022-04-27 10:45:44,834 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-04-27 10:45:44,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:44,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:44,835 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-27 10:45:44,835 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-27 10:45:44,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:44,836 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2022-04-27 10:45:44,836 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-04-27 10:45:44,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:44,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:44,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:44,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:44,836 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-27 10:45:44,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-04-27 10:45:44,837 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 21 [2022-04-27 10:45:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:44,838 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-04-27 10:45:44,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:44,838 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-04-27 10:45:44,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 10:45:44,838 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:44,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:44,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 10:45:44,838 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:44,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:44,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1714979017, now seen corresponding path program 1 times [2022-04-27 10:45:44,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:44,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962925941] [2022-04-27 10:45:44,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:44,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:44,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:44,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {6079#(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; {6070#true} is VALID [2022-04-27 10:45:44,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {6070#true} assume true; {6070#true} is VALID [2022-04-27 10:45:44,910 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6070#true} {6070#true} #398#return; {6070#true} is VALID [2022-04-27 10:45:44,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {6070#true} call ULTIMATE.init(); {6079#(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-27 10:45:44,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {6079#(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; {6070#true} is VALID [2022-04-27 10:45:44,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {6070#true} assume true; {6070#true} is VALID [2022-04-27 10:45:44,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6070#true} {6070#true} #398#return; {6070#true} is VALID [2022-04-27 10:45:44,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {6070#true} call #t~ret18 := main(); {6070#true} is VALID [2022-04-27 10:45:44,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {6070#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; {6070#true} is VALID [2022-04-27 10:45:44,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {6070#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6070#true} is VALID [2022-04-27 10:45:44,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {6070#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; {6070#true} is VALID [2022-04-27 10:45:44,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {6070#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; {6070#true} is VALID [2022-04-27 10:45:44,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {6070#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; {6070#true} is VALID [2022-04-27 10:45:44,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {6070#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; {6070#true} is VALID [2022-04-27 10:45:44,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {6070#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_2624_0~0;~main____CPAchecker_TMP_2~0 := ~__tmp_2624_1~0; {6070#true} is VALID [2022-04-27 10:45:44,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {6070#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; {6075#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:45:44,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {6075#(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; {6075#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:45:44,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {6075#(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; {6075#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:45:44,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {6075#(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; {6076#(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-27 10:45:44,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {6076#(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; {6077#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:44,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {6077#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0); {6077#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:44,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {6077#(<= 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; {6077#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:44,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {6077#(<= 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; {6078#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-27 10:45:44,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {6078#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {6071#false} is VALID [2022-04-27 10:45:44,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {6071#false} assume !false; {6071#false} is VALID [2022-04-27 10:45:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:44,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:44,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962925941] [2022-04-27 10:45:44,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962925941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:44,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:44,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:45:44,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790143282] [2022-04-27 10:45:44,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:44,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:45:44,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:44,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:44,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:44,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:45:44,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:44,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:45:44,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:44,938 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-27 10:45:45,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:45,467 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2022-04-27 10:45:45,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:45:45,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:45:45,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:45,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2022-04-27 10:45:45,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:45,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2022-04-27 10:45:45,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 125 transitions. [2022-04-27 10:45:45,556 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-27 10:45:45,557 INFO L225 Difference]: With dead ends: 121 [2022-04-27 10:45:45,557 INFO L226 Difference]: Without dead ends: 119 [2022-04-27 10:45:45,557 INFO L412 NwaCegarLoop]: 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-27 10:45:45,557 INFO L413 NwaCegarLoop]: 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-27 10:45:45,558 INFO L414 NwaCegarLoop]: 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-27 10:45:45,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-27 10:45:45,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2022-04-27 10:45:45,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:45,576 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-27 10:45:45,576 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-27 10:45:45,576 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-27 10:45:45,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:45,577 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-04-27 10:45:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2022-04-27 10:45:45,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:45,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:45,578 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-27 10:45:45,578 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-27 10:45:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:45,579 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-04-27 10:45:45,579 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2022-04-27 10:45:45,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:45,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:45,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:45,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:45,580 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-27 10:45:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-04-27 10:45:45,581 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 22 [2022-04-27 10:45:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:45,581 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-04-27 10:45:45,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-04-27 10:45:45,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 10:45:45,581 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:45,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:45,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 10:45:45,581 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:45,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:45,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1738536758, now seen corresponding path program 1 times [2022-04-27 10:45:45,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:45,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467836346] [2022-04-27 10:45:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:45,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:45,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:45,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {6582#(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; {6573#true} is VALID [2022-04-27 10:45:45,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {6573#true} assume true; {6573#true} is VALID [2022-04-27 10:45:45,640 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6573#true} {6573#true} #398#return; {6573#true} is VALID [2022-04-27 10:45:45,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {6573#true} call ULTIMATE.init(); {6582#(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-27 10:45:45,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {6582#(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; {6573#true} is VALID [2022-04-27 10:45:45,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {6573#true} assume true; {6573#true} is VALID [2022-04-27 10:45:45,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6573#true} {6573#true} #398#return; {6573#true} is VALID [2022-04-27 10:45:45,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {6573#true} call #t~ret18 := main(); {6573#true} is VALID [2022-04-27 10:45:45,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {6573#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; {6573#true} is VALID [2022-04-27 10:45:45,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {6573#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6573#true} is VALID [2022-04-27 10:45:45,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {6573#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; {6573#true} is VALID [2022-04-27 10:45:45,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {6573#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; {6573#true} is VALID [2022-04-27 10:45:45,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {6573#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; {6573#true} is VALID [2022-04-27 10:45:45,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {6573#true} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {6573#true} is VALID [2022-04-27 10:45:45,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {6573#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; {6578#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:45:45,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {6578#(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; {6578#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:45:45,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {6578#(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; {6579#(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-27 10:45:45,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {6579#(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; {6580#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:45,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {6580#(<= 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; {6580#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:45,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {6580#(<= 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; {6580#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:45,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {6580#(<= 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; {6580#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:45,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {6580#(<= 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; {6580#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:45,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {6580#(<= 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; {6581#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-27 10:45:45,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {6581#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {6574#false} is VALID [2022-04-27 10:45:45,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {6574#false} assume !false; {6574#false} is VALID [2022-04-27 10:45:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:45,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:45,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467836346] [2022-04-27 10:45:45,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467836346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:45,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:45,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:45:45,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559515465] [2022-04-27 10:45:45,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:45,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:45:45,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:45,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:45,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:45,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:45:45,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:45,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:45:45,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:45,658 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-27 10:45:46,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:46,201 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2022-04-27 10:45:46,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:45:46,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:45:46,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2022-04-27 10:45:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:46,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2022-04-27 10:45:46,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 120 transitions. [2022-04-27 10:45:46,289 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-27 10:45:46,290 INFO L225 Difference]: With dead ends: 113 [2022-04-27 10:45:46,290 INFO L226 Difference]: Without dead ends: 111 [2022-04-27 10:45:46,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:45:46,290 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 191 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:46,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 74 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:45:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-27 10:45:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2022-04-27 10:45:46,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:46,302 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-27 10:45:46,302 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-27 10:45:46,302 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-27 10:45:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:46,303 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-04-27 10:45:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2022-04-27 10:45:46,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:46,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:46,303 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-27 10:45:46,304 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-27 10:45:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:46,305 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-04-27 10:45:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2022-04-27 10:45:46,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:46,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:46,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:46,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:46,305 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-27 10:45:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-04-27 10:45:46,306 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 22 [2022-04-27 10:45:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:46,306 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-04-27 10:45:46,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:46,306 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-04-27 10:45:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 10:45:46,307 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:46,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:46,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 10:45:46,307 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:46,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:46,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1786252008, now seen corresponding path program 1 times [2022-04-27 10:45:46,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:46,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248792684] [2022-04-27 10:45:46,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:46,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:46,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:46,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {7054#(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; {7045#true} is VALID [2022-04-27 10:45:46,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {7045#true} assume true; {7045#true} is VALID [2022-04-27 10:45:46,391 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7045#true} {7045#true} #398#return; {7045#true} is VALID [2022-04-27 10:45:46,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {7045#true} call ULTIMATE.init(); {7054#(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-27 10:45:46,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {7054#(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; {7045#true} is VALID [2022-04-27 10:45:46,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {7045#true} assume true; {7045#true} is VALID [2022-04-27 10:45:46,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7045#true} {7045#true} #398#return; {7045#true} is VALID [2022-04-27 10:45:46,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {7045#true} call #t~ret18 := main(); {7045#true} is VALID [2022-04-27 10:45:46,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {7045#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; {7045#true} is VALID [2022-04-27 10:45:46,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {7045#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {7045#true} is VALID [2022-04-27 10:45:46,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {7045#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; {7045#true} is VALID [2022-04-27 10:45:46,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {7045#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; {7045#true} is VALID [2022-04-27 10:45:46,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {7045#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; {7045#true} is VALID [2022-04-27 10:45:46,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {7045#true} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {7045#true} is VALID [2022-04-27 10:45:46,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {7045#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; {7050#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:45:46,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {7050#(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; {7050#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:45:46,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {7050#(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; {7051#(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-27 10:45:46,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {7051#(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; {7052#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:46,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {7052#(<= 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; {7052#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:46,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {7052#(<= 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; {7052#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:46,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {7052#(<= 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; {7052#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:46,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {7052#(<= 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; {7052#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:46,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {7052#(<= 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; {7053#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-27 10:45:46,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {7053#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {7046#false} is VALID [2022-04-27 10:45:46,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {7046#false} assume !false; {7046#false} is VALID [2022-04-27 10:45:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:46,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:46,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248792684] [2022-04-27 10:45:46,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248792684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:46,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:46,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:45:46,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749495211] [2022-04-27 10:45:46,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:46,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:45:46,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:46,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:46,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:46,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:45:46,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:46,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:45:46,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:45:46,409 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-27 10:45:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:46,875 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2022-04-27 10:45:46,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:45:46,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 10:45:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:46,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-04-27 10:45:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-04-27 10:45:46,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 103 transitions. [2022-04-27 10:45:46,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:46,949 INFO L225 Difference]: With dead ends: 95 [2022-04-27 10:45:46,949 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 10:45:46,949 INFO L412 NwaCegarLoop]: 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-27 10:45:46,950 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 229 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:46,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 54 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:45:46,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 10:45:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-27 10:45:46,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:46,963 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-27 10:45:46,964 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-27 10:45:46,964 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-27 10:45:46,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:46,965 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-27 10:45:46,965 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-27 10:45:46,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:46,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:46,965 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-27 10:45:46,965 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-27 10:45:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:46,966 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-27 10:45:46,966 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-27 10:45:46,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:46,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:46,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:46,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:46,966 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-27 10:45:46,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-04-27 10:45:46,967 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 22 [2022-04-27 10:45:46,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:46,967 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-04-27 10:45:46,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:46,967 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-27 10:45:46,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-27 10:45:46,967 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:46,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 10:45:46,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 10:45:46,968 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:46,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:46,968 INFO L85 PathProgramCache]: Analyzing trace with hash -563432656, now seen corresponding path program 1 times [2022-04-27 10:45:46,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:46,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536973689] [2022-04-27 10:45:46,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:46,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:47,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:47,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {7365#(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; {7349#true} is VALID [2022-04-27 10:45:47,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-27 10:45:47,097 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7349#true} {7349#true} #398#return; {7349#true} is VALID [2022-04-27 10:45:47,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {7349#true} call ULTIMATE.init(); {7365#(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-27 10:45:47,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {7365#(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; {7349#true} is VALID [2022-04-27 10:45:47,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {7349#true} assume true; {7349#true} is VALID [2022-04-27 10:45:47,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7349#true} {7349#true} #398#return; {7349#true} is VALID [2022-04-27 10:45:47,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {7349#true} call #t~ret18 := main(); {7349#true} is VALID [2022-04-27 10:45:47,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {7349#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; {7349#true} is VALID [2022-04-27 10:45:47,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {7349#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {7354#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:47,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {7354#(= 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; {7354#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:47,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {7354#(= 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; {7354#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:47,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {7354#(= 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; {7354#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:47,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {7354#(= 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; {7355#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:47,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {7355#(<= 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; {7355#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:47,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {7355#(<= 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; {7355#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:47,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {7355#(<= 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; {7355#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:47,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {7355#(<= 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; {7356#(<= 2 main_~main__t~0)} is VALID [2022-04-27 10:45:47,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {7356#(<= 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; {7356#(<= 2 main_~main__t~0)} is VALID [2022-04-27 10:45:47,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {7356#(<= 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; {7356#(<= 2 main_~main__t~0)} is VALID [2022-04-27 10:45:47,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {7356#(<= 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; {7356#(<= 2 main_~main__t~0)} is VALID [2022-04-27 10:45:47,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {7356#(<= 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; {7357#(<= 3 main_~main__t~0)} is VALID [2022-04-27 10:45:47,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {7357#(<= 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; {7357#(<= 3 main_~main__t~0)} is VALID [2022-04-27 10:45:47,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {7357#(<= 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; {7357#(<= 3 main_~main__t~0)} is VALID [2022-04-27 10:45:47,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {7357#(<= 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; {7357#(<= 3 main_~main__t~0)} is VALID [2022-04-27 10:45:47,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {7357#(<= 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; {7358#(<= 4 main_~main__t~0)} is VALID [2022-04-27 10:45:47,104 INFO L290 TraceCheckUtils]: 23: Hoare triple {7358#(<= 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; {7358#(<= 4 main_~main__t~0)} is VALID [2022-04-27 10:45:47,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {7358#(<= 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; {7358#(<= 4 main_~main__t~0)} is VALID [2022-04-27 10:45:47,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {7358#(<= 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; {7358#(<= 4 main_~main__t~0)} is VALID [2022-04-27 10:45:47,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {7358#(<= 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; {7359#(<= 5 main_~main__t~0)} is VALID [2022-04-27 10:45:47,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {7359#(<= 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; {7359#(<= 5 main_~main__t~0)} is VALID [2022-04-27 10:45:47,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {7359#(<= 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; {7359#(<= 5 main_~main__t~0)} is VALID [2022-04-27 10:45:47,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {7359#(<= 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; {7359#(<= 5 main_~main__t~0)} is VALID [2022-04-27 10:45:47,107 INFO L290 TraceCheckUtils]: 30: Hoare triple {7359#(<= 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; {7360#(<= 6 main_~main__t~0)} is VALID [2022-04-27 10:45:47,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {7360#(<= 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; {7360#(<= 6 main_~main__t~0)} is VALID [2022-04-27 10:45:47,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {7360#(<= 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; {7360#(<= 6 main_~main__t~0)} is VALID [2022-04-27 10:45:47,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {7360#(<= 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; {7360#(<= 6 main_~main__t~0)} is VALID [2022-04-27 10:45:47,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {7360#(<= 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; {7361#(<= 7 main_~main__t~0)} is VALID [2022-04-27 10:45:47,108 INFO L290 TraceCheckUtils]: 35: Hoare triple {7361#(<= 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; {7361#(<= 7 main_~main__t~0)} is VALID [2022-04-27 10:45:47,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {7361#(<= 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; {7361#(<= 7 main_~main__t~0)} is VALID [2022-04-27 10:45:47,109 INFO L290 TraceCheckUtils]: 37: Hoare triple {7361#(<= 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; {7361#(<= 7 main_~main__t~0)} is VALID [2022-04-27 10:45:47,109 INFO L290 TraceCheckUtils]: 38: Hoare triple {7361#(<= 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; {7362#(<= 8 main_~main__t~0)} is VALID [2022-04-27 10:45:47,109 INFO L290 TraceCheckUtils]: 39: Hoare triple {7362#(<= 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; {7362#(<= 8 main_~main__t~0)} is VALID [2022-04-27 10:45:47,110 INFO L290 TraceCheckUtils]: 40: Hoare triple {7362#(<= 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; {7362#(<= 8 main_~main__t~0)} is VALID [2022-04-27 10:45:47,115 INFO L290 TraceCheckUtils]: 41: Hoare triple {7362#(<= 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; {7362#(<= 8 main_~main__t~0)} is VALID [2022-04-27 10:45:47,116 INFO L290 TraceCheckUtils]: 42: Hoare triple {7362#(<= 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; {7363#(<= 9 main_~main__t~0)} is VALID [2022-04-27 10:45:47,116 INFO L290 TraceCheckUtils]: 43: Hoare triple {7363#(<= 9 main_~main__t~0)} ~main____CPAchecker_TMP_1~8 := ~__tmp_3137_0~0;~main____CPAchecker_TMP_0~8 := ~__tmp_3137_1~0; {7363#(<= 9 main_~main__t~0)} is VALID [2022-04-27 10:45:47,116 INFO L290 TraceCheckUtils]: 44: Hoare triple {7363#(<= 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; {7363#(<= 9 main_~main__t~0)} is VALID [2022-04-27 10:45:47,116 INFO L290 TraceCheckUtils]: 45: Hoare triple {7363#(<= 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; {7364#(not (= main_~__VERIFIER_assert__cond~50 0))} is VALID [2022-04-27 10:45:47,117 INFO L290 TraceCheckUtils]: 46: Hoare triple {7364#(not (= main_~__VERIFIER_assert__cond~50 0))} assume 0 == ~__VERIFIER_assert__cond~50; {7350#false} is VALID [2022-04-27 10:45:47,117 INFO L290 TraceCheckUtils]: 47: Hoare triple {7350#false} assume !false; {7350#false} is VALID [2022-04-27 10:45:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:47,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:47,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536973689] [2022-04-27 10:45:47,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536973689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:47,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:47,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-27 10:45:47,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665783959] [2022-04-27 10:45:47,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:47,118 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-27 10:45:47,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:47,118 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-27 10:45:47,149 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-27 10:45:47,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:45:47,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:47,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:45:47,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:45:47,150 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-27 10:45:47,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:47,605 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-27 10:45:47,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 10:45:47,605 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-27 10:45:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:47,605 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-27 10:45:47,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 67 transitions. [2022-04-27 10:45:47,606 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-27 10:45:47,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 67 transitions. [2022-04-27 10:45:47,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 67 transitions. [2022-04-27 10:45:47,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:47,652 INFO L225 Difference]: With dead ends: 67 [2022-04-27 10:45:47,652 INFO L226 Difference]: Without dead ends: 65 [2022-04-27 10:45:47,652 INFO L412 NwaCegarLoop]: 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-27 10:45:47,653 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 145 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:47,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 58 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:45:47,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-27 10:45:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2022-04-27 10:45:47,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:47,657 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-27 10:45:47,657 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-27 10:45:47,657 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-27 10:45:47,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:47,657 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-27 10:45:47,658 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-27 10:45:47,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:47,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:47,658 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-27 10:45:47,658 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-27 10:45:47,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:47,659 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-27 10:45:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-27 10:45:47,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:47,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:47,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:47,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:47,659 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-27 10:45:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-04-27 10:45:47,659 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2022-04-27 10:45:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:47,660 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-04-27 10:45:47,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-27 10:45:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-27 10:45:47,660 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:47,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 10:45:47,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 10:45:47,660 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:47,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:47,660 INFO L85 PathProgramCache]: Analyzing trace with hash -563446558, now seen corresponding path program 1 times [2022-04-27 10:45:47,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:47,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630948778] [2022-04-27 10:45:47,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:47,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:47,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:47,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {7668#(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; {7652#true} is VALID [2022-04-27 10:45:47,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {7652#true} assume true; {7652#true} is VALID [2022-04-27 10:45:47,771 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7652#true} {7652#true} #398#return; {7652#true} is VALID [2022-04-27 10:45:47,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {7652#true} call ULTIMATE.init(); {7668#(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-27 10:45:47,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {7668#(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; {7652#true} is VALID [2022-04-27 10:45:47,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {7652#true} assume true; {7652#true} is VALID [2022-04-27 10:45:47,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7652#true} {7652#true} #398#return; {7652#true} is VALID [2022-04-27 10:45:47,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {7652#true} call #t~ret18 := main(); {7652#true} is VALID [2022-04-27 10:45:47,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {7652#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; {7652#true} is VALID [2022-04-27 10:45:47,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {7652#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {7657#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:47,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {7657#(= 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; {7657#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:47,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {7657#(= 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; {7657#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:47,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {7657#(= 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; {7657#(= main_~main__t~0 0)} is VALID [2022-04-27 10:45:47,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {7657#(= 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; {7658#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:47,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {7658#(<= 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; {7658#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:47,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {7658#(<= 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; {7658#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:47,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {7658#(<= 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; {7658#(<= 1 main_~main__t~0)} is VALID [2022-04-27 10:45:47,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {7658#(<= 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; {7659#(<= 2 main_~main__t~0)} is VALID [2022-04-27 10:45:47,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {7659#(<= 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; {7659#(<= 2 main_~main__t~0)} is VALID [2022-04-27 10:45:47,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {7659#(<= 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; {7659#(<= 2 main_~main__t~0)} is VALID [2022-04-27 10:45:47,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {7659#(<= 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; {7659#(<= 2 main_~main__t~0)} is VALID [2022-04-27 10:45:47,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {7659#(<= 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; {7660#(<= 3 main_~main__t~0)} is VALID [2022-04-27 10:45:47,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {7660#(<= 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; {7660#(<= 3 main_~main__t~0)} is VALID [2022-04-27 10:45:47,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {7660#(<= 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; {7660#(<= 3 main_~main__t~0)} is VALID [2022-04-27 10:45:47,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {7660#(<= 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; {7660#(<= 3 main_~main__t~0)} is VALID [2022-04-27 10:45:47,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {7660#(<= 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; {7661#(<= 4 main_~main__t~0)} is VALID [2022-04-27 10:45:47,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {7661#(<= 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; {7661#(<= 4 main_~main__t~0)} is VALID [2022-04-27 10:45:47,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {7661#(<= 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; {7661#(<= 4 main_~main__t~0)} is VALID [2022-04-27 10:45:47,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {7661#(<= 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; {7661#(<= 4 main_~main__t~0)} is VALID [2022-04-27 10:45:47,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {7661#(<= 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; {7662#(<= 5 main_~main__t~0)} is VALID [2022-04-27 10:45:47,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {7662#(<= 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; {7662#(<= 5 main_~main__t~0)} is VALID [2022-04-27 10:45:47,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {7662#(<= 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; {7662#(<= 5 main_~main__t~0)} is VALID [2022-04-27 10:45:47,782 INFO L290 TraceCheckUtils]: 29: Hoare triple {7662#(<= 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; {7662#(<= 5 main_~main__t~0)} is VALID [2022-04-27 10:45:47,782 INFO L290 TraceCheckUtils]: 30: Hoare triple {7662#(<= 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; {7663#(<= 6 main_~main__t~0)} is VALID [2022-04-27 10:45:47,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {7663#(<= 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; {7663#(<= 6 main_~main__t~0)} is VALID [2022-04-27 10:45:47,783 INFO L290 TraceCheckUtils]: 32: Hoare triple {7663#(<= 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; {7663#(<= 6 main_~main__t~0)} is VALID [2022-04-27 10:45:47,783 INFO L290 TraceCheckUtils]: 33: Hoare triple {7663#(<= 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; {7663#(<= 6 main_~main__t~0)} is VALID [2022-04-27 10:45:47,783 INFO L290 TraceCheckUtils]: 34: Hoare triple {7663#(<= 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; {7664#(<= 7 main_~main__t~0)} is VALID [2022-04-27 10:45:47,784 INFO L290 TraceCheckUtils]: 35: Hoare triple {7664#(<= 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; {7664#(<= 7 main_~main__t~0)} is VALID [2022-04-27 10:45:47,784 INFO L290 TraceCheckUtils]: 36: Hoare triple {7664#(<= 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; {7664#(<= 7 main_~main__t~0)} is VALID [2022-04-27 10:45:47,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {7664#(<= 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; {7664#(<= 7 main_~main__t~0)} is VALID [2022-04-27 10:45:47,784 INFO L290 TraceCheckUtils]: 38: Hoare triple {7664#(<= 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; {7665#(<= 8 main_~main__t~0)} is VALID [2022-04-27 10:45:47,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {7665#(<= 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; {7665#(<= 8 main_~main__t~0)} is VALID [2022-04-27 10:45:47,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {7665#(<= 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; {7665#(<= 8 main_~main__t~0)} is VALID [2022-04-27 10:45:47,785 INFO L290 TraceCheckUtils]: 41: Hoare triple {7665#(<= 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; {7665#(<= 8 main_~main__t~0)} is VALID [2022-04-27 10:45:47,786 INFO L290 TraceCheckUtils]: 42: Hoare triple {7665#(<= 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; {7666#(<= 9 main_~main__t~0)} is VALID [2022-04-27 10:45:47,786 INFO L290 TraceCheckUtils]: 43: Hoare triple {7666#(<= 9 main_~main__t~0)} ~main____CPAchecker_TMP_1~8 := ~__tmp_3137_0~0;~main____CPAchecker_TMP_0~8 := ~__tmp_3137_1~0; {7666#(<= 9 main_~main__t~0)} is VALID [2022-04-27 10:45:47,786 INFO L290 TraceCheckUtils]: 44: Hoare triple {7666#(<= 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; {7666#(<= 9 main_~main__t~0)} is VALID [2022-04-27 10:45:47,786 INFO L290 TraceCheckUtils]: 45: Hoare triple {7666#(<= 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; {7667#(not (= main_~__VERIFIER_assert__cond~48 0))} is VALID [2022-04-27 10:45:47,787 INFO L290 TraceCheckUtils]: 46: Hoare triple {7667#(not (= main_~__VERIFIER_assert__cond~48 0))} assume 0 == ~__VERIFIER_assert__cond~48; {7653#false} is VALID [2022-04-27 10:45:47,787 INFO L290 TraceCheckUtils]: 47: Hoare triple {7653#false} assume !false; {7653#false} is VALID [2022-04-27 10:45:47,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:47,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:47,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630948778] [2022-04-27 10:45:47,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630948778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:47,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:47,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-27 10:45:47,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048157738] [2022-04-27 10:45:47,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:47,788 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-27 10:45:47,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:47,788 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-27 10:45:47,817 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-27 10:45:47,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:45:47,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:47,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:45:47,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:45:47,818 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-27 10:45:48,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:48,249 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-27 10:45:48,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 10:45:48,249 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-27 10:45:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:48,249 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-27 10:45:48,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-27 10:45:48,252 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-27 10:45:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 56 transitions. [2022-04-27 10:45:48,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 56 transitions. [2022-04-27 10:45:48,296 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-27 10:45:48,297 INFO L225 Difference]: With dead ends: 56 [2022-04-27 10:45:48,297 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 10:45:48,297 INFO L412 NwaCegarLoop]: 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-27 10:45:48,297 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 84 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:48,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 52 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:45:48,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 10:45:48,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-27 10:45:48,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:48,310 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-27 10:45:48,310 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-27 10:45:48,310 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-27 10:45:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:48,311 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-27 10:45:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-27 10:45:48,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:48,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:48,311 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-27 10:45:48,311 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-27 10:45:48,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:48,312 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-27 10:45:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-27 10:45:48,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:48,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:48,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:48,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:48,312 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-27 10:45:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-04-27 10:45:48,313 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2022-04-27 10:45:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:48,313 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-04-27 10:45:48,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:45:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-27 10:45:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 10:45:48,313 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:48,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 10:45:48,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 10:45:48,314 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:48,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:48,314 INFO L85 PathProgramCache]: Analyzing trace with hash -286539729, now seen corresponding path program 1 times [2022-04-27 10:45:48,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:48,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516410883] [2022-04-27 10:45:48,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:48,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:48,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:48,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {7929#(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; {7919#true} is VALID [2022-04-27 10:45:48,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {7919#true} assume true; {7919#true} is VALID [2022-04-27 10:45:48,471 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7919#true} {7919#true} #398#return; {7919#true} is VALID [2022-04-27 10:45:48,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {7919#true} call ULTIMATE.init(); {7929#(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-27 10:45:48,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {7929#(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; {7919#true} is VALID [2022-04-27 10:45:48,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {7919#true} assume true; {7919#true} is VALID [2022-04-27 10:45:48,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7919#true} {7919#true} #398#return; {7919#true} is VALID [2022-04-27 10:45:48,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {7919#true} call #t~ret18 := main(); {7919#true} is VALID [2022-04-27 10:45:48,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {7919#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; {7919#true} is VALID [2022-04-27 10:45:48,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {7919#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {7919#true} is VALID [2022-04-27 10:45:48,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {7919#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; {7919#true} is VALID [2022-04-27 10:45:48,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {7919#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; {7919#true} is VALID [2022-04-27 10:45:48,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {7919#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; {7919#true} is VALID [2022-04-27 10:45:48,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {7919#true} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {7919#true} is VALID [2022-04-27 10:45:48,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {7919#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; {7924#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:45:48,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {7924#(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; {7924#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:45:48,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {7924#(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; {7925#(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-27 10:45:48,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {7925#(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; {7926#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:48,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {7926#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {7927#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {7927#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {7927#(< 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; {7926#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:48,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {7926#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {7927#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {7927#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {7927#(< 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; {7926#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:48,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {7926#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {7927#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {7927#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {7927#(< 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; {7926#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:48,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {7926#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {7927#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {7927#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {7927#(< 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; {7926#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:48,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {7926#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {7927#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,479 INFO L290 TraceCheckUtils]: 33: Hoare triple {7927#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,479 INFO L290 TraceCheckUtils]: 34: Hoare triple {7927#(< 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; {7926#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:48,479 INFO L290 TraceCheckUtils]: 35: Hoare triple {7926#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,480 INFO L290 TraceCheckUtils]: 36: Hoare triple {7927#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,480 INFO L290 TraceCheckUtils]: 37: Hoare triple {7927#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,480 INFO L290 TraceCheckUtils]: 38: Hoare triple {7927#(< 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; {7926#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:48,480 INFO L290 TraceCheckUtils]: 39: Hoare triple {7926#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,481 INFO L290 TraceCheckUtils]: 40: Hoare triple {7927#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,481 INFO L290 TraceCheckUtils]: 41: Hoare triple {7927#(< 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; {7927#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:48,481 INFO L290 TraceCheckUtils]: 42: Hoare triple {7927#(< 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; {7926#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:48,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {7926#(< 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; {7926#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:48,482 INFO L290 TraceCheckUtils]: 44: Hoare triple {7926#(< 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; {7926#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:48,482 INFO L290 TraceCheckUtils]: 45: Hoare triple {7926#(< 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; {7926#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:48,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {7926#(< 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; {7928#(not (= main_~__VERIFIER_assert__cond~51 0))} is VALID [2022-04-27 10:45:48,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {7928#(not (= main_~__VERIFIER_assert__cond~51 0))} assume 0 == ~__VERIFIER_assert__cond~51; {7920#false} is VALID [2022-04-27 10:45:48,483 INFO L290 TraceCheckUtils]: 48: Hoare triple {7920#false} assume !false; {7920#false} is VALID [2022-04-27 10:45:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:48,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:48,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516410883] [2022-04-27 10:45:48,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516410883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:48,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:48,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:45:48,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404178664] [2022-04-27 10:45:48,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:48,484 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-27 10:45:48,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:48,484 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-27 10:45:48,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:48,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:45:48,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:48,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:45:48,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:45:48,515 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-27 10:45:48,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:48,779 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-27 10:45:48,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:45:48,779 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-27 10:45:48,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:48,779 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-27 10:45:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-27 10:45:48,781 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-27 10:45:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2022-04-27 10:45:48,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 62 transitions. [2022-04-27 10:45:48,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:48,837 INFO L225 Difference]: With dead ends: 62 [2022-04-27 10:45:48,837 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 10:45:48,838 INFO L412 NwaCegarLoop]: 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-27 10:45:48,838 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 102 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 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-27 10:45:48,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 42 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:45:48,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 10:45:48,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2022-04-27 10:45:48,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:48,842 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-27 10:45:48,842 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-27 10:45:48,842 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-27 10:45:48,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:48,843 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-27 10:45:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-27 10:45:48,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:48,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:48,843 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-27 10:45:48,843 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-27 10:45:48,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:48,844 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-27 10:45:48,844 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-27 10:45:48,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:48,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:48,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:48,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:48,844 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-27 10:45:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-04-27 10:45:48,847 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2022-04-27 10:45:48,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:48,847 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-04-27 10:45:48,847 INFO L496 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-27 10:45:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-27 10:45:48,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 10:45:48,847 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:45:48,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 10:45:48,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 10:45:48,848 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-27 10:45:48,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:45:48,848 INFO L85 PathProgramCache]: Analyzing trace with hash -286970705, now seen corresponding path program 1 times [2022-04-27 10:45:48,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:45:48,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560010123] [2022-04-27 10:45:48,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:45:48,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:45:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:49,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:45:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:45:49,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {8197#(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; {8187#true} is VALID [2022-04-27 10:45:49,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {8187#true} assume true; {8187#true} is VALID [2022-04-27 10:45:49,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8187#true} {8187#true} #398#return; {8187#true} is VALID [2022-04-27 10:45:49,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {8187#true} call ULTIMATE.init(); {8197#(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-27 10:45:49,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {8197#(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; {8187#true} is VALID [2022-04-27 10:45:49,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {8187#true} assume true; {8187#true} is VALID [2022-04-27 10:45:49,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8187#true} {8187#true} #398#return; {8187#true} is VALID [2022-04-27 10:45:49,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {8187#true} call #t~ret18 := main(); {8187#true} is VALID [2022-04-27 10:45:49,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {8187#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; {8187#true} is VALID [2022-04-27 10:45:49,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {8187#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {8187#true} is VALID [2022-04-27 10:45:49,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {8187#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; {8187#true} is VALID [2022-04-27 10:45:49,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {8187#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; {8187#true} is VALID [2022-04-27 10:45:49,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {8187#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; {8187#true} is VALID [2022-04-27 10:45:49,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {8187#true} assume !(0 == ~__VERIFIER_assert__cond~15);~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {8187#true} is VALID [2022-04-27 10:45:49,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {8187#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; {8192#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:45:49,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {8192#(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; {8192#(not (= main_~main__tagbuf_len~0 main_~main__t~0))} is VALID [2022-04-27 10:45:49,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {8192#(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; {8193#(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-27 10:45:49,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {8193#(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; {8194#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:49,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {8194#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {8195#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {8195#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {8195#(< 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; {8194#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:49,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {8194#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {8195#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {8195#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {8195#(< 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; {8194#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:49,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {8194#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {8195#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {8195#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {8195#(< 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; {8194#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:49,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {8194#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {8195#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {8195#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {8195#(< 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; {8194#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:49,028 INFO L290 TraceCheckUtils]: 31: Hoare triple {8194#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,028 INFO L290 TraceCheckUtils]: 32: Hoare triple {8195#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,028 INFO L290 TraceCheckUtils]: 33: Hoare triple {8195#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,028 INFO L290 TraceCheckUtils]: 34: Hoare triple {8195#(< 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; {8194#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:49,029 INFO L290 TraceCheckUtils]: 35: Hoare triple {8194#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,029 INFO L290 TraceCheckUtils]: 36: Hoare triple {8195#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {8195#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,030 INFO L290 TraceCheckUtils]: 38: Hoare triple {8195#(< 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; {8194#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:49,030 INFO L290 TraceCheckUtils]: 39: Hoare triple {8194#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,031 INFO L290 TraceCheckUtils]: 40: Hoare triple {8195#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,031 INFO L290 TraceCheckUtils]: 41: Hoare triple {8195#(< 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; {8195#(< main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2022-04-27 10:45:49,031 INFO L290 TraceCheckUtils]: 42: Hoare triple {8195#(< 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; {8194#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:49,032 INFO L290 TraceCheckUtils]: 43: Hoare triple {8194#(< 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; {8194#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:49,032 INFO L290 TraceCheckUtils]: 44: Hoare triple {8194#(< 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; {8194#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:49,032 INFO L290 TraceCheckUtils]: 45: Hoare triple {8194#(< 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; {8194#(< main_~main__t~0 (+ main_~main__tagbuf_len~0 1))} is VALID [2022-04-27 10:45:49,032 INFO L290 TraceCheckUtils]: 46: Hoare triple {8194#(< 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; {8196#(not (= main_~__VERIFIER_assert__cond~49 0))} is VALID [2022-04-27 10:45:49,033 INFO L290 TraceCheckUtils]: 47: Hoare triple {8196#(not (= main_~__VERIFIER_assert__cond~49 0))} assume 0 == ~__VERIFIER_assert__cond~49; {8188#false} is VALID [2022-04-27 10:45:49,033 INFO L290 TraceCheckUtils]: 48: Hoare triple {8188#false} assume !false; {8188#false} is VALID [2022-04-27 10:45:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:45:49,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:45:49,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560010123] [2022-04-27 10:45:49,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560010123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:45:49,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:45:49,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 10:45:49,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438066613] [2022-04-27 10:45:49,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:45:49,034 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-27 10:45:49,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:45:49,035 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-27 10:45:49,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:45:49,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:45:49,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:45:49,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:45:49,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:45:49,064 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-27 10:45:49,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:49,289 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-27 10:45:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:45:49,289 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-27 10:45:49,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:45:49,289 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-27 10:45:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-27 10:45:49,290 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-27 10:45:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-04-27 10:45:49,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-04-27 10:45:49,340 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-27 10:45:49,340 INFO L225 Difference]: With dead ends: 52 [2022-04-27 10:45:49,340 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:45:49,340 INFO L412 NwaCegarLoop]: 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-27 10:45:49,341 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 109 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:45:49,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 27 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:45:49,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:45:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:45:49,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:45:49,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:45:49,341 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:45:49,342 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:45:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:49,342 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:45:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:45:49,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:49,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:49,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:45:49,342 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:45:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:45:49,342 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:45:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:45:49,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:49,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:45:49,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:45:49,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:45:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:45:49,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:45:49,342 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-04-27 10:45:49,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:45:49,342 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:45:49,343 INFO L496 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-27 10:45:49,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:45:49,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:45:49,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-04-27 10:45:49,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-04-27 10:45:49,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-04-27 10:45:49,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-04-27 10:45:49,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-04-27 10:45:49,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-04-27 10:45:49,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-04-27 10:45:49,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-04-27 10:45:49,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-04-27 10:45:49,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-04-27 10:45:49,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-04-27 10:45:49,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-04-27 10:45:49,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-04-27 10:45:49,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-04-27 10:45:49,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-04-27 10:45:49,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-04-27 10:45:49,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 10:45:49,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:45:49,649 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-27 10:45:49,650 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-27 10:45:49,650 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-27 10:45:49,650 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:45:49,650 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 10:45:49,650 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:45:49,650 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:45:49,651 INFO L899 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2022-04-27 10:45:49,651 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 229) no Hoare annotation was computed. [2022-04-27 10:45:49,651 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 17 1006) no Hoare annotation was computed. [2022-04-27 10:45:49,651 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 969) no Hoare annotation was computed. [2022-04-27 10:45:49,651 INFO L899 garLoopResultBuilder]: For program point L366(lines 366 991) no Hoare annotation was computed. [2022-04-27 10:45:49,651 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 275) no Hoare annotation was computed. [2022-04-27 10:45:49,651 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 971) no Hoare annotation was computed. [2022-04-27 10:45:49,651 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-04-27 10:45:49,651 INFO L899 garLoopResultBuilder]: For program point L895(line 895) no Hoare annotation was computed. [2022-04-27 10:45:49,651 INFO L899 garLoopResultBuilder]: For program point L317(lines 317 994) no Hoare annotation was computed. [2022-04-27 10:45:49,651 INFO L899 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-04-27 10:45:49,651 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 424) no Hoare annotation was computed. [2022-04-27 10:45:49,651 INFO L899 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 919) no Hoare annotation was computed. [2022-04-27 10:45:49,652 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 242) no Hoare annotation was computed. [2022-04-27 10:45:49,652 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 125) no Hoare annotation was computed. [2022-04-27 10:45:49,652 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 626) no Hoare annotation was computed. [2022-04-27 10:45:49,652 INFO L899 garLoopResultBuilder]: For program point L929(lines 929 941) no Hoare annotation was computed. [2022-04-27 10:45:49,652 INFO L899 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-04-27 10:45:49,652 INFO L899 garLoopResultBuilder]: For program point L665(lines 665 963) no Hoare annotation was computed. [2022-04-27 10:45:49,652 INFO L899 garLoopResultBuilder]: For program point L434(lines 434 985) no Hoare annotation was computed. [2022-04-27 10:45:49,652 INFO L899 garLoopResultBuilder]: For program point L269(line 269) no Hoare annotation was computed. [2022-04-27 10:45:49,652 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 17 1006) no Hoare annotation was computed. [2022-04-27 10:45:49,652 INFO L899 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 895) no Hoare annotation was computed. [2022-04-27 10:45:49,652 INFO L899 garLoopResultBuilder]: For program point L649(lines 649 965) no Hoare annotation was computed. [2022-04-27 10:45:49,652 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 988) no Hoare annotation was computed. [2022-04-27 10:45:49,652 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 1005) no Hoare annotation was computed. [2022-04-27 10:45:49,652 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 492) no Hoare annotation was computed. [2022-04-27 10:45:49,653 INFO L899 garLoopResultBuilder]: For program point L881(lines 881 907) no Hoare annotation was computed. [2022-04-27 10:45:49,653 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 193) no Hoare annotation was computed. [2022-04-27 10:45:49,653 INFO L899 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2022-04-27 10:45:49,653 INFO L899 garLoopResultBuilder]: For program point L683(lines 683 694) no Hoare annotation was computed. [2022-04-27 10:45:49,653 INFO L899 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2022-04-27 10:45:49,653 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 288) no Hoare annotation was computed. [2022-04-27 10:45:49,653 INFO L899 garLoopResultBuilder]: For program point L931(line 931) no Hoare annotation was computed. [2022-04-27 10:45:49,653 INFO L899 garLoopResultBuilder]: For program point L733(lines 733 957) no Hoare annotation was computed. [2022-04-27 10:45:49,653 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 234) no Hoare annotation was computed. [2022-04-27 10:45:49,653 INFO L899 garLoopResultBuilder]: For program point L502(lines 502 979) no Hoare annotation was computed. [2022-04-27 10:45:49,653 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 231) no Hoare annotation was computed. [2022-04-27 10:45:49,653 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 959) no Hoare annotation was computed. [2022-04-27 10:45:49,653 INFO L899 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 931) no Hoare annotation was computed. [2022-04-27 10:45:49,653 INFO L899 garLoopResultBuilder]: For program point L453(lines 453 982) no Hoare annotation was computed. [2022-04-27 10:45:49,654 INFO L899 garLoopResultBuilder]: For program point L866(lines 866 946) no Hoare annotation was computed. [2022-04-27 10:45:49,654 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 277) no Hoare annotation was computed. [2022-04-27 10:45:49,654 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 560) no Hoare annotation was computed. [2022-04-27 10:45:49,654 INFO L899 garLoopResultBuilder]: For program point L883(line 883) no Hoare annotation was computed. [2022-04-27 10:45:49,654 INFO L899 garLoopResultBuilder]: For program point L751(lines 751 762) no Hoare annotation was computed. [2022-04-27 10:45:49,654 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-04-27 10:45:49,654 INFO L899 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2022-04-27 10:45:49,654 INFO L899 garLoopResultBuilder]: For program point L801(lines 801 951) no Hoare annotation was computed. [2022-04-27 10:45:49,654 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-04-27 10:45:49,654 INFO L899 garLoopResultBuilder]: For program point L570(lines 570 973) no Hoare annotation was computed. [2022-04-27 10:45:49,654 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 943) no Hoare annotation was computed. [2022-04-27 10:45:49,654 INFO L899 garLoopResultBuilder]: For program point L785(lines 785 953) no Hoare annotation was computed. [2022-04-27 10:45:49,654 INFO L899 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-04-27 10:45:49,654 INFO L899 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2022-04-27 10:45:49,654 INFO L899 garLoopResultBuilder]: For program point L521(lines 521 976) no Hoare annotation was computed. [2022-04-27 10:45:49,655 INFO L895 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-27 10:45:49,655 INFO L899 garLoopResultBuilder]: For program point L257(line 257) no Hoare annotation was computed. [2022-04-27 10:45:49,655 INFO L899 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-04-27 10:45:49,655 INFO L899 garLoopResultBuilder]: For program point L604(lines 604 628) no Hoare annotation was computed. [2022-04-27 10:45:49,655 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 1000) no Hoare annotation was computed. [2022-04-27 10:45:49,655 INFO L899 garLoopResultBuilder]: For program point L819(lines 819 830) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 967) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point L919(line 919) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point L853(lines 853 947) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 236) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 970) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 269) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 993) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point L672(lines 672 696) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 995) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L895 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-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point L706(lines 706 961) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 354) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point L657(lines 657 964) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 56) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L895 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-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point L393(lines 393 987) no Hoare annotation was computed. [2022-04-27 10:45:49,656 INFO L899 garLoopResultBuilder]: For program point L740(lines 740 764) no Hoare annotation was computed. [2022-04-27 10:45:49,657 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2022-04-27 10:45:49,657 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 285) no Hoare annotation was computed. [2022-04-27 10:45:49,657 INFO L895 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-27 10:45:49,657 INFO L899 garLoopResultBuilder]: For program point L377(lines 377 989) no Hoare annotation was computed. [2022-04-27 10:45:49,657 INFO L899 garLoopResultBuilder]: For program point L774(lines 774 955) no Hoare annotation was computed. [2022-04-27 10:45:49,657 INFO L899 garLoopResultBuilder]: For program point L411(lines 411 422) no Hoare annotation was computed. [2022-04-27 10:45:49,657 INFO L899 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2022-04-27 10:45:49,657 INFO L899 garLoopResultBuilder]: For program point L725(lines 725 958) no Hoare annotation was computed. [2022-04-27 10:45:49,657 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-04-27 10:45:49,657 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 981) no Hoare annotation was computed. [2022-04-27 10:45:49,657 INFO L895 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-27 10:45:49,657 INFO L899 garLoopResultBuilder]: For program point L874(lines 874 945) no Hoare annotation was computed. [2022-04-27 10:45:49,657 INFO L899 garLoopResultBuilder]: For program point L808(lines 808 832) no Hoare annotation was computed. [2022-04-27 10:45:49,657 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 233) no Hoare annotation was computed. [2022-04-27 10:45:49,657 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 999) no Hoare annotation was computed. [2022-04-27 10:45:49,658 INFO L899 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2022-04-27 10:45:49,658 INFO L899 garLoopResultBuilder]: For program point L445(lines 445 983) no Hoare annotation was computed. [2022-04-27 10:45:49,658 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 123) no Hoare annotation was computed. [2022-04-27 10:45:49,658 INFO L899 garLoopResultBuilder]: For program point L842(lines 842 949) no Hoare annotation was computed. [2022-04-27 10:45:49,658 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 284) no Hoare annotation was computed. [2022-04-27 10:45:49,658 INFO L899 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2022-04-27 10:45:49,658 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 490) no Hoare annotation was computed. [2022-04-27 10:45:49,658 INFO L899 garLoopResultBuilder]: For program point L793(lines 793 952) no Hoare annotation was computed. [2022-04-27 10:45:49,658 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 283) no Hoare annotation was computed. [2022-04-27 10:45:49,658 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 286) no Hoare annotation was computed. [2022-04-27 10:45:49,658 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 975) no Hoare annotation was computed. [2022-04-27 10:45:49,658 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 997) no Hoare annotation was computed. [2022-04-27 10:45:49,658 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 58) no Hoare annotation was computed. [2022-04-27 10:45:49,658 INFO L899 garLoopResultBuilder]: For program point L513(lines 513 977) no Hoare annotation was computed. [2022-04-27 10:45:49,659 INFO L899 garLoopResultBuilder]: For program point L893(lines 893 905) no Hoare annotation was computed. [2022-04-27 10:45:49,659 INFO L895 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-27 10:45:49,659 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 191) no Hoare annotation was computed. [2022-04-27 10:45:49,659 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-04-27 10:45:49,659 INFO L899 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 883) no Hoare annotation was computed. [2022-04-27 10:45:49,659 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 356) no Hoare annotation was computed. [2022-04-27 10:45:49,659 INFO L899 garLoopResultBuilder]: For program point L547(lines 547 558) no Hoare annotation was computed. [2022-04-27 10:45:49,659 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:45:49,660 INFO L895 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-27 10:45:49,660 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:45:49,660 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:45:49,660 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:45:49,660 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:45:49,660 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:45:49,662 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:45:49,665 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:45:49,667 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:45:49,667 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:45:49,668 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 10:45:49,668 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 10:45:49,668 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:45:49,668 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:45:49,668 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:45:49,668 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:45:49,668 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L298 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L298 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-04-27 10:45:49,669 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L309 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L309 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L317 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L317 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L325 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L325 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L366 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L366 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L248 has no Hoare annotation [2022-04-27 10:45:49,670 WARN L170 areAnnotationChecker]: L343 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L343 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L377 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L377 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L205 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L385 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L385 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L205 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L205 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L257 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L257 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L267 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L267 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L393 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L393 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-04-27 10:45:49,671 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-04-27 10:45:49,672 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-04-27 10:45:49,672 WARN L170 areAnnotationChecker]: L207 has no Hoare annotation [2022-04-27 10:45:49,672 WARN L170 areAnnotationChecker]: L207 has no Hoare annotation [2022-04-27 10:45:49,672 WARN L170 areAnnotationChecker]: L217 has no Hoare annotation [2022-04-27 10:45:49,672 WARN L170 areAnnotationChecker]: L217 has no Hoare annotation [2022-04-27 10:45:49,672 WARN L170 areAnnotationChecker]: L269 has no Hoare annotation [2022-04-27 10:45:49,672 WARN L170 areAnnotationChecker]: L269 has no Hoare annotation [2022-04-27 10:45:49,672 WARN L170 areAnnotationChecker]: L400 has no Hoare annotation [2022-04-27 10:45:49,672 WARN L170 areAnnotationChecker]: L400 has no Hoare annotation [2022-04-27 10:45:49,672 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2022-04-27 10:45:49,672 WARN L170 areAnnotationChecker]: L434 has no Hoare annotation [2022-04-27 10:45:49,672 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-04-27 10:45:49,672 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-04-27 10:45:49,672 WARN L170 areAnnotationChecker]: L219 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L219 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L411 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L411 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L445 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L445 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L453 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L453 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L461 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L461 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L468 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L468 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L502 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L502 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L479 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L479 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L513 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L513 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L521 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L521 has no Hoare annotation [2022-04-27 10:45:49,673 WARN L170 areAnnotationChecker]: L529 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L529 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L536 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L536 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L570 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L570 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L547 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L547 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L604 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L604 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L638 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L638 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L615 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L615 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L649 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L649 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L657 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L657 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L665 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L665 has no Hoare annotation [2022-04-27 10:45:49,674 WARN L170 areAnnotationChecker]: L672 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L672 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L706 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L706 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L683 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L683 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L717 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L717 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L725 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L725 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L733 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L733 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L740 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L740 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L774 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L774 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L751 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L751 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L785 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L785 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L793 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L793 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L801 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L801 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L808 has no Hoare annotation [2022-04-27 10:45:49,675 WARN L170 areAnnotationChecker]: L808 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L842 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L842 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L819 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L819 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L853 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L853 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L866 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L866 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L866 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L874 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L881 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L881 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L917 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L917 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L883 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L883 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L893 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L893 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L919 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L929 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L895 has no Hoare annotation [2022-04-27 10:45:49,676 WARN L170 areAnnotationChecker]: L931 has no Hoare annotation [2022-04-27 10:45:49,677 WARN L170 areAnnotationChecker]: L931 has no Hoare annotation [2022-04-27 10:45:49,677 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:45:49,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:45:49 BoogieIcfgContainer [2022-04-27 10:45:49,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:45:49,693 INFO L158 Benchmark]: Toolchain (without parser) took 14446.67ms. Allocated memory was 200.3MB in the beginning and 289.4MB in the end (delta: 89.1MB). Free memory was 149.4MB in the beginning and 227.5MB in the end (delta: -78.0MB). Peak memory consumption was 141.4MB. Max. memory is 8.0GB. [2022-04-27 10:45:49,693 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 200.3MB. Free memory is still 166.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:45:49,693 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.32ms. Allocated memory is still 200.3MB. Free memory was 149.2MB in the beginning and 160.8MB in the end (delta: -11.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-27 10:45:49,693 INFO L158 Benchmark]: Boogie Preprocessor took 38.99ms. Allocated memory is still 200.3MB. Free memory was 160.8MB in the beginning and 158.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:45:49,694 INFO L158 Benchmark]: RCFGBuilder took 492.84ms. Allocated memory is still 200.3MB. Free memory was 158.3MB in the beginning and 128.3MB in the end (delta: 30.0MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-04-27 10:45:49,694 INFO L158 Benchmark]: TraceAbstraction took 13614.61ms. Allocated memory was 200.3MB in the beginning and 289.4MB in the end (delta: 89.1MB). Free memory was 127.9MB in the beginning and 227.5MB in the end (delta: -99.6MB). Peak memory consumption was 120.9MB. Max. memory is 8.0GB. [2022-04-27 10:45:49,696 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.08ms. Allocated memory is still 200.3MB. Free memory is still 166.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 296.32ms. Allocated memory is still 200.3MB. Free memory was 149.2MB in the beginning and 160.8MB in the end (delta: -11.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.99ms. Allocated memory is still 200.3MB. Free memory was 160.8MB in the beginning and 158.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 492.84ms. Allocated memory is still 200.3MB. Free memory was 158.3MB in the beginning and 128.3MB in the end (delta: 30.0MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 13614.61ms. Allocated memory was 200.3MB in the beginning and 289.4MB in the end (delta: 89.1MB). Free memory was 127.9MB in the beginning and 227.5MB in the end (delta: -99.6MB). Peak memory consumption was 120.9MB. 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: 13.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2602 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2602 mSDsluCounter, 2340 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1257 mSDsCounter, 470 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4969 IncrementalHoareTripleChecker+Invalid, 5439 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 470 mSolverCounterUnsat, 1083 mSDtfsCounter, 4969 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.2s 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: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 148 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 92 HoareAnnotationTreeSize, 9 FomulaSimplifications, 4450 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 261 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 443 ConstructedInterpolants, 0 QuantifiedInterpolants, 1724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 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 RESULT: Ultimate proved your program to be correct! [2022-04-27 10:45:49,725 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...