/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:51:19,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:51:19,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:51:19,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:51:19,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:51:19,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:51:19,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:51:19,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:51:19,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:51:19,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:51:19,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:51:19,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:51:19,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:51:19,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:51:19,875 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:51:19,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:51:19,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:51:19,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:51:19,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:51:19,888 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:51:19,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:51:19,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:51:19,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:51:19,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:51:19,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:51:19,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:51:19,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:51:19,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:51:19,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:51:19,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:51:19,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:51:19,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:51:19,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:51:19,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:51:19,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:51:19,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:51:19,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:51:19,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:51:19,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:51:19,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:51:19,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:51:19,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:51:19,956 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:51:19,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:51:19,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:51:19,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:51:19,962 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:51:19,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:51:19,964 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:51:19,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:51:19,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:51:19,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:51:19,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:51:19,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:51:19,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:51:19,965 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:51:19,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:51:19,965 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:51:19,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:51:19,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:51:19,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:51:19,966 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:51:19,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:51:19,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:51:19,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:51:19,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:51:19,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:51:19,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:51:19,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:51:19,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:51:19,968 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:51:19,968 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:51:20,280 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:51:20,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:51:20,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:51:20,299 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:51:20,299 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:51:20,300 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2020-07-17 22:51:20,374 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcd364f42/52be3180fa664d76861bf976d626343a/FLAGe5f2537c9 [2020-07-17 22:51:20,844 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:51:20,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2020-07-17 22:51:20,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcd364f42/52be3180fa664d76861bf976d626343a/FLAGe5f2537c9 [2020-07-17 22:51:21,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcd364f42/52be3180fa664d76861bf976d626343a [2020-07-17 22:51:21,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:51:21,215 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:51:21,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:21,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:51:21,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:51:21,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:21" (1/1) ... [2020-07-17 22:51:21,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@225b46a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:21, skipping insertion in model container [2020-07-17 22:51:21,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:21" (1/1) ... [2020-07-17 22:51:21,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:51:21,253 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:51:21,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:21,447 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:51:21,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:21,491 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:51:21,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:21 WrapperNode [2020-07-17 22:51:21,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:21,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:51:21,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:51:21,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:51:21,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:21" (1/1) ... [2020-07-17 22:51:21,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:21" (1/1) ... [2020-07-17 22:51:21,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:21" (1/1) ... [2020-07-17 22:51:21,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:21" (1/1) ... [2020-07-17 22:51:21,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:21" (1/1) ... [2020-07-17 22:51:21,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:21" (1/1) ... [2020-07-17 22:51:21,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:21" (1/1) ... [2020-07-17 22:51:21,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:51:21,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:51:21,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:51:21,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:51:21,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:51:21,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:51:21,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:51:21,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:51:21,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:51:21,714 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:51:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:51:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:51:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:51:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:51:21,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:51:21,715 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:51:21,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:51:21,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:51:22,235 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:51:22,236 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-17 22:51:22,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:22 BoogieIcfgContainer [2020-07-17 22:51:22,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:51:22,243 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:51:22,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:51:22,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:51:22,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:51:21" (1/3) ... [2020-07-17 22:51:22,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d996475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:22, skipping insertion in model container [2020-07-17 22:51:22,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:21" (2/3) ... [2020-07-17 22:51:22,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d996475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:22, skipping insertion in model container [2020-07-17 22:51:22,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:22" (3/3) ... [2020-07-17 22:51:22,251 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i [2020-07-17 22:51:22,263 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:51:22,273 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:51:22,289 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:51:22,316 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:51:22,316 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:51:22,317 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:51:22,317 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:51:22,317 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:51:22,317 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:51:22,318 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:51:22,318 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:51:22,340 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-07-17 22:51:22,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-17 22:51:22,347 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:22,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:22,349 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:22,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:22,355 INFO L82 PathProgramCache]: Analyzing trace with hash -234903868, now seen corresponding path program 1 times [2020-07-17 22:51:22,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:22,365 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009915053] [2020-07-17 22:51:22,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:22,513 INFO L280 TraceCheckUtils]: 0: Hoare triple {50#true} assume true; {50#true} is VALID [2020-07-17 22:51:22,514 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {50#true} {50#true} #116#return; {50#true} is VALID [2020-07-17 22:51:22,516 INFO L263 TraceCheckUtils]: 0: Hoare triple {50#true} call ULTIMATE.init(); {50#true} is VALID [2020-07-17 22:51:22,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {50#true} assume true; {50#true} is VALID [2020-07-17 22:51:22,517 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {50#true} {50#true} #116#return; {50#true} is VALID [2020-07-17 22:51:22,517 INFO L263 TraceCheckUtils]: 3: Hoare triple {50#true} call #t~ret10 := main(); {50#true} is VALID [2020-07-17 22:51:22,518 INFO L280 TraceCheckUtils]: 4: Hoare triple {50#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~tagbuf_len~0 := #t~nondet0;havoc #t~nondet0; {50#true} is VALID [2020-07-17 22:51:22,518 INFO L280 TraceCheckUtils]: 5: Hoare triple {50#true} assume ~tagbuf_len~0 >= 1; {50#true} is VALID [2020-07-17 22:51:22,519 INFO L280 TraceCheckUtils]: 6: Hoare triple {50#true} ~t~0 := 0;#t~pre1 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre1; {50#true} is VALID [2020-07-17 22:51:22,520 INFO L280 TraceCheckUtils]: 7: Hoare triple {50#true} assume false; {51#false} is VALID [2020-07-17 22:51:22,521 INFO L263 TraceCheckUtils]: 8: Hoare triple {51#false} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {51#false} is VALID [2020-07-17 22:51:22,521 INFO L280 TraceCheckUtils]: 9: Hoare triple {51#false} ~cond := #in~cond; {51#false} is VALID [2020-07-17 22:51:22,521 INFO L280 TraceCheckUtils]: 10: Hoare triple {51#false} assume 0 == ~cond; {51#false} is VALID [2020-07-17 22:51:22,522 INFO L280 TraceCheckUtils]: 11: Hoare triple {51#false} assume !false; {51#false} is VALID [2020-07-17 22:51:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:22,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009915053] [2020-07-17 22:51:22,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:22,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-17 22:51:22,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944631525] [2020-07-17 22:51:22,532 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-17 22:51:22,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:22,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:51:22,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:22,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:51:22,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:22,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:51:22,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:51:22,604 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2020-07-17 22:51:22,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:22,817 INFO L93 Difference]: Finished difference Result 87 states and 156 transitions. [2020-07-17 22:51:22,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:51:22,818 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-17 22:51:22,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:22,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:51:22,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 156 transitions. [2020-07-17 22:51:22,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:51:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 156 transitions. [2020-07-17 22:51:22,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 156 transitions. [2020-07-17 22:51:23,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:23,200 INFO L225 Difference]: With dead ends: 87 [2020-07-17 22:51:23,200 INFO L226 Difference]: Without dead ends: 42 [2020-07-17 22:51:23,208 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:51:23,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-17 22:51:23,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-17 22:51:23,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:23,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2020-07-17 22:51:23,301 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-17 22:51:23,301 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-17 22:51:23,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:23,316 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2020-07-17 22:51:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2020-07-17 22:51:23,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:23,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:23,320 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-17 22:51:23,320 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-17 22:51:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:23,344 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2020-07-17 22:51:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2020-07-17 22:51:23,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:23,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:23,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:23,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:23,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-17 22:51:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2020-07-17 22:51:23,360 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 12 [2020-07-17 22:51:23,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:23,360 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2020-07-17 22:51:23,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:51:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2020-07-17 22:51:23,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:51:23,363 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:23,364 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:23,364 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:51:23,366 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:23,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:23,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1276958999, now seen corresponding path program 1 times [2020-07-17 22:51:23,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:23,368 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361429189] [2020-07-17 22:51:23,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:23,490 INFO L280 TraceCheckUtils]: 0: Hoare triple {336#true} assume true; {336#true} is VALID [2020-07-17 22:51:23,491 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {336#true} {336#true} #116#return; {336#true} is VALID [2020-07-17 22:51:23,491 INFO L263 TraceCheckUtils]: 0: Hoare triple {336#true} call ULTIMATE.init(); {336#true} is VALID [2020-07-17 22:51:23,492 INFO L280 TraceCheckUtils]: 1: Hoare triple {336#true} assume true; {336#true} is VALID [2020-07-17 22:51:23,492 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {336#true} {336#true} #116#return; {336#true} is VALID [2020-07-17 22:51:23,492 INFO L263 TraceCheckUtils]: 3: Hoare triple {336#true} call #t~ret10 := main(); {336#true} is VALID [2020-07-17 22:51:23,493 INFO L280 TraceCheckUtils]: 4: Hoare triple {336#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~tagbuf_len~0 := #t~nondet0;havoc #t~nondet0; {336#true} is VALID [2020-07-17 22:51:23,493 INFO L280 TraceCheckUtils]: 5: Hoare triple {336#true} assume ~tagbuf_len~0 >= 1; {336#true} is VALID [2020-07-17 22:51:23,494 INFO L280 TraceCheckUtils]: 6: Hoare triple {336#true} ~t~0 := 0;#t~pre1 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre1; {340#(<= 0 main_~t~0)} is VALID [2020-07-17 22:51:23,495 INFO L280 TraceCheckUtils]: 7: Hoare triple {340#(<= 0 main_~t~0)} assume !false; {340#(<= 0 main_~t~0)} is VALID [2020-07-17 22:51:23,496 INFO L280 TraceCheckUtils]: 8: Hoare triple {340#(<= 0 main_~t~0)} assume ~t~0 == ~tagbuf_len~0; {340#(<= 0 main_~t~0)} is VALID [2020-07-17 22:51:23,498 INFO L263 TraceCheckUtils]: 9: Hoare triple {340#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {341#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:23,499 INFO L280 TraceCheckUtils]: 10: Hoare triple {341#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {342#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:23,500 INFO L280 TraceCheckUtils]: 11: Hoare triple {342#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {337#false} is VALID [2020-07-17 22:51:23,500 INFO L280 TraceCheckUtils]: 12: Hoare triple {337#false} assume !false; {337#false} is VALID [2020-07-17 22:51:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:23,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361429189] [2020-07-17 22:51:23,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:23,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:51:23,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031475820] [2020-07-17 22:51:23,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:51:23,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:23,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:23,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:23,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:23,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:23,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:23,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:51:23,525 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 5 states. [2020-07-17 22:51:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:23,989 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2020-07-17 22:51:23,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:51:23,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:51:23,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:23,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2020-07-17 22:51:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:23,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2020-07-17 22:51:23,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2020-07-17 22:51:24,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:24,107 INFO L225 Difference]: With dead ends: 48 [2020-07-17 22:51:24,107 INFO L226 Difference]: Without dead ends: 46 [2020-07-17 22:51:24,109 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-17 22:51:24,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-17 22:51:24,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:24,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2020-07-17 22:51:24,143 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2020-07-17 22:51:24,143 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2020-07-17 22:51:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:24,148 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2020-07-17 22:51:24,148 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2020-07-17 22:51:24,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:24,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:24,150 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2020-07-17 22:51:24,151 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2020-07-17 22:51:24,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:24,156 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2020-07-17 22:51:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2020-07-17 22:51:24,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:24,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:24,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:24,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-17 22:51:24,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2020-07-17 22:51:24,162 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 13 [2020-07-17 22:51:24,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:24,163 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2020-07-17 22:51:24,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:24,163 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2020-07-17 22:51:24,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:51:24,164 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:24,165 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:24,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:51:24,166 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:24,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:24,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1880963538, now seen corresponding path program 1 times [2020-07-17 22:51:24,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:24,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338888199] [2020-07-17 22:51:24,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:24,249 INFO L280 TraceCheckUtils]: 0: Hoare triple {581#true} assume true; {581#true} is VALID [2020-07-17 22:51:24,249 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {581#true} {581#true} #116#return; {581#true} is VALID [2020-07-17 22:51:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:24,260 INFO L280 TraceCheckUtils]: 0: Hoare triple {581#true} ~cond := #in~cond; {581#true} is VALID [2020-07-17 22:51:24,261 INFO L280 TraceCheckUtils]: 1: Hoare triple {581#true} assume !(0 == ~cond); {581#true} is VALID [2020-07-17 22:51:24,262 INFO L280 TraceCheckUtils]: 2: Hoare triple {581#true} assume true; {581#true} is VALID [2020-07-17 22:51:24,263 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {581#true} {585#(<= main_~t~0 main_~tagbuf_len~0)} #120#return; {585#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:24,264 INFO L263 TraceCheckUtils]: 0: Hoare triple {581#true} call ULTIMATE.init(); {581#true} is VALID [2020-07-17 22:51:24,264 INFO L280 TraceCheckUtils]: 1: Hoare triple {581#true} assume true; {581#true} is VALID [2020-07-17 22:51:24,264 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {581#true} {581#true} #116#return; {581#true} is VALID [2020-07-17 22:51:24,265 INFO L263 TraceCheckUtils]: 3: Hoare triple {581#true} call #t~ret10 := main(); {581#true} is VALID [2020-07-17 22:51:24,265 INFO L280 TraceCheckUtils]: 4: Hoare triple {581#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~tagbuf_len~0 := #t~nondet0;havoc #t~nondet0; {581#true} is VALID [2020-07-17 22:51:24,266 INFO L280 TraceCheckUtils]: 5: Hoare triple {581#true} assume ~tagbuf_len~0 >= 1; {581#true} is VALID [2020-07-17 22:51:24,266 INFO L280 TraceCheckUtils]: 6: Hoare triple {581#true} ~t~0 := 0;#t~pre1 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre1; {581#true} is VALID [2020-07-17 22:51:24,266 INFO L280 TraceCheckUtils]: 7: Hoare triple {581#true} assume !false; {581#true} is VALID [2020-07-17 22:51:24,267 INFO L280 TraceCheckUtils]: 8: Hoare triple {581#true} assume ~t~0 == ~tagbuf_len~0; {585#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:24,268 INFO L263 TraceCheckUtils]: 9: Hoare triple {585#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {581#true} is VALID [2020-07-17 22:51:24,269 INFO L280 TraceCheckUtils]: 10: Hoare triple {581#true} ~cond := #in~cond; {581#true} is VALID [2020-07-17 22:51:24,269 INFO L280 TraceCheckUtils]: 11: Hoare triple {581#true} assume !(0 == ~cond); {581#true} is VALID [2020-07-17 22:51:24,269 INFO L280 TraceCheckUtils]: 12: Hoare triple {581#true} assume true; {581#true} is VALID [2020-07-17 22:51:24,271 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {581#true} {585#(<= main_~t~0 main_~tagbuf_len~0)} #120#return; {585#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:24,273 INFO L263 TraceCheckUtils]: 14: Hoare triple {585#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {590#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:24,274 INFO L280 TraceCheckUtils]: 15: Hoare triple {590#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {591#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:24,275 INFO L280 TraceCheckUtils]: 16: Hoare triple {591#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {582#false} is VALID [2020-07-17 22:51:24,275 INFO L280 TraceCheckUtils]: 17: Hoare triple {582#false} assume !false; {582#false} is VALID [2020-07-17 22:51:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:24,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338888199] [2020-07-17 22:51:24,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:24,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:51:24,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303172345] [2020-07-17 22:51:24,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-17 22:51:24,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:24,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:51:24,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:24,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:51:24,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:24,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:51:24,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:51:24,308 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand 5 states. [2020-07-17 22:51:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:24,631 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2020-07-17 22:51:24,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:51:24,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-17 22:51:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2020-07-17 22:51:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:51:24,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2020-07-17 22:51:24,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2020-07-17 22:51:24,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:24,721 INFO L225 Difference]: With dead ends: 52 [2020-07-17 22:51:24,722 INFO L226 Difference]: Without dead ends: 40 [2020-07-17 22:51:24,723 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:24,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-17 22:51:24,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-17 22:51:24,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:24,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-17 22:51:24,744 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-17 22:51:24,744 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-17 22:51:24,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:24,748 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-07-17 22:51:24,748 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2020-07-17 22:51:24,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:24,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:24,749 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-17 22:51:24,749 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-17 22:51:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:24,752 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-07-17 22:51:24,753 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2020-07-17 22:51:24,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:24,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:24,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:24,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-17 22:51:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2020-07-17 22:51:24,757 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 18 [2020-07-17 22:51:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:24,757 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2020-07-17 22:51:24,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:51:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2020-07-17 22:51:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:51:24,758 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:24,758 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:24,759 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:51:24,759 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:24,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:24,759 INFO L82 PathProgramCache]: Analyzing trace with hash 996212544, now seen corresponding path program 1 times [2020-07-17 22:51:24,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:24,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58054327] [2020-07-17 22:51:24,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:24,844 INFO L280 TraceCheckUtils]: 0: Hoare triple {811#true} assume true; {811#true} is VALID [2020-07-17 22:51:24,845 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {811#true} {811#true} #116#return; {811#true} is VALID [2020-07-17 22:51:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:24,856 INFO L280 TraceCheckUtils]: 0: Hoare triple {811#true} ~cond := #in~cond; {811#true} is VALID [2020-07-17 22:51:24,856 INFO L280 TraceCheckUtils]: 1: Hoare triple {811#true} assume !(0 == ~cond); {811#true} is VALID [2020-07-17 22:51:24,856 INFO L280 TraceCheckUtils]: 2: Hoare triple {811#true} assume true; {811#true} is VALID [2020-07-17 22:51:24,858 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {811#true} {816#(<= main_~t~0 main_~tagbuf_len~0)} #128#return; {816#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:24,858 INFO L263 TraceCheckUtils]: 0: Hoare triple {811#true} call ULTIMATE.init(); {811#true} is VALID [2020-07-17 22:51:24,859 INFO L280 TraceCheckUtils]: 1: Hoare triple {811#true} assume true; {811#true} is VALID [2020-07-17 22:51:24,859 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {811#true} {811#true} #116#return; {811#true} is VALID [2020-07-17 22:51:24,859 INFO L263 TraceCheckUtils]: 3: Hoare triple {811#true} call #t~ret10 := main(); {811#true} is VALID [2020-07-17 22:51:24,859 INFO L280 TraceCheckUtils]: 4: Hoare triple {811#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~tagbuf_len~0 := #t~nondet0;havoc #t~nondet0; {811#true} is VALID [2020-07-17 22:51:24,860 INFO L280 TraceCheckUtils]: 5: Hoare triple {811#true} assume ~tagbuf_len~0 >= 1; {815#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:24,861 INFO L280 TraceCheckUtils]: 6: Hoare triple {815#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0;#t~pre1 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre1; {816#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:24,862 INFO L280 TraceCheckUtils]: 7: Hoare triple {816#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {816#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:24,863 INFO L280 TraceCheckUtils]: 8: Hoare triple {816#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {816#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:24,864 INFO L280 TraceCheckUtils]: 9: Hoare triple {816#(<= main_~t~0 main_~tagbuf_len~0)} assume 0 != #t~nondet2;havoc #t~nondet2; {816#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:24,864 INFO L263 TraceCheckUtils]: 10: Hoare triple {816#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {811#true} is VALID [2020-07-17 22:51:24,864 INFO L280 TraceCheckUtils]: 11: Hoare triple {811#true} ~cond := #in~cond; {811#true} is VALID [2020-07-17 22:51:24,865 INFO L280 TraceCheckUtils]: 12: Hoare triple {811#true} assume !(0 == ~cond); {811#true} is VALID [2020-07-17 22:51:24,865 INFO L280 TraceCheckUtils]: 13: Hoare triple {811#true} assume true; {811#true} is VALID [2020-07-17 22:51:24,866 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {811#true} {816#(<= main_~t~0 main_~tagbuf_len~0)} #128#return; {816#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:24,867 INFO L263 TraceCheckUtils]: 15: Hoare triple {816#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {821#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:24,868 INFO L280 TraceCheckUtils]: 16: Hoare triple {821#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {822#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:24,869 INFO L280 TraceCheckUtils]: 17: Hoare triple {822#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {812#false} is VALID [2020-07-17 22:51:24,869 INFO L280 TraceCheckUtils]: 18: Hoare triple {812#false} assume !false; {812#false} is VALID [2020-07-17 22:51:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:24,870 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58054327] [2020-07-17 22:51:24,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:24,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 22:51:24,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231902721] [2020-07-17 22:51:24,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-17 22:51:24,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:24,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:51:24,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:24,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:51:24,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:24,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:51:24,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:51:24,896 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 6 states. [2020-07-17 22:51:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:25,287 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2020-07-17 22:51:25,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:51:25,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-17 22:51:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:25,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2020-07-17 22:51:25,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:51:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2020-07-17 22:51:25,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2020-07-17 22:51:25,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:25,387 INFO L225 Difference]: With dead ends: 55 [2020-07-17 22:51:25,387 INFO L226 Difference]: Without dead ends: 53 [2020-07-17 22:51:25,388 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:51:25,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-17 22:51:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-07-17 22:51:25,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:25,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 51 states. [2020-07-17 22:51:25,417 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 51 states. [2020-07-17 22:51:25,417 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 51 states. [2020-07-17 22:51:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:25,421 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2020-07-17 22:51:25,422 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2020-07-17 22:51:25,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:25,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:25,423 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 53 states. [2020-07-17 22:51:25,423 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 53 states. [2020-07-17 22:51:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:25,427 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2020-07-17 22:51:25,427 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2020-07-17 22:51:25,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:25,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:25,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:25,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-17 22:51:25,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2020-07-17 22:51:25,432 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 19 [2020-07-17 22:51:25,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:25,432 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2020-07-17 22:51:25,432 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:51:25,433 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2020-07-17 22:51:25,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 22:51:25,434 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:25,434 INFO L422 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] [2020-07-17 22:51:25,434 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:51:25,434 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:25,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:25,435 INFO L82 PathProgramCache]: Analyzing trace with hash -381964826, now seen corresponding path program 1 times [2020-07-17 22:51:25,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:25,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23438272] [2020-07-17 22:51:25,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:25,559 INFO L280 TraceCheckUtils]: 0: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-17 22:51:25,560 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1087#true} {1087#true} #116#return; {1087#true} is VALID [2020-07-17 22:51:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:25,567 INFO L280 TraceCheckUtils]: 0: Hoare triple {1087#true} ~cond := #in~cond; {1087#true} is VALID [2020-07-17 22:51:25,568 INFO L280 TraceCheckUtils]: 1: Hoare triple {1087#true} assume !(0 == ~cond); {1087#true} is VALID [2020-07-17 22:51:25,568 INFO L280 TraceCheckUtils]: 2: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-17 22:51:25,569 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1087#true} {1093#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #124#return; {1093#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:25,577 INFO L280 TraceCheckUtils]: 0: Hoare triple {1087#true} ~cond := #in~cond; {1087#true} is VALID [2020-07-17 22:51:25,578 INFO L280 TraceCheckUtils]: 1: Hoare triple {1087#true} assume !(0 == ~cond); {1087#true} is VALID [2020-07-17 22:51:25,578 INFO L280 TraceCheckUtils]: 2: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-17 22:51:25,579 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1087#true} {1093#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #126#return; {1093#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:25,586 INFO L280 TraceCheckUtils]: 0: Hoare triple {1087#true} ~cond := #in~cond; {1087#true} is VALID [2020-07-17 22:51:25,587 INFO L280 TraceCheckUtils]: 1: Hoare triple {1087#true} assume !(0 == ~cond); {1087#true} is VALID [2020-07-17 22:51:25,587 INFO L280 TraceCheckUtils]: 2: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-17 22:51:25,588 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1087#true} {1092#(<= main_~t~0 main_~tagbuf_len~0)} #128#return; {1092#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:25,588 INFO L263 TraceCheckUtils]: 0: Hoare triple {1087#true} call ULTIMATE.init(); {1087#true} is VALID [2020-07-17 22:51:25,589 INFO L280 TraceCheckUtils]: 1: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-17 22:51:25,589 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1087#true} {1087#true} #116#return; {1087#true} is VALID [2020-07-17 22:51:25,589 INFO L263 TraceCheckUtils]: 3: Hoare triple {1087#true} call #t~ret10 := main(); {1087#true} is VALID [2020-07-17 22:51:25,590 INFO L280 TraceCheckUtils]: 4: Hoare triple {1087#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~tagbuf_len~0 := #t~nondet0;havoc #t~nondet0; {1087#true} is VALID [2020-07-17 22:51:25,590 INFO L280 TraceCheckUtils]: 5: Hoare triple {1087#true} assume ~tagbuf_len~0 >= 1; {1091#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:25,591 INFO L280 TraceCheckUtils]: 6: Hoare triple {1091#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0;#t~pre1 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre1; {1092#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:25,592 INFO L280 TraceCheckUtils]: 7: Hoare triple {1092#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {1092#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:25,593 INFO L280 TraceCheckUtils]: 8: Hoare triple {1092#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1093#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:25,594 INFO L280 TraceCheckUtils]: 9: Hoare triple {1093#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1093#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:25,594 INFO L263 TraceCheckUtils]: 10: Hoare triple {1093#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1087#true} is VALID [2020-07-17 22:51:25,594 INFO L280 TraceCheckUtils]: 11: Hoare triple {1087#true} ~cond := #in~cond; {1087#true} is VALID [2020-07-17 22:51:25,595 INFO L280 TraceCheckUtils]: 12: Hoare triple {1087#true} assume !(0 == ~cond); {1087#true} is VALID [2020-07-17 22:51:25,595 INFO L280 TraceCheckUtils]: 13: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-17 22:51:25,596 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1087#true} {1093#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #124#return; {1093#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:25,596 INFO L263 TraceCheckUtils]: 15: Hoare triple {1093#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1087#true} is VALID [2020-07-17 22:51:25,596 INFO L280 TraceCheckUtils]: 16: Hoare triple {1087#true} ~cond := #in~cond; {1087#true} is VALID [2020-07-17 22:51:25,597 INFO L280 TraceCheckUtils]: 17: Hoare triple {1087#true} assume !(0 == ~cond); {1087#true} is VALID [2020-07-17 22:51:25,597 INFO L280 TraceCheckUtils]: 18: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-17 22:51:25,598 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1087#true} {1093#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #126#return; {1093#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:25,599 INFO L280 TraceCheckUtils]: 20: Hoare triple {1093#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post3 := ~t~0;~t~0 := 1 + #t~post3;havoc #t~post3; {1092#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:25,600 INFO L280 TraceCheckUtils]: 21: Hoare triple {1092#(<= main_~t~0 main_~tagbuf_len~0)} assume !false; {1092#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:25,600 INFO L280 TraceCheckUtils]: 22: Hoare triple {1092#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1092#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:25,601 INFO L280 TraceCheckUtils]: 23: Hoare triple {1092#(<= main_~t~0 main_~tagbuf_len~0)} assume 0 != #t~nondet2;havoc #t~nondet2; {1092#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:25,601 INFO L263 TraceCheckUtils]: 24: Hoare triple {1092#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1087#true} is VALID [2020-07-17 22:51:25,602 INFO L280 TraceCheckUtils]: 25: Hoare triple {1087#true} ~cond := #in~cond; {1087#true} is VALID [2020-07-17 22:51:25,602 INFO L280 TraceCheckUtils]: 26: Hoare triple {1087#true} assume !(0 == ~cond); {1087#true} is VALID [2020-07-17 22:51:25,602 INFO L280 TraceCheckUtils]: 27: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-17 22:51:25,603 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1087#true} {1092#(<= main_~t~0 main_~tagbuf_len~0)} #128#return; {1092#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:25,604 INFO L263 TraceCheckUtils]: 29: Hoare triple {1092#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1106#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:25,605 INFO L280 TraceCheckUtils]: 30: Hoare triple {1106#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1107#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:25,606 INFO L280 TraceCheckUtils]: 31: Hoare triple {1107#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1088#false} is VALID [2020-07-17 22:51:25,606 INFO L280 TraceCheckUtils]: 32: Hoare triple {1088#false} assume !false; {1088#false} is VALID [2020-07-17 22:51:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-17 22:51:25,608 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23438272] [2020-07-17 22:51:25,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532444704] [2020-07-17 22:51:25,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:25,655 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:51:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:25,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:25,974 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:51:26,021 INFO L263 TraceCheckUtils]: 0: Hoare triple {1087#true} call ULTIMATE.init(); {1087#true} is VALID [2020-07-17 22:51:26,022 INFO L280 TraceCheckUtils]: 1: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-17 22:51:26,022 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1087#true} {1087#true} #116#return; {1087#true} is VALID [2020-07-17 22:51:26,022 INFO L263 TraceCheckUtils]: 3: Hoare triple {1087#true} call #t~ret10 := main(); {1087#true} is VALID [2020-07-17 22:51:26,022 INFO L280 TraceCheckUtils]: 4: Hoare triple {1087#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~tagbuf_len~0 := #t~nondet0;havoc #t~nondet0; {1087#true} is VALID [2020-07-17 22:51:26,023 INFO L280 TraceCheckUtils]: 5: Hoare triple {1087#true} assume ~tagbuf_len~0 >= 1; {1091#(<= 1 main_~tagbuf_len~0)} is VALID [2020-07-17 22:51:26,025 INFO L280 TraceCheckUtils]: 6: Hoare triple {1091#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0;#t~pre1 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre1; {1129#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} is VALID [2020-07-17 22:51:26,025 INFO L280 TraceCheckUtils]: 7: Hoare triple {1129#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} assume !false; {1129#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} is VALID [2020-07-17 22:51:26,027 INFO L280 TraceCheckUtils]: 8: Hoare triple {1129#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1136#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2020-07-17 22:51:26,028 INFO L280 TraceCheckUtils]: 9: Hoare triple {1136#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} assume !(0 != #t~nondet2);havoc #t~nondet2; {1136#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2020-07-17 22:51:26,028 INFO L263 TraceCheckUtils]: 10: Hoare triple {1136#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1087#true} is VALID [2020-07-17 22:51:26,028 INFO L280 TraceCheckUtils]: 11: Hoare triple {1087#true} ~cond := #in~cond; {1087#true} is VALID [2020-07-17 22:51:26,028 INFO L280 TraceCheckUtils]: 12: Hoare triple {1087#true} assume !(0 == ~cond); {1087#true} is VALID [2020-07-17 22:51:26,029 INFO L280 TraceCheckUtils]: 13: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-17 22:51:26,030 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1087#true} {1136#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} #124#return; {1136#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2020-07-17 22:51:26,030 INFO L263 TraceCheckUtils]: 15: Hoare triple {1136#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1087#true} is VALID [2020-07-17 22:51:26,031 INFO L280 TraceCheckUtils]: 16: Hoare triple {1087#true} ~cond := #in~cond; {1087#true} is VALID [2020-07-17 22:51:26,031 INFO L280 TraceCheckUtils]: 17: Hoare triple {1087#true} assume !(0 == ~cond); {1087#true} is VALID [2020-07-17 22:51:26,031 INFO L280 TraceCheckUtils]: 18: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-17 22:51:26,032 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1087#true} {1136#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} #126#return; {1136#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} is VALID [2020-07-17 22:51:26,033 INFO L280 TraceCheckUtils]: 20: Hoare triple {1136#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 0) (not (= main_~tagbuf_len~0 main_~t~0)))} #t~post3 := ~t~0;~t~0 := 1 + #t~post3;havoc #t~post3; {1173#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1) (<= main_~t~0 main_~tagbuf_len~0))} is VALID [2020-07-17 22:51:26,034 INFO L280 TraceCheckUtils]: 21: Hoare triple {1173#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1) (<= main_~t~0 main_~tagbuf_len~0))} assume !false; {1173#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1) (<= main_~t~0 main_~tagbuf_len~0))} is VALID [2020-07-17 22:51:26,035 INFO L280 TraceCheckUtils]: 22: Hoare triple {1173#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1) (<= main_~t~0 main_~tagbuf_len~0))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1173#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1) (<= main_~t~0 main_~tagbuf_len~0))} is VALID [2020-07-17 22:51:26,036 INFO L280 TraceCheckUtils]: 23: Hoare triple {1173#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1) (<= main_~t~0 main_~tagbuf_len~0))} assume 0 != #t~nondet2;havoc #t~nondet2; {1173#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1) (<= main_~t~0 main_~tagbuf_len~0))} is VALID [2020-07-17 22:51:26,037 INFO L263 TraceCheckUtils]: 24: Hoare triple {1173#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1) (<= main_~t~0 main_~tagbuf_len~0))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1087#true} is VALID [2020-07-17 22:51:26,037 INFO L280 TraceCheckUtils]: 25: Hoare triple {1087#true} ~cond := #in~cond; {1087#true} is VALID [2020-07-17 22:51:26,037 INFO L280 TraceCheckUtils]: 26: Hoare triple {1087#true} assume !(0 == ~cond); {1087#true} is VALID [2020-07-17 22:51:26,038 INFO L280 TraceCheckUtils]: 27: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-17 22:51:26,039 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1087#true} {1173#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1) (<= main_~t~0 main_~tagbuf_len~0))} #128#return; {1173#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1) (<= main_~t~0 main_~tagbuf_len~0))} is VALID [2020-07-17 22:51:26,040 INFO L263 TraceCheckUtils]: 29: Hoare triple {1173#(and (<= 0 main_~tagbuf_len~0) (<= main_~t~0 1) (<= main_~t~0 main_~tagbuf_len~0))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1201#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:51:26,041 INFO L280 TraceCheckUtils]: 30: Hoare triple {1201#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1205#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:51:26,042 INFO L280 TraceCheckUtils]: 31: Hoare triple {1205#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1088#false} is VALID [2020-07-17 22:51:26,042 INFO L280 TraceCheckUtils]: 32: Hoare triple {1088#false} assume !false; {1088#false} is VALID [2020-07-17 22:51:26,045 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-17 22:51:26,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:51:26,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2020-07-17 22:51:26,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175225017] [2020-07-17 22:51:26,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2020-07-17 22:51:26,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:26,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-17 22:51:26,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:26,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 22:51:26,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:26,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 22:51:26,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:51:26,109 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand 12 states. [2020-07-17 22:51:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:27,325 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2020-07-17 22:51:27,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 22:51:27,326 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2020-07-17 22:51:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:51:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2020-07-17 22:51:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:51:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2020-07-17 22:51:27,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 100 transitions. [2020-07-17 22:51:27,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:27,499 INFO L225 Difference]: With dead ends: 75 [2020-07-17 22:51:27,499 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:51:27,501 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:51:27,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:51:27,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:51:27,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:27,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:27,503 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:27,503 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:27,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:27,503 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:27,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:27,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:27,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:27,504 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:27,504 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:27,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:27,505 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:27,505 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:27,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:27,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:27,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:27,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:27,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:51:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:51:27,506 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2020-07-17 22:51:27,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:27,506 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:51:27,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 22:51:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:27,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:27,708 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:27,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:51:28,036 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:51:28,037 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:28,037 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:28,037 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:51:28,037 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:51:28,037 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:51:28,037 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:28,038 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-17 22:51:28,038 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:28,038 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:28,038 INFO L268 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2020-07-17 22:51:28,038 INFO L268 CegarLoopResult]: For program point L27(lines 27 29) no Hoare annotation was computed. [2020-07-17 22:51:28,038 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 66) no Hoare annotation was computed. [2020-07-17 22:51:28,038 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-17 22:51:28,039 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-17 22:51:28,039 INFO L268 CegarLoopResult]: For program point L48(lines 48 52) no Hoare annotation was computed. [2020-07-17 22:51:28,039 INFO L268 CegarLoopResult]: For program point L44(lines 44 53) no Hoare annotation was computed. [2020-07-17 22:51:28,039 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-17 22:51:28,039 INFO L264 CegarLoopResult]: At program point L49-1(line 49) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-17 22:51:28,039 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-17 22:51:28,039 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-17 22:51:28,039 INFO L264 CegarLoopResult]: At program point L37-2(lines 37 61) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-17 22:51:28,040 INFO L264 CegarLoopResult]: At program point L37-3(lines 37 61) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-17 22:51:28,040 INFO L264 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-17 22:51:28,040 INFO L264 CegarLoopResult]: At program point L58(line 58) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-17 22:51:28,040 INFO L264 CegarLoopResult]: At program point L21-2(lines 21 33) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-17 22:51:28,040 INFO L264 CegarLoopResult]: At program point L21-3(lines 21 33) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-17 22:51:28,040 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2020-07-17 22:51:28,040 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 66) no Hoare annotation was computed. [2020-07-17 22:51:28,041 INFO L268 CegarLoopResult]: For program point L38(lines 38 42) no Hoare annotation was computed. [2020-07-17 22:51:28,041 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-17 22:51:28,041 INFO L271 CegarLoopResult]: At program point L63(lines 14 66) the Hoare annotation is: true [2020-07-17 22:51:28,041 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-17 22:51:28,041 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 66) the Hoare annotation is: true [2020-07-17 22:51:28,041 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-17 22:51:28,042 INFO L268 CegarLoopResult]: For program point L59(line 59) no Hoare annotation was computed. [2020-07-17 22:51:28,042 INFO L268 CegarLoopResult]: For program point L55(lines 55 57) no Hoare annotation was computed. [2020-07-17 22:51:28,042 INFO L268 CegarLoopResult]: For program point L22(lines 22 26) no Hoare annotation was computed. [2020-07-17 22:51:28,042 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-17 22:51:28,042 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-17 22:51:28,042 INFO L268 CegarLoopResult]: For program point L43(lines 43 57) no Hoare annotation was computed. [2020-07-17 22:51:28,043 INFO L264 CegarLoopResult]: At program point L43-1(lines 43 57) the Hoare annotation is: (and (<= 0 main_~t~0) (<= (+ main_~t~0 1) main_~tagbuf_len~0)) [2020-07-17 22:51:28,043 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-17 22:51:28,043 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2020-07-17 22:51:28,043 INFO L268 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2020-07-17 22:51:28,043 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-17 22:51:28,043 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:51:28,044 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-17 22:51:28,044 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-17 22:51:28,044 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:51:28,044 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-17 22:51:28,050 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:28,050 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:51:28,050 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:51:28,051 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:28,051 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:28,051 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:28,051 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:28,051 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:28,051 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:51:28,051 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-17 22:51:28,052 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:28,052 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:28,052 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:28,052 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:51:28,052 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2020-07-17 22:51:28,052 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:51:28,052 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:51:28,052 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:51:28,053 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-17 22:51:28,055 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:51:28,055 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:51:28,055 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:28,055 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:28,056 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:28,056 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:28,056 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:28,056 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:28,056 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:28,056 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:28,056 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:28,056 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:28,057 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:28,057 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:28,057 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:28,057 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:28,057 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:28,057 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:28,057 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:51:28,058 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:51:28,058 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:51:28,058 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-17 22:51:28,058 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-17 22:51:28,058 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:51:28,058 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:51:28,058 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-17 22:51:28,059 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-17 22:51:28,059 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-17 22:51:28,059 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-17 22:51:28,059 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:51:28,059 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-17 22:51:28,060 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:51:28,060 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-17 22:51:28,060 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-17 22:51:28,060 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:51:28,061 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-17 22:51:28,061 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-17 22:51:28,061 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-17 22:51:28,061 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-17 22:51:28,061 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-17 22:51:28,061 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-17 22:51:28,061 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-17 22:51:28,062 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. [2020-07-17 22:51:28,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:51:28 BoogieIcfgContainer [2020-07-17 22:51:28,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:51:28,079 INFO L168 Benchmark]: Toolchain (without parser) took 6863.11 ms. Allocated memory was 145.2 MB in the beginning and 280.0 MB in the end (delta: 134.7 MB). Free memory was 103.0 MB in the beginning and 183.0 MB in the end (delta: -80.1 MB). Peak memory consumption was 54.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:28,079 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 145.2 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:51:28,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.98 ms. Allocated memory is still 145.2 MB. Free memory was 102.6 MB in the beginning and 92.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:28,081 INFO L168 Benchmark]: Boogie Preprocessor took 44.72 ms. Allocated memory is still 145.2 MB. Free memory was 92.0 MB in the beginning and 90.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:28,082 INFO L168 Benchmark]: RCFGBuilder took 703.48 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 90.3 MB in the beginning and 152.5 MB in the end (delta: -62.3 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:28,083 INFO L168 Benchmark]: TraceAbstraction took 5832.44 ms. Allocated memory was 203.4 MB in the beginning and 280.0 MB in the end (delta: 76.5 MB). Free memory was 152.5 MB in the beginning and 183.0 MB in the end (delta: -30.5 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:28,087 INFO L336 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.25 ms. Allocated memory is still 145.2 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 275.98 ms. Allocated memory is still 145.2 MB. Free memory was 102.6 MB in the beginning and 92.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.72 ms. Allocated memory is still 145.2 MB. Free memory was 92.0 MB in the beginning and 90.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 703.48 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 90.3 MB in the beginning and 152.5 MB in the end (delta: -62.3 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5832.44 ms. Allocated memory was 203.4 MB in the beginning and 280.0 MB in the end (delta: 76.5 MB). Free memory was 152.5 MB in the beginning and 183.0 MB in the end (delta: -30.5 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: t <= tagbuf_len && 0 <= t - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: t <= tagbuf_len && 0 <= t - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.3s, OverallIterations: 5, TraceHistogramMax: 4, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 259 SDtfs, 82 SDslu, 583 SDs, 0 SdLazy, 346 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 69 PreInvPairs, 105 NumberOfFragments, 152 HoareAnnotationTreeSize, 69 FomulaSimplifications, 197 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 24 FomulaSimplificationsInter, 72 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 8076 SizeOfPredicates, 2 NumberOfNonLiveVariables, 68 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 42/46 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...