/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:33:55,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:33:55,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:33:55,351 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:33:55,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:33:55,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:33:55,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:33:55,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:33:55,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:33:55,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:33:55,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:33:55,359 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:33:55,359 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:33:55,360 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:33:55,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:33:55,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:33:55,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:33:55,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:33:55,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:33:55,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:33:55,365 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:33:55,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:33:55,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:33:55,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:33:55,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:33:55,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:33:55,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:33:55,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:33:55,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:33:55,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:33:55,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:33:55,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:33:55,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:33:55,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:33:55,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:33:55,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:33:55,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:33:55,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:33:55,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:33:55,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:33:55,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:33:55,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:33:55,378 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:33:55,399 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:33:55,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:33:55,401 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:33:55,401 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:33:55,401 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:33:55,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:33:55,402 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:33:55,402 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:33:55,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:33:55,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:33:55,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:33:55,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:33:55,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:33:55,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:33:55,403 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:33:55,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:33:55,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:33:55,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:33:55,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:33:55,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:33:55,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:33:55,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:33:55,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:33:55,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:33:55,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:33:55,404 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:33:55,404 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:33:55,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:33:55,405 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:33:55,405 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 00:33:55,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:33:55,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:33:55,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:33:55,593 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:33:55,596 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:33:55,597 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 [2022-04-15 00:33:55,642 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03aecf402/5fae120382cf4b049332fac0f1ded837/FLAG2e11e7b8d [2022-04-15 00:33:55,954 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:33:55,954 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2022-04-15 00:33:55,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03aecf402/5fae120382cf4b049332fac0f1ded837/FLAG2e11e7b8d [2022-04-15 00:33:56,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03aecf402/5fae120382cf4b049332fac0f1ded837 [2022-04-15 00:33:56,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:33:56,384 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:33:56,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:33:56,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:33:56,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:33:56,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:33:56" (1/1) ... [2022-04-15 00:33:56,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58d2a9b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:33:56, skipping insertion in model container [2022-04-15 00:33:56,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:33:56" (1/1) ... [2022-04-15 00:33:56,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:33:56,405 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:33:56,539 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[893,906] [2022-04-15 00:33:56,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:33:56,572 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:33:56,587 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[893,906] [2022-04-15 00:33:56,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:33:56,613 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:33:56,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:33:56 WrapperNode [2022-04-15 00:33:56,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:33:56,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:33:56,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:33:56,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:33:56,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:33:56" (1/1) ... [2022-04-15 00:33:56,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:33:56" (1/1) ... [2022-04-15 00:33:56,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:33:56" (1/1) ... [2022-04-15 00:33:56,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:33:56" (1/1) ... [2022-04-15 00:33:56,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:33:56" (1/1) ... [2022-04-15 00:33:56,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:33:56" (1/1) ... [2022-04-15 00:33:56,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:33:56" (1/1) ... [2022-04-15 00:33:56,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:33:56,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:33:56,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:33:56,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:33:56,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:33:56" (1/1) ... [2022-04-15 00:33:56,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:33:56,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:33:56,677 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-15 00:33:56,699 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-15 00:33:56,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:33:56,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:33:56,706 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:33:56,706 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 00:33:56,706 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:33:56,706 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:33:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:33:56,707 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:33:56,708 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 00:33:56,708 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 00:33:56,708 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:33:56,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:33:56,708 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 00:33:56,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:33:56,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 00:33:56,708 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:33:56,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:33:56,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:33:56,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:33:56,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:33:56,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:33:56,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:33:56,767 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:33:56,768 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:33:56,955 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:33:56,961 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:33:56,961 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 00:33:56,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:33:56 BoogieIcfgContainer [2022-04-15 00:33:56,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:33:56,963 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:33:56,963 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:33:56,968 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:33:56,970 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:33:56" (1/1) ... [2022-04-15 00:33:56,971 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:33:56,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:33:56 BasicIcfg [2022-04-15 00:33:56,997 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:33:56,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:33:56,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:33:57,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:33:57,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:33:56" (1/4) ... [2022-04-15 00:33:57,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245ab5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:33:57, skipping insertion in model container [2022-04-15 00:33:57,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:33:56" (2/4) ... [2022-04-15 00:33:57,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245ab5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:33:57, skipping insertion in model container [2022-04-15 00:33:57,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:33:56" (3/4) ... [2022-04-15 00:33:57,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@245ab5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:33:57, skipping insertion in model container [2022-04-15 00:33:57,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:33:56" (4/4) ... [2022-04-15 00:33:57,003 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.iqvasr [2022-04-15 00:33:57,006 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:33:57,006 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:33:57,043 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:33:57,052 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 00:33:57,053 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:33:57,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:33:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 00:33:57,079 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:33:57,079 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:33:57,080 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:33:57,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:33:57,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1788024088, now seen corresponding path program 1 times [2022-04-15 00:33:57,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:33:57,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155363935] [2022-04-15 00:33:57,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:33:57,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:33:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:57,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:33:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:57,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {51#true} is VALID [2022-04-15 00:33:57,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-15 00:33:57,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51#true} {51#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-15 00:33:57,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {51#true} [159] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:33:57,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {51#true} is VALID [2022-04-15 00:33:57,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-15 00:33:57,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-15 00:33:57,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {51#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-15 00:33:57,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {51#true} [163] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~tagbuf_len~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~t~0=v_main_~t~0_9, main_~tagbuf_len~0=v_main_~tagbuf_len~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~tagbuf_len~0, main_~t~0] {51#true} is VALID [2022-04-15 00:33:57,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {51#true} [165] L29-->L29-1: Formula: (<= 1 v_main_~tagbuf_len~0_9) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} OutVars{main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} AuxVars[] AssignedVars[] {51#true} is VALID [2022-04-15 00:33:57,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {51#true} [167] L29-1-->L32-2: Formula: (and (= v_main_~t~0_14 0) (= v_main_~tagbuf_len~0_13 (+ (- 1) v_main_~tagbuf_len~0_14))) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_14} OutVars{main_~t~0=v_main_~t~0_14, main_#t~pre2=|v_main_#t~pre2_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_13} AuxVars[] AssignedVars[main_#t~pre2, main_~tagbuf_len~0, main_~t~0] {51#true} is VALID [2022-04-15 00:33:57,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#true} [169] L32-2-->L32-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {52#false} is VALID [2022-04-15 00:33:57,228 INFO L272 TraceCheckUtils]: 9: Hoare triple {52#false} [173] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {52#false} is VALID [2022-04-15 00:33:57,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {52#false} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {52#false} is VALID [2022-04-15 00:33:57,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {52#false} [182] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {52#false} is VALID [2022-04-15 00:33:57,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {52#false} [189] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52#false} is VALID [2022-04-15 00:33:57,229 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-15 00:33:57,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:33:57,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155363935] [2022-04-15 00:33:57,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155363935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:33:57,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:33:57,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 00:33:57,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23553601] [2022-04-15 00:33:57,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:33:57,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 00:33:57,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:33:57,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:33:57,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:33:57,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 00:33:57,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:33:57,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 00:33:57,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:33:57,286 INFO L87 Difference]: Start difference. First operand has 48 states, 25 states have (on average 1.56) internal successors, (39), 30 states have internal predecessors, (39), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:33:57,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:57,522 INFO L93 Difference]: Finished difference Result 88 states and 157 transitions. [2022-04-15 00:33:57,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 00:33:57,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 00:33:57,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:33:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:33:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2022-04-15 00:33:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:33:57,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2022-04-15 00:33:57,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 157 transitions. [2022-04-15 00:33:57,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:33:57,716 INFO L225 Difference]: With dead ends: 88 [2022-04-15 00:33:57,716 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 00:33:57,719 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 00:33:57,723 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 31 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:33:57,724 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 57 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:33:57,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 00:33:57,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-15 00:33:57,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:33:57,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 00:33:57,752 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 00:33:57,753 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 00:33:57,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:57,758 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-15 00:33:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-15 00:33:57,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:57,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:57,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 43 states. [2022-04-15 00:33:57,761 INFO L87 Difference]: Start difference. First operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 43 states. [2022-04-15 00:33:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:57,766 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-04-15 00:33:57,766 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-15 00:33:57,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:57,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:57,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:33:57,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:33:57,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 26 states have internal predecessors, (30), 18 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 00:33:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-15 00:33:57,771 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 13 [2022-04-15 00:33:57,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:33:57,771 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-15 00:33:57,772 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:33:57,773 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-15 00:33:57,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 00:33:57,773 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:33:57,773 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:33:57,774 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:33:57,774 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:33:57,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:33:57,776 INFO L85 PathProgramCache]: Analyzing trace with hash -347621339, now seen corresponding path program 1 times [2022-04-15 00:33:57,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:33:57,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387305429] [2022-04-15 00:33:57,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:33:57,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:33:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:57,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:33:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:57,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {351#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {343#true} is VALID [2022-04-15 00:33:57,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {343#true} is VALID [2022-04-15 00:33:57,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {343#true} {343#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {343#true} is VALID [2022-04-15 00:33:57,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {343#true} [159] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {351#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:33:57,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {351#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {343#true} is VALID [2022-04-15 00:33:57,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {343#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {343#true} is VALID [2022-04-15 00:33:57,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {343#true} {343#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {343#true} is VALID [2022-04-15 00:33:57,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {343#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {343#true} is VALID [2022-04-15 00:33:57,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {343#true} [163] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~tagbuf_len~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~t~0=v_main_~t~0_9, main_~tagbuf_len~0=v_main_~tagbuf_len~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~tagbuf_len~0, main_~t~0] {343#true} is VALID [2022-04-15 00:33:57,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {343#true} [165] L29-->L29-1: Formula: (<= 1 v_main_~tagbuf_len~0_9) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} OutVars{main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} AuxVars[] AssignedVars[] {343#true} is VALID [2022-04-15 00:33:57,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {343#true} [167] L29-1-->L32-2: Formula: (and (= v_main_~t~0_14 0) (= v_main_~tagbuf_len~0_13 (+ (- 1) v_main_~tagbuf_len~0_14))) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_14} OutVars{main_~t~0=v_main_~t~0_14, main_#t~pre2=|v_main_#t~pre2_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_13} AuxVars[] AssignedVars[main_#t~pre2, main_~tagbuf_len~0, main_~t~0] {348#(<= 0 main_~t~0)} is VALID [2022-04-15 00:33:57,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {348#(<= 0 main_~t~0)} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {348#(<= 0 main_~t~0)} is VALID [2022-04-15 00:33:57,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {348#(<= 0 main_~t~0)} [174] L33-->L34: Formula: (= v_main_~t~0_17 v_main_~tagbuf_len~0_16) InVars {main_~t~0=v_main_~t~0_17, main_~tagbuf_len~0=v_main_~tagbuf_len~0_16} OutVars{main_~t~0=v_main_~t~0_17, main_~tagbuf_len~0=v_main_~tagbuf_len~0_16} AuxVars[] AssignedVars[] {348#(<= 0 main_~t~0)} is VALID [2022-04-15 00:33:57,896 INFO L272 TraceCheckUtils]: 10: Hoare triple {348#(<= 0 main_~t~0)} [178] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~t~0=v_main_~t~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {349#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:33:57,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#(not (= |__VERIFIER_assert_#in~cond| 0))} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {350#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:33:57,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {350#(not (= __VERIFIER_assert_~cond 0))} [182] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {344#false} is VALID [2022-04-15 00:33:57,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {344#false} [189] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {344#false} is VALID [2022-04-15 00:33:57,898 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-15 00:33:57,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:33:57,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387305429] [2022-04-15 00:33:57,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387305429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:33:57,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:33:57,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:33:57,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762342487] [2022-04-15 00:33:57,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:33:57,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 00:33:57,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:33:57,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:33:57,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:33:57,909 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:33:57,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:33:57,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:33:57,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:33:57,911 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:33:58,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:58,400 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-15 00:33:58,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:33:58,400 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 00:33:58,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:33:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:33:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-15 00:33:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:33:58,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-15 00:33:58,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2022-04-15 00:33:58,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:33:58,456 INFO L225 Difference]: With dead ends: 49 [2022-04-15 00:33:58,456 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 00:33:58,456 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 00:33:58,457 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 47 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:33:58,457 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 54 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 00:33:58,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 00:33:58,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 00:33:58,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:33:58,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 00:33:58,482 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 00:33:58,482 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 00:33:58,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:58,485 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-15 00:33:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-15 00:33:58,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:58,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:58,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 47 states. [2022-04-15 00:33:58,486 INFO L87 Difference]: Start difference. First operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 47 states. [2022-04-15 00:33:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:58,502 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-15 00:33:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-15 00:33:58,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:58,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:58,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:33:58,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:33:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 29 states have internal predecessors, (33), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 00:33:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-04-15 00:33:58,505 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 14 [2022-04-15 00:33:58,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:33:58,505 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-04-15 00:33:58,505 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:33:58,505 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-04-15 00:33:58,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 00:33:58,506 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:33:58,506 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:33:58,506 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:33:58,506 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:33:58,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:33:58,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2003510572, now seen corresponding path program 1 times [2022-04-15 00:33:58,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:33:58,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754749929] [2022-04-15 00:33:58,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:33:58,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:33:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:58,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:33:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:58,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {600#true} is VALID [2022-04-15 00:33:58,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {600#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {600#true} is VALID [2022-04-15 00:33:58,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {600#true} {600#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {600#true} is VALID [2022-04-15 00:33:58,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 00:33:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:58,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {600#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {600#true} is VALID [2022-04-15 00:33:58,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {600#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {600#true} is VALID [2022-04-15 00:33:58,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {600#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {600#true} is VALID [2022-04-15 00:33:58,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {600#true} {606#(<= main_~t~0 main_~tagbuf_len~0)} [218] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~t~0=v_main_~t~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {606#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-15 00:33:58,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {600#true} [159] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:33:58,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {600#true} is VALID [2022-04-15 00:33:58,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {600#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {600#true} is VALID [2022-04-15 00:33:58,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {600#true} {600#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {600#true} is VALID [2022-04-15 00:33:58,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {600#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {600#true} is VALID [2022-04-15 00:33:58,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {600#true} [163] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~tagbuf_len~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~t~0=v_main_~t~0_9, main_~tagbuf_len~0=v_main_~tagbuf_len~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~tagbuf_len~0, main_~t~0] {600#true} is VALID [2022-04-15 00:33:58,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {600#true} [165] L29-->L29-1: Formula: (<= 1 v_main_~tagbuf_len~0_9) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} OutVars{main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} AuxVars[] AssignedVars[] {600#true} is VALID [2022-04-15 00:33:58,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {600#true} [167] L29-1-->L32-2: Formula: (and (= v_main_~t~0_14 0) (= v_main_~tagbuf_len~0_13 (+ (- 1) v_main_~tagbuf_len~0_14))) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_14} OutVars{main_~t~0=v_main_~t~0_14, main_#t~pre2=|v_main_#t~pre2_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_13} AuxVars[] AssignedVars[main_#t~pre2, main_~tagbuf_len~0, main_~t~0] {605#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-15 00:33:58,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {605#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {605#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-15 00:33:58,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {605#(or (<= main_~t~0 main_~tagbuf_len~0) (= main_~t~0 0))} [174] L33-->L34: Formula: (= v_main_~t~0_17 v_main_~tagbuf_len~0_16) InVars {main_~t~0=v_main_~t~0_17, main_~tagbuf_len~0=v_main_~tagbuf_len~0_16} OutVars{main_~t~0=v_main_~t~0_17, main_~tagbuf_len~0=v_main_~tagbuf_len~0_16} AuxVars[] AssignedVars[] {606#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-15 00:33:58,636 INFO L272 TraceCheckUtils]: 10: Hoare triple {606#(<= main_~t~0 main_~tagbuf_len~0)} [178] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~t~0=v_main_~t~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {600#true} is VALID [2022-04-15 00:33:58,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {600#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {600#true} is VALID [2022-04-15 00:33:58,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {600#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {600#true} is VALID [2022-04-15 00:33:58,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {600#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {600#true} is VALID [2022-04-15 00:33:58,639 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {600#true} {606#(<= main_~t~0 main_~tagbuf_len~0)} [218] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~t~0=v_main_~t~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {606#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-15 00:33:58,640 INFO L272 TraceCheckUtils]: 15: Hoare triple {606#(<= main_~t~0 main_~tagbuf_len~0)} [184] L34-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (<= v_main_~t~0_34 v_main_~tagbuf_len~0_22) 1 0)) InVars {main_~t~0=v_main_~t~0_34, main_~tagbuf_len~0=v_main_~tagbuf_len~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {611#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:33:58,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {611#(not (= |__VERIFIER_assert_#in~cond| 0))} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {612#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:33:58,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {612#(not (= __VERIFIER_assert_~cond 0))} [182] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {601#false} is VALID [2022-04-15 00:33:58,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {601#false} [189] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {601#false} is VALID [2022-04-15 00:33:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:33:58,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:33:58,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754749929] [2022-04-15 00:33:58,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754749929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:33:58,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:33:58,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 00:33:58,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544718915] [2022-04-15 00:33:58,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:33:58,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-15 00:33:58,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:33:58,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:33:58,656 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-15 00:33:58,657 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:33:58,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:33:58,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:33:58,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:33:58,657 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:33:59,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:59,334 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2022-04-15 00:33:59,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:33:59,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-15 00:33:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:33:59,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:33:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-15 00:33:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:33:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2022-04-15 00:33:59,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 81 transitions. [2022-04-15 00:33:59,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:33:59,407 INFO L225 Difference]: With dead ends: 62 [2022-04-15 00:33:59,407 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 00:33:59,408 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 00:33:59,409 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 00:33:59,409 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 68 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 00:33:59,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 00:33:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-04-15 00:33:59,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:33:59,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 00:33:59,423 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 00:33:59,423 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 00:33:59,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:59,426 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-15 00:33:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-15 00:33:59,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:59,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:59,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 50 states. [2022-04-15 00:33:59,427 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 50 states. [2022-04-15 00:33:59,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:33:59,429 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2022-04-15 00:33:59,429 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-15 00:33:59,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:33:59,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:33:59,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:33:59,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:33:59,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 00:33:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-04-15 00:33:59,431 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 19 [2022-04-15 00:33:59,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:33:59,431 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-04-15 00:33:59,432 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:33:59,432 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-04-15 00:33:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 00:33:59,432 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:33:59,432 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:33:59,432 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 00:33:59,432 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:33:59,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:33:59,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2142117223, now seen corresponding path program 1 times [2022-04-15 00:33:59,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:33:59,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641218427] [2022-04-15 00:33:59,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:33:59,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:33:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:59,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:33:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:59,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {877#true} is VALID [2022-04-15 00:33:59,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 00:33:59,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {877#true} {877#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 00:33:59,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 00:33:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:33:59,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {877#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {877#true} is VALID [2022-04-15 00:33:59,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {877#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 00:33:59,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 00:33:59,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} [222] __VERIFIER_assertEXIT-->L45: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-15 00:33:59,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {877#true} [159] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:33:59,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {877#true} is VALID [2022-04-15 00:33:59,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {877#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 00:33:59,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 00:33:59,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {877#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 00:33:59,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {877#true} [163] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~tagbuf_len~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~t~0=v_main_~t~0_9, main_~tagbuf_len~0=v_main_~tagbuf_len~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~tagbuf_len~0, main_~t~0] {877#true} is VALID [2022-04-15 00:33:59,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {877#true} [165] L29-->L29-1: Formula: (<= 1 v_main_~tagbuf_len~0_9) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} OutVars{main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} AuxVars[] AssignedVars[] {882#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-15 00:33:59,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {882#(<= 1 main_~tagbuf_len~0)} [167] L29-1-->L32-2: Formula: (and (= v_main_~t~0_14 0) (= v_main_~tagbuf_len~0_13 (+ (- 1) v_main_~tagbuf_len~0_14))) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_14} OutVars{main_~t~0=v_main_~t~0_14, main_#t~pre2=|v_main_#t~pre2_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_13} AuxVars[] AssignedVars[main_#t~pre2, main_~tagbuf_len~0, main_~t~0] {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-15 00:33:59,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-15 00:33:59,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} [175] L33-->L38: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (not (= v_main_~t~0_22 v_main_~tagbuf_len~0_18)) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} OutVars{main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} AuxVars[] AssignedVars[] {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-15 00:33:59,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} [179] L38-->L32-3: Formula: (not (= |v_main_#t~nondet3_3| 0)) InVars {main_#t~nondet3=|v_main_#t~nondet3_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-15 00:33:59,504 INFO L272 TraceCheckUtils]: 11: Hoare triple {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} [173] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {877#true} is VALID [2022-04-15 00:33:59,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {877#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {877#true} is VALID [2022-04-15 00:33:59,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {877#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 00:33:59,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {877#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {877#true} is VALID [2022-04-15 00:33:59,505 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {877#true} {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} [222] __VERIFIER_assertEXIT-->L45: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} is VALID [2022-04-15 00:33:59,506 INFO L272 TraceCheckUtils]: 16: Hoare triple {883#(and (<= 0 main_~tagbuf_len~0) (= main_~t~0 0))} [176] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~t~0_38 v_main_~tagbuf_len~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~t~0=v_main_~t~0_38, main_~tagbuf_len~0=v_main_~tagbuf_len~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {888#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:33:59,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {888#(not (= |__VERIFIER_assert_#in~cond| 0))} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {889#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:33:59,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {889#(not (= __VERIFIER_assert_~cond 0))} [182] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {878#false} is VALID [2022-04-15 00:33:59,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {878#false} [189] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {878#false} is VALID [2022-04-15 00:33:59,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:33:59,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:33:59,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641218427] [2022-04-15 00:33:59,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641218427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:33:59,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:33:59,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 00:33:59,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293956447] [2022-04-15 00:33:59,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:33:59,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 00:33:59,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:33:59,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:33:59,518 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-15 00:33:59,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:33:59,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:33:59,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:33:59,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:33:59,519 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:34:00,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:34:00,028 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-15 00:34:00,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 00:34:00,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 00:34:00,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:34:00,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:34:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-15 00:34:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:34:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-15 00:34:00,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 68 transitions. [2022-04-15 00:34:00,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:34:00,096 INFO L225 Difference]: With dead ends: 60 [2022-04-15 00:34:00,096 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 00:34:00,096 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 00:34:00,097 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 57 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:34:00,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 55 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 00:34:00,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 00:34:00,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-04-15 00:34:00,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:34:00,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 00:34:00,119 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 00:34:00,119 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 00:34:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:34:00,121 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-04-15 00:34:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-15 00:34:00,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:34:00,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:34:00,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 58 states. [2022-04-15 00:34:00,122 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) Second operand 58 states. [2022-04-15 00:34:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:34:00,124 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-04-15 00:34:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-15 00:34:00,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:34:00,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:34:00,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:34:00,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:34:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 00:34:00,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-15 00:34:00,127 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 20 [2022-04-15 00:34:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:34:00,127 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-15 00:34:00,127 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:34:00,127 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-15 00:34:00,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 00:34:00,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:34:00,128 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:34:00,128 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 00:34:00,128 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:34:00,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:34:00,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1358705581, now seen corresponding path program 1 times [2022-04-15 00:34:00,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:34:00,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5166770] [2022-04-15 00:34:00,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:34:00,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:34:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:34:00,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:34:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:34:00,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {1211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1188#true} is VALID [2022-04-15 00:34:00,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1188#true} {1188#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 00:34:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:34:00,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {1188#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1188#true} is VALID [2022-04-15 00:34:00,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [220] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_35) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-15 00:34:00,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 00:34:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:34:00,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {1188#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1188#true} is VALID [2022-04-15 00:34:00,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [221] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~t~0_36 v_main_~tagbuf_len~0_23) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_36, main_~tagbuf_len~0=v_main_~tagbuf_len~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-15 00:34:00,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-15 00:34:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:34:00,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {1188#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1188#true} is VALID [2022-04-15 00:34:00,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} [222] __VERIFIER_assertEXIT-->L45: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-15 00:34:00,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} [159] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:34:00,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1188#true} is VALID [2022-04-15 00:34:00,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} [163] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~tagbuf_len~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~t~0=v_main_~t~0_9, main_~tagbuf_len~0=v_main_~tagbuf_len~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~tagbuf_len~0, main_~t~0] {1188#true} is VALID [2022-04-15 00:34:00,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {1188#true} [165] L29-->L29-1: Formula: (<= 1 v_main_~tagbuf_len~0_9) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} OutVars{main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} AuxVars[] AssignedVars[] {1193#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-15 00:34:00,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {1193#(<= 1 main_~tagbuf_len~0)} [167] L29-1-->L32-2: Formula: (and (= v_main_~t~0_14 0) (= v_main_~tagbuf_len~0_13 (+ (- 1) v_main_~tagbuf_len~0_14))) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_14} OutVars{main_~t~0=v_main_~t~0_14, main_#t~pre2=|v_main_#t~pre2_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_13} AuxVars[] AssignedVars[main_#t~pre2, main_~tagbuf_len~0, main_~t~0] {1194#(and (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-15 00:34:00,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {1194#(and (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1194#(and (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-15 00:34:00,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {1194#(and (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [175] L33-->L38: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (not (= v_main_~t~0_22 v_main_~tagbuf_len~0_18)) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} OutVars{main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} AuxVars[] AssignedVars[] {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-15 00:34:00,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [180] L38-->L41: Formula: (= |v_main_#t~nondet3_5| 0) InVars {main_#t~nondet3=|v_main_#t~nondet3_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-15 00:34:00,270 INFO L272 TraceCheckUtils]: 11: Hoare triple {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [185] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_35) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {1188#true} is VALID [2022-04-15 00:34:00,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {1188#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1188#true} is VALID [2022-04-15 00:34:00,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {1188#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,273 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1188#true} {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [220] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_35) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-15 00:34:00,273 INFO L272 TraceCheckUtils]: 16: Hoare triple {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [192] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~t~0_36 v_main_~tagbuf_len~0_23) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_36, main_~tagbuf_len~0=v_main_~tagbuf_len~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {1188#true} is VALID [2022-04-15 00:34:00,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {1188#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1188#true} is VALID [2022-04-15 00:34:00,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {1188#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,273 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1188#true} {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [221] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~t~0_36 v_main_~tagbuf_len~0_23) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_36, main_~tagbuf_len~0=v_main_~tagbuf_len~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-15 00:34:00,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {1195#(and (not (= main_~tagbuf_len~0 0)) (= main_~t~0 0) (< 0 (+ main_~tagbuf_len~0 1)))} [196] L42-->L32-2: Formula: (= v_main_~t~0_27 (+ v_main_~t~0_28 1)) InVars {main_~t~0=v_main_~t~0_28} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~t~0=v_main_~t~0_27} AuxVars[] AssignedVars[main_#t~post4, main_~t~0] {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-15 00:34:00,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-15 00:34:00,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} [175] L33-->L38: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (not (= v_main_~t~0_22 v_main_~tagbuf_len~0_18)) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} OutVars{main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} AuxVars[] AssignedVars[] {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-15 00:34:00,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} [179] L38-->L32-3: Formula: (not (= |v_main_#t~nondet3_3| 0)) InVars {main_#t~nondet3=|v_main_#t~nondet3_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-15 00:34:00,276 INFO L272 TraceCheckUtils]: 25: Hoare triple {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} [173] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {1188#true} is VALID [2022-04-15 00:34:00,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1188#true} is VALID [2022-04-15 00:34:00,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {1188#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {1188#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,282 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1188#true} {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} [222] __VERIFIER_assertEXIT-->L45: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} is VALID [2022-04-15 00:34:00,282 INFO L272 TraceCheckUtils]: 30: Hoare triple {1204#(and (not (= main_~tagbuf_len~0 0)) (<= main_~t~0 1) (< 0 (+ main_~tagbuf_len~0 1)))} [176] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~t~0_38 v_main_~tagbuf_len~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~t~0=v_main_~t~0_38, main_~tagbuf_len~0=v_main_~tagbuf_len~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {1209#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:34:00,283 INFO L290 TraceCheckUtils]: 31: Hoare triple {1209#(not (= |__VERIFIER_assert_#in~cond| 0))} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1210#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:34:00,283 INFO L290 TraceCheckUtils]: 32: Hoare triple {1210#(not (= __VERIFIER_assert_~cond 0))} [182] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1189#false} is VALID [2022-04-15 00:34:00,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} [189] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1189#false} is VALID [2022-04-15 00:34:00,283 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 00:34:00,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:34:00,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5166770] [2022-04-15 00:34:00,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5166770] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:34:00,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660712731] [2022-04-15 00:34:00,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:34:00,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:34:00,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:34:00,292 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:34:00,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 00:34:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:34:00,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 00:34:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:34:00,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:34:00,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} [159] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1188#true} is VALID [2022-04-15 00:34:00,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} [163] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~tagbuf_len~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~t~0=v_main_~t~0_9, main_~tagbuf_len~0=v_main_~tagbuf_len~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~tagbuf_len~0, main_~t~0] {1188#true} is VALID [2022-04-15 00:34:00,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {1188#true} [165] L29-->L29-1: Formula: (<= 1 v_main_~tagbuf_len~0_9) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} OutVars{main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} AuxVars[] AssignedVars[] {1193#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-15 00:34:00,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {1193#(<= 1 main_~tagbuf_len~0)} [167] L29-1-->L32-2: Formula: (and (= v_main_~t~0_14 0) (= v_main_~tagbuf_len~0_13 (+ (- 1) v_main_~tagbuf_len~0_14))) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_14} OutVars{main_~t~0=v_main_~t~0_14, main_#t~pre2=|v_main_#t~pre2_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_13} AuxVars[] AssignedVars[main_#t~pre2, main_~tagbuf_len~0, main_~t~0] {1236#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} is VALID [2022-04-15 00:34:00,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {1236#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1236#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} is VALID [2022-04-15 00:34:00,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {1236#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} [175] L33-->L38: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (not (= v_main_~t~0_22 v_main_~tagbuf_len~0_18)) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} OutVars{main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} AuxVars[] AssignedVars[] {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-15 00:34:00,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} [180] L38-->L41: Formula: (= |v_main_#t~nondet3_5| 0) InVars {main_#t~nondet3=|v_main_#t~nondet3_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-15 00:34:00,888 INFO L272 TraceCheckUtils]: 11: Hoare triple {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} [185] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_35) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {1188#true} is VALID [2022-04-15 00:34:00,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {1188#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1188#true} is VALID [2022-04-15 00:34:00,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {1188#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,888 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1188#true} {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} [220] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_35) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-15 00:34:00,889 INFO L272 TraceCheckUtils]: 16: Hoare triple {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} [192] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~t~0_36 v_main_~tagbuf_len~0_23) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_36, main_~tagbuf_len~0=v_main_~tagbuf_len~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {1188#true} is VALID [2022-04-15 00:34:00,889 INFO L290 TraceCheckUtils]: 17: Hoare triple {1188#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1188#true} is VALID [2022-04-15 00:34:00,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {1188#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,889 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1188#true} {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} [221] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~t~0_36 v_main_~tagbuf_len~0_23) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_36, main_~tagbuf_len~0=v_main_~tagbuf_len~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2022-04-15 00:34:00,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {1243#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} [196] L42-->L32-2: Formula: (= v_main_~t~0_27 (+ v_main_~t~0_28 1)) InVars {main_~t~0=v_main_~t~0_28} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~t~0=v_main_~t~0_27} AuxVars[] AssignedVars[main_#t~post4, main_~t~0] {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-15 00:34:00,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-15 00:34:00,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} [175] L33-->L38: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (not (= v_main_~t~0_22 v_main_~tagbuf_len~0_18)) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} OutVars{main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} AuxVars[] AssignedVars[] {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-15 00:34:00,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} [179] L38-->L32-3: Formula: (not (= |v_main_#t~nondet3_3| 0)) InVars {main_#t~nondet3=|v_main_#t~nondet3_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-15 00:34:00,892 INFO L272 TraceCheckUtils]: 25: Hoare triple {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} [173] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {1188#true} is VALID [2022-04-15 00:34:00,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1188#true} is VALID [2022-04-15 00:34:00,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {1188#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {1188#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:00,893 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1188#true} {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} [222] __VERIFIER_assertEXIT-->L45: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} is VALID [2022-04-15 00:34:00,893 INFO L272 TraceCheckUtils]: 30: Hoare triple {1280#(and (< main_~t~0 (+ main_~tagbuf_len~0 1)) (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1))} [176] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~t~0_38 v_main_~tagbuf_len~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~t~0=v_main_~t~0_38, main_~tagbuf_len~0=v_main_~tagbuf_len~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {1308#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:34:00,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {1308#(<= 1 |__VERIFIER_assert_#in~cond|)} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1312#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:34:00,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {1312#(<= 1 __VERIFIER_assert_~cond)} [182] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1189#false} is VALID [2022-04-15 00:34:00,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} [189] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1189#false} is VALID [2022-04-15 00:34:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 00:34:00,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:34:01,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {1189#false} [189] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1189#false} is VALID [2022-04-15 00:34:01,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {1312#(<= 1 __VERIFIER_assert_~cond)} [182] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1189#false} is VALID [2022-04-15 00:34:01,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {1308#(<= 1 |__VERIFIER_assert_#in~cond|)} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1312#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:34:01,088 INFO L272 TraceCheckUtils]: 30: Hoare triple {1328#(<= main_~t~0 main_~tagbuf_len~0)} [176] L45-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~t~0_38 v_main_~tagbuf_len~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~t~0=v_main_~t~0_38, main_~tagbuf_len~0=v_main_~tagbuf_len~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {1308#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:34:01,089 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1188#true} {1328#(<= main_~t~0 main_~tagbuf_len~0)} [222] __VERIFIER_assertEXIT-->L45: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {1328#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-15 00:34:01,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {1188#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:01,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {1188#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:01,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {1188#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1188#true} is VALID [2022-04-15 00:34:01,090 INFO L272 TraceCheckUtils]: 25: Hoare triple {1328#(<= main_~t~0 main_~tagbuf_len~0)} [173] L32-3-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_37) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~t~0=v_main_~t~0_37} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {1188#true} is VALID [2022-04-15 00:34:01,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {1328#(<= main_~t~0 main_~tagbuf_len~0)} [179] L38-->L32-3: Formula: (not (= |v_main_#t~nondet3_3| 0)) InVars {main_#t~nondet3=|v_main_#t~nondet3_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {1328#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-15 00:34:01,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {1328#(<= main_~t~0 main_~tagbuf_len~0)} [175] L33-->L38: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (not (= v_main_~t~0_22 v_main_~tagbuf_len~0_18)) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} OutVars{main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} AuxVars[] AssignedVars[] {1328#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-15 00:34:01,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {1328#(<= main_~t~0 main_~tagbuf_len~0)} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1328#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-15 00:34:01,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} [196] L42-->L32-2: Formula: (= v_main_~t~0_27 (+ v_main_~t~0_28 1)) InVars {main_~t~0=v_main_~t~0_28} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~t~0=v_main_~t~0_27} AuxVars[] AssignedVars[main_#t~post4, main_~t~0] {1328#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-15 00:34:01,092 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1188#true} {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} [221] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= v_main_~t~0_36 v_main_~tagbuf_len~0_23) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_36, main_~tagbuf_len~0=v_main_~tagbuf_len~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2022-04-15 00:34:01,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:01,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {1188#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:01,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {1188#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1188#true} is VALID [2022-04-15 00:34:01,092 INFO L272 TraceCheckUtils]: 16: Hoare triple {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} [192] L41-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= v_main_~t~0_36 v_main_~tagbuf_len~0_23) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~t~0=v_main_~t~0_36, main_~tagbuf_len~0=v_main_~tagbuf_len~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~tagbuf_len~0, main_~t~0] {1188#true} is VALID [2022-04-15 00:34:01,093 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1188#true} {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} [220] __VERIFIER_assertEXIT-->L41-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~t~0_35) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2022-04-15 00:34:01,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#true} [191] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:01,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {1188#true} [183] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:01,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {1188#true} [177] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1188#true} is VALID [2022-04-15 00:34:01,094 INFO L272 TraceCheckUtils]: 11: Hoare triple {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} [185] L41-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~t~0_35) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~t~0=v_main_~t~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~t~0] {1188#true} is VALID [2022-04-15 00:34:01,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} [180] L38-->L41: Formula: (= |v_main_#t~nondet3_5| 0) InVars {main_#t~nondet3=|v_main_#t~nondet3_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2022-04-15 00:34:01,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {1328#(<= main_~t~0 main_~tagbuf_len~0)} [175] L33-->L38: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (not (= v_main_~t~0_22 v_main_~tagbuf_len~0_18)) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} OutVars{main_~t~0=v_main_~t~0_22, main_#t~nondet3=|v_main_#t~nondet3_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_18} AuxVars[] AssignedVars[] {1356#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2022-04-15 00:34:01,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {1328#(<= main_~t~0 main_~tagbuf_len~0)} [171] L32-2-->L33: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1328#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-15 00:34:01,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {1193#(<= 1 main_~tagbuf_len~0)} [167] L29-1-->L32-2: Formula: (and (= v_main_~t~0_14 0) (= v_main_~tagbuf_len~0_13 (+ (- 1) v_main_~tagbuf_len~0_14))) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_14} OutVars{main_~t~0=v_main_~t~0_14, main_#t~pre2=|v_main_#t~pre2_1|, main_~tagbuf_len~0=v_main_~tagbuf_len~0_13} AuxVars[] AssignedVars[main_#t~pre2, main_~tagbuf_len~0, main_~t~0] {1328#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2022-04-15 00:34:01,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {1188#true} [165] L29-->L29-1: Formula: (<= 1 v_main_~tagbuf_len~0_9) InVars {main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} OutVars{main_~tagbuf_len~0=v_main_~tagbuf_len~0_9} AuxVars[] AssignedVars[] {1193#(<= 1 main_~tagbuf_len~0)} is VALID [2022-04-15 00:34:01,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} [163] mainENTRY-->L29: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~tagbuf_len~0_5 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~t~0=v_main_~t~0_9, main_~tagbuf_len~0=v_main_~tagbuf_len~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~tagbuf_len~0, main_~t~0] {1188#true} is VALID [2022-04-15 00:34:01,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} [160] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:01,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} [216] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:01,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} [164] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:01,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#true} [161] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1188#true} is VALID [2022-04-15 00:34:01,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} [159] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1188#true} is VALID [2022-04-15 00:34:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-15 00:34:01,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660712731] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:34:01,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:34:01,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 16 [2022-04-15 00:34:01,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231972461] [2022-04-15 00:34:01,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:34:01,097 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 34 [2022-04-15 00:34:01,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:34:01,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-15 00:34:01,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:34:01,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 00:34:01,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:34:01,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 00:34:01,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-04-15 00:34:01,136 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-15 00:34:02,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:34:02,184 INFO L93 Difference]: Finished difference Result 80 states and 107 transitions. [2022-04-15 00:34:02,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 00:34:02,184 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 34 [2022-04-15 00:34:02,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:34:02,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-15 00:34:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-04-15 00:34:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-15 00:34:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 101 transitions. [2022-04-15 00:34:02,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 101 transitions. [2022-04-15 00:34:02,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:34:02,278 INFO L225 Difference]: With dead ends: 80 [2022-04-15 00:34:02,278 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:34:02,283 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2022-04-15 00:34:02,287 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 103 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 00:34:02,287 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 66 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 00:34:02,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:34:02,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:34:02,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:34:02,287 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-15 00:34:02,287 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-15 00:34:02,288 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-15 00:34:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:34:02,288 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:34:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:34:02,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:34:02,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:34:02,288 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-15 00:34:02,288 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-15 00:34:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:34:02,288 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:34:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:34:02,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:34:02,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:34:02,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:34:02,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:34:02,288 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-15 00:34:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:34:02,289 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2022-04-15 00:34:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:34:02,289 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:34:02,289 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2022-04-15 00:34:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:34:02,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:34:02,291 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:34:02,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 00:34:02,493 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:34:02,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:34:02,771 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 00:34:02,771 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:34:02,772 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:34:02,772 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:34:02,772 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 00:34:02,772 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:34:02,772 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:34:02,772 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 77) the Hoare annotation is: true [2022-04-15 00:34:02,772 INFO L882 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-04-15 00:34:02,772 INFO L882 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-04-15 00:34:02,772 INFO L885 garLoopResultBuilder]: At program point L74(lines 25 77) the Hoare annotation is: true [2022-04-15 00:34:02,772 INFO L878 garLoopResultBuilder]: At program point L32-2(lines 32 44) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,772 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 24 77) no Hoare annotation was computed. [2022-04-15 00:34:02,772 INFO L878 garLoopResultBuilder]: At program point L32-3(lines 32 44) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,772 INFO L882 garLoopResultBuilder]: For program point L33(lines 33 37) no Hoare annotation was computed. [2022-04-15 00:34:02,772 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 24 77) no Hoare annotation was computed. [2022-04-15 00:34:02,772 INFO L878 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,773 INFO L878 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,773 INFO L882 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2022-04-15 00:34:02,773 INFO L882 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-04-15 00:34:02,773 INFO L878 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,773 INFO L878 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,773 INFO L878 garLoopResultBuilder]: At program point L48-2(lines 48 72) the Hoare annotation is: (and (<= 1 main_~tagbuf_len~0) (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,773 INFO L878 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,773 INFO L878 garLoopResultBuilder]: At program point L48-3(lines 48 72) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,773 INFO L882 garLoopResultBuilder]: For program point L49(lines 49 53) no Hoare annotation was computed. [2022-04-15 00:34:02,773 INFO L882 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2022-04-15 00:34:02,773 INFO L878 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,773 INFO L878 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,773 INFO L882 garLoopResultBuilder]: For program point L54(lines 54 68) no Hoare annotation was computed. [2022-04-15 00:34:02,773 INFO L878 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,773 INFO L878 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,773 INFO L882 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2022-04-15 00:34:02,773 INFO L878 garLoopResultBuilder]: At program point L60-1(line 60) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,774 INFO L878 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,774 INFO L882 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2022-04-15 00:34:02,774 INFO L882 garLoopResultBuilder]: For program point L55(lines 55 64) no Hoare annotation was computed. [2022-04-15 00:34:02,774 INFO L882 garLoopResultBuilder]: For program point L66(lines 66 68) no Hoare annotation was computed. [2022-04-15 00:34:02,774 INFO L882 garLoopResultBuilder]: For program point L59(lines 59 63) no Hoare annotation was computed. [2022-04-15 00:34:02,774 INFO L878 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,774 INFO L878 garLoopResultBuilder]: At program point L54-1(lines 54 68) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,774 INFO L878 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2022-04-15 00:34:02,774 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-15 00:34:02,774 INFO L882 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-15 00:34:02,774 INFO L882 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-15 00:34:02,774 INFO L882 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-15 00:34:02,774 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-15 00:34:02,774 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-15 00:34:02,777 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-15 00:34:02,777 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:34:02,780 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:34:02,781 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 00:34:02,781 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:34:02,781 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:34:02,781 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 00:34:02,781 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 00:34:02,781 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:34:02,781 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:34:02,781 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:34:02,781 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-15 00:34:02,781 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:34:02,781 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:34:02,781 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:34:02,781 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-15 00:34:02,782 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-15 00:34:02,782 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-15 00:34:02,783 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 00:34:02,784 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 00:34:02,784 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:34:02,785 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-15 00:34:02,785 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-15 00:34:02,785 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-04-15 00:34:02,785 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-15 00:34:02,785 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-15 00:34:02,785 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-15 00:34:02,785 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-15 00:34:02,785 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-15 00:34:02,786 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-04-15 00:34:02,786 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-04-15 00:34:02,786 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-04-15 00:34:02,786 INFO L163 areAnnotationChecker]: CFG has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:34:02,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:34:02 BasicIcfg [2022-04-15 00:34:02,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:34:02,793 INFO L158 Benchmark]: Toolchain (without parser) took 6409.81ms. Allocated memory was 207.6MB in the beginning and 273.7MB in the end (delta: 66.1MB). Free memory was 151.4MB in the beginning and 137.2MB in the end (delta: 14.3MB). Peak memory consumption was 80.4MB. Max. memory is 8.0GB. [2022-04-15 00:34:02,794 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory is still 167.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:34:02,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.99ms. Allocated memory was 207.6MB in the beginning and 273.7MB in the end (delta: 66.1MB). Free memory was 151.2MB in the beginning and 244.4MB in the end (delta: -93.2MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2022-04-15 00:34:02,794 INFO L158 Benchmark]: Boogie Preprocessor took 39.81ms. Allocated memory is still 273.7MB. Free memory was 244.4MB in the beginning and 242.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:34:02,794 INFO L158 Benchmark]: RCFGBuilder took 306.48ms. Allocated memory is still 273.7MB. Free memory was 242.3MB in the beginning and 226.5MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-04-15 00:34:02,794 INFO L158 Benchmark]: IcfgTransformer took 34.76ms. Allocated memory is still 273.7MB. Free memory was 226.5MB in the beginning and 224.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:34:02,794 INFO L158 Benchmark]: TraceAbstraction took 5794.17ms. Allocated memory is still 273.7MB. Free memory was 223.9MB in the beginning and 137.2MB in the end (delta: 86.8MB). Peak memory consumption was 88.3MB. Max. memory is 8.0GB. [2022-04-15 00:34:02,795 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory is still 167.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.99ms. Allocated memory was 207.6MB in the beginning and 273.7MB in the end (delta: 66.1MB). Free memory was 151.2MB in the beginning and 244.4MB in the end (delta: -93.2MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.81ms. Allocated memory is still 273.7MB. Free memory was 244.4MB in the beginning and 242.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 306.48ms. Allocated memory is still 273.7MB. Free memory was 242.3MB in the beginning and 226.5MB in the end (delta: 15.8MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * IcfgTransformer took 34.76ms. Allocated memory is still 273.7MB. Free memory was 226.5MB in the beginning and 224.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5794.17ms. Allocated memory is still 273.7MB. Free memory was 223.9MB in the beginning and 137.2MB in the end (delta: 86.8MB). Peak memory consumption was 88.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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 4 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 304 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 279 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 324 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 963 IncrementalHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 324 mSolverCounterUnsat, 199 mSDtfsCounter, 963 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=4, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 69 PreInvPairs, 105 NumberOfFragments, 161 HoareAnnotationTreeSize, 69 FomulaSimplifications, 165 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 24 FomulaSimplificationsInter, 445 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 544 SizeOfPredicates, 1 NumberOfNonLiveVariables, 93 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 60/67 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 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: t <= tagbuf_len && 0 <= t - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: (1 <= tagbuf_len && t <= tagbuf_len) && 0 <= t RESULT: Ultimate proved your program to be correct! [2022-04-15 00:34:02,823 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...