java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:09:46,151 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:09:46,153 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:09:46,165 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:09:46,165 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:09:46,166 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:09:46,168 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:09:46,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:09:46,180 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:09:46,181 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:09:46,182 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:09:46,182 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:09:46,183 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:09:46,184 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:09:46,185 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:09:46,186 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:09:46,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:09:46,189 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:09:46,191 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:09:46,192 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:09:46,193 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:09:46,194 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:09:46,198 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:09:46,198 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:09:46,199 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:09:46,203 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:09:46,204 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:09:46,204 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:09:46,205 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:09:46,206 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:09:46,206 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:09:46,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:09:46,207 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:09:46,208 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:09:46,212 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:09:46,214 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:09:46,214 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:09:46,238 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:09:46,239 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:09:46,240 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:09:46,240 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:09:46,241 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:09:46,241 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:09:46,241 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:09:46,243 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:09:46,243 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:09:46,243 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:09:46,243 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:09:46,243 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:09:46,243 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:09:46,244 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:09:46,244 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:09:46,244 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:09:46,244 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:09:46,244 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:09:46,245 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:09:46,245 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:09:46,245 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:09:46,245 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:09:46,245 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:09:46,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:09:46,246 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:09:46,246 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:09:46,246 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:09:46,246 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:09:46,246 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:09:46,248 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:09:46,248 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:09:46,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:09:46,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:09:46,322 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:09:46,323 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:09:46,324 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:09:46,325 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call_true-termination.i [2018-11-23 13:09:46,386 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd82f3391/8857dcb810a740018e53020f1c1ae3f2/FLAGd3e7bb369 [2018-11-23 13:09:46,788 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:09:46,788 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call_true-termination.i [2018-11-23 13:09:46,795 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd82f3391/8857dcb810a740018e53020f1c1ae3f2/FLAGd3e7bb369 [2018-11-23 13:09:47,172 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd82f3391/8857dcb810a740018e53020f1c1ae3f2 [2018-11-23 13:09:47,181 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:09:47,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:09:47,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:09:47,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:09:47,189 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:09:47,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:47" (1/1) ... [2018-11-23 13:09:47,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@519e8533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:47, skipping insertion in model container [2018-11-23 13:09:47,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:09:47" (1/1) ... [2018-11-23 13:09:47,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:09:47,230 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:09:47,492 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:09:47,497 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:09:47,521 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:09:47,547 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:09:47,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:47 WrapperNode [2018-11-23 13:09:47,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:09:47,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:09:47,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:09:47,549 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:09:47,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:47" (1/1) ... [2018-11-23 13:09:47,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:47" (1/1) ... [2018-11-23 13:09:47,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:09:47,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:09:47,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:09:47,570 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:09:47,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:47" (1/1) ... [2018-11-23 13:09:47,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:47" (1/1) ... [2018-11-23 13:09:47,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:47" (1/1) ... [2018-11-23 13:09:47,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:47" (1/1) ... [2018-11-23 13:09:47,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:47" (1/1) ... [2018-11-23 13:09:47,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:47" (1/1) ... [2018-11-23 13:09:47,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:47" (1/1) ... [2018-11-23 13:09:47,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:09:47,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:09:47,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:09:47,598 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:09:47,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:47" (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 [2018-11-23 13:09:47,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:09:47,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:09:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:09:47,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:09:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:09:47,738 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:09:47,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:09:47,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:09:48,663 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:09:48,664 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 13:09:48,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:48 BoogieIcfgContainer [2018-11-23 13:09:48,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:09:48,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:09:48,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:09:48,669 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:09:48,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:09:47" (1/3) ... [2018-11-23 13:09:48,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@246fec53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:09:48, skipping insertion in model container [2018-11-23 13:09:48,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:09:47" (2/3) ... [2018-11-23 13:09:48,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@246fec53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:09:48, skipping insertion in model container [2018-11-23 13:09:48,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:48" (3/3) ... [2018-11-23 13:09:48,673 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call_true-termination.i [2018-11-23 13:09:48,684 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:09:48,693 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:09:48,715 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:09:48,754 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:09:48,755 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:09:48,755 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:09:48,756 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:09:48,756 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:09:48,756 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:09:48,756 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:09:48,757 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:09:48,757 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:09:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-11-23 13:09:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:09:48,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:48,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:48,788 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:48,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:48,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2074932940, now seen corresponding path program 1 times [2018-11-23 13:09:48,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:48,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:48,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:48,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:48,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:48,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {50#true} call ULTIMATE.init(); {50#true} is VALID [2018-11-23 13:09:48,951 INFO L273 TraceCheckUtils]: 1: Hoare triple {50#true} assume true; {50#true} is VALID [2018-11-23 13:09:48,952 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {50#true} {50#true} #108#return; {50#true} is VALID [2018-11-23 13:09:48,952 INFO L256 TraceCheckUtils]: 3: Hoare triple {50#true} call #t~ret11 := main(); {50#true} is VALID [2018-11-23 13:09:48,953 INFO L273 TraceCheckUtils]: 4: Hoare triple {50#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {50#true} is VALID [2018-11-23 13:09:48,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {50#true} assume ~tagbuf_len~0 >= 1; {50#true} is VALID [2018-11-23 13:09:48,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {50#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {50#true} is VALID [2018-11-23 13:09:48,955 INFO L273 TraceCheckUtils]: 7: Hoare triple {50#true} assume false; {51#false} is VALID [2018-11-23 13:09:48,955 INFO L256 TraceCheckUtils]: 8: Hoare triple {51#false} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {51#false} is VALID [2018-11-23 13:09:48,956 INFO L273 TraceCheckUtils]: 9: Hoare triple {51#false} ~cond := #in~cond; {51#false} is VALID [2018-11-23 13:09:48,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {51#false} assume 0 == ~cond; {51#false} is VALID [2018-11-23 13:09:48,956 INFO L273 TraceCheckUtils]: 11: Hoare triple {51#false} assume !false; {51#false} is VALID [2018-11-23 13:09:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:48,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:09:48,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:09:48,966 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:09:48,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:48,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:09:49,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:49,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:09:49,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:09:49,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:09:49,067 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2018-11-23 13:09:49,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:49,415 INFO L93 Difference]: Finished difference Result 87 states and 156 transitions. [2018-11-23 13:09:49,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:09:49,415 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 13:09:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:09:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 156 transitions. [2018-11-23 13:09:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:09:49,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 156 transitions. [2018-11-23 13:09:49,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 156 transitions. [2018-11-23 13:09:50,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:50,065 INFO L225 Difference]: With dead ends: 87 [2018-11-23 13:09:50,066 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 13:09:50,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:09:50,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 13:09:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 13:09:50,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:50,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 13:09:50,140 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 13:09:50,140 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 13:09:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:50,148 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2018-11-23 13:09:50,148 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2018-11-23 13:09:50,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:50,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:50,151 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 13:09:50,151 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 13:09:50,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:50,158 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2018-11-23 13:09:50,159 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2018-11-23 13:09:50,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:50,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:50,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:50,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:09:50,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2018-11-23 13:09:50,177 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 12 [2018-11-23 13:09:50,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:50,177 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2018-11-23 13:09:50,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:09:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2018-11-23 13:09:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:09:50,180 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:50,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:50,180 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:50,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:50,181 INFO L82 PathProgramCache]: Analyzing trace with hash -132543993, now seen corresponding path program 1 times [2018-11-23 13:09:50,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:50,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:50,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:50,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:50,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:50,321 INFO L256 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2018-11-23 13:09:50,321 INFO L273 TraceCheckUtils]: 1: Hoare triple {334#true} assume true; {334#true} is VALID [2018-11-23 13:09:50,322 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {334#true} {334#true} #108#return; {334#true} is VALID [2018-11-23 13:09:50,322 INFO L256 TraceCheckUtils]: 3: Hoare triple {334#true} call #t~ret11 := main(); {334#true} is VALID [2018-11-23 13:09:50,322 INFO L273 TraceCheckUtils]: 4: Hoare triple {334#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {334#true} is VALID [2018-11-23 13:09:50,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {334#true} assume ~tagbuf_len~0 >= 1; {334#true} is VALID [2018-11-23 13:09:50,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {334#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {336#(<= 0 main_~t~0)} is VALID [2018-11-23 13:09:50,324 INFO L273 TraceCheckUtils]: 7: Hoare triple {336#(<= 0 main_~t~0)} assume !false; {336#(<= 0 main_~t~0)} is VALID [2018-11-23 13:09:50,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {336#(<= 0 main_~t~0)} assume ~t~0 == ~tagbuf_len~0; {336#(<= 0 main_~t~0)} is VALID [2018-11-23 13:09:50,344 INFO L256 TraceCheckUtils]: 9: Hoare triple {336#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {337#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:50,359 INFO L273 TraceCheckUtils]: 10: Hoare triple {337#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {338#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:09:50,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {338#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {335#false} is VALID [2018-11-23 13:09:50,363 INFO L273 TraceCheckUtils]: 12: Hoare triple {335#false} assume !false; {335#false} is VALID [2018-11-23 13:09:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:50,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:09:50,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:09:50,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 13:09:50,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:50,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:09:50,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:50,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:09:50,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:09:50,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:09:50,400 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 5 states. [2018-11-23 13:09:51,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:51,304 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2018-11-23 13:09:51,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:09:51,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 13:09:51,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:51,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:09:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2018-11-23 13:09:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:09:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2018-11-23 13:09:51,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2018-11-23 13:09:51,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:51,407 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:09:51,407 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 13:09:51,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:09:51,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 13:09:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 13:09:51,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:51,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 13:09:51,457 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 13:09:51,457 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 13:09:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:51,462 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2018-11-23 13:09:51,462 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2018-11-23 13:09:51,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:51,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:51,464 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 13:09:51,465 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 13:09:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:51,469 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2018-11-23 13:09:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2018-11-23 13:09:51,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:51,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:51,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:51,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 13:09:51,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2018-11-23 13:09:51,476 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 13 [2018-11-23 13:09:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:51,476 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2018-11-23 13:09:51,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:09:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2018-11-23 13:09:51,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:09:51,478 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:51,478 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:51,479 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:51,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:51,479 INFO L82 PathProgramCache]: Analyzing trace with hash -811261734, now seen corresponding path program 1 times [2018-11-23 13:09:51,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:51,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:51,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:51,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:51,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:51,630 INFO L256 TraceCheckUtils]: 0: Hoare triple {577#true} call ULTIMATE.init(); {577#true} is VALID [2018-11-23 13:09:51,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {577#true} assume true; {577#true} is VALID [2018-11-23 13:09:51,631 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {577#true} {577#true} #108#return; {577#true} is VALID [2018-11-23 13:09:51,631 INFO L256 TraceCheckUtils]: 3: Hoare triple {577#true} call #t~ret11 := main(); {577#true} is VALID [2018-11-23 13:09:51,632 INFO L273 TraceCheckUtils]: 4: Hoare triple {577#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {577#true} is VALID [2018-11-23 13:09:51,632 INFO L273 TraceCheckUtils]: 5: Hoare triple {577#true} assume ~tagbuf_len~0 >= 1; {577#true} is VALID [2018-11-23 13:09:51,634 INFO L273 TraceCheckUtils]: 6: Hoare triple {577#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {579#(<= 0 main_~t~0)} is VALID [2018-11-23 13:09:51,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {579#(<= 0 main_~t~0)} assume !false; {579#(<= 0 main_~t~0)} is VALID [2018-11-23 13:09:51,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {579#(<= 0 main_~t~0)} assume ~t~0 == ~tagbuf_len~0; {580#(and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))} is VALID [2018-11-23 13:09:51,639 INFO L256 TraceCheckUtils]: 9: Hoare triple {580#(and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {577#true} is VALID [2018-11-23 13:09:51,641 INFO L273 TraceCheckUtils]: 10: Hoare triple {577#true} ~cond := #in~cond; {581#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:51,641 INFO L273 TraceCheckUtils]: 11: Hoare triple {581#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {582#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:51,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {582#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {582#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:51,643 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {582#(not (= |__VERIFIER_assert_#in~cond| 0))} {580#(and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))} #112#return; {583#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2018-11-23 13:09:51,645 INFO L256 TraceCheckUtils]: 14: Hoare triple {583#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {582#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:51,645 INFO L273 TraceCheckUtils]: 15: Hoare triple {582#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {584#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:09:51,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {584#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {578#false} is VALID [2018-11-23 13:09:51,647 INFO L273 TraceCheckUtils]: 17: Hoare triple {578#false} assume !false; {578#false} is VALID [2018-11-23 13:09:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:51,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:51,650 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:51,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:51,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:52,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {577#true} call ULTIMATE.init(); {577#true} is VALID [2018-11-23 13:09:52,063 INFO L273 TraceCheckUtils]: 1: Hoare triple {577#true} assume true; {577#true} is VALID [2018-11-23 13:09:52,063 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {577#true} {577#true} #108#return; {577#true} is VALID [2018-11-23 13:09:52,064 INFO L256 TraceCheckUtils]: 3: Hoare triple {577#true} call #t~ret11 := main(); {577#true} is VALID [2018-11-23 13:09:52,064 INFO L273 TraceCheckUtils]: 4: Hoare triple {577#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {577#true} is VALID [2018-11-23 13:09:52,064 INFO L273 TraceCheckUtils]: 5: Hoare triple {577#true} assume ~tagbuf_len~0 >= 1; {577#true} is VALID [2018-11-23 13:09:52,064 INFO L273 TraceCheckUtils]: 6: Hoare triple {577#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {577#true} is VALID [2018-11-23 13:09:52,065 INFO L273 TraceCheckUtils]: 7: Hoare triple {577#true} assume !false; {577#true} is VALID [2018-11-23 13:09:52,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {577#true} assume ~t~0 == ~tagbuf_len~0; {583#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2018-11-23 13:09:52,069 INFO L256 TraceCheckUtils]: 9: Hoare triple {583#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {577#true} is VALID [2018-11-23 13:09:52,069 INFO L273 TraceCheckUtils]: 10: Hoare triple {577#true} ~cond := #in~cond; {577#true} is VALID [2018-11-23 13:09:52,069 INFO L273 TraceCheckUtils]: 11: Hoare triple {577#true} assume !(0 == ~cond); {577#true} is VALID [2018-11-23 13:09:52,070 INFO L273 TraceCheckUtils]: 12: Hoare triple {577#true} assume true; {577#true} is VALID [2018-11-23 13:09:52,070 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {577#true} {583#(<= main_~t~0 main_~tagbuf_len~0)} #112#return; {583#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2018-11-23 13:09:52,071 INFO L256 TraceCheckUtils]: 14: Hoare triple {583#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {630#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:52,072 INFO L273 TraceCheckUtils]: 15: Hoare triple {630#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {634#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:09:52,072 INFO L273 TraceCheckUtils]: 16: Hoare triple {634#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {578#false} is VALID [2018-11-23 13:09:52,072 INFO L273 TraceCheckUtils]: 17: Hoare triple {578#false} assume !false; {578#false} is VALID [2018-11-23 13:09:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:52,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:09:52,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2018-11-23 13:09:52,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-23 13:09:52,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:52,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:09:52,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:52,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:09:52,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:09:52,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:09:52,131 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand 10 states. [2018-11-23 13:09:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:53,443 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2018-11-23 13:09:53,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:09:53,443 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-23 13:09:53,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:53,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:09:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2018-11-23 13:09:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:09:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2018-11-23 13:09:53,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2018-11-23 13:09:53,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:53,569 INFO L225 Difference]: With dead ends: 52 [2018-11-23 13:09:53,569 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 13:09:53,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:09:53,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 13:09:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 13:09:53,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:53,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 13:09:53,623 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 13:09:53,623 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 13:09:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:53,626 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-11-23 13:09:53,627 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2018-11-23 13:09:53,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:53,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:53,628 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 13:09:53,628 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 13:09:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:53,631 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-11-23 13:09:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2018-11-23 13:09:53,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:53,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:53,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:53,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:09:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2018-11-23 13:09:53,635 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 18 [2018-11-23 13:09:53,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:53,636 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2018-11-23 13:09:53,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:09:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2018-11-23 13:09:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:09:53,637 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:53,637 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:53,637 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:53,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:53,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1679618026, now seen corresponding path program 1 times [2018-11-23 13:09:53,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:53,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:53,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:53,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:53,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:53,780 INFO L256 TraceCheckUtils]: 0: Hoare triple {859#true} call ULTIMATE.init(); {859#true} is VALID [2018-11-23 13:09:53,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {859#true} assume true; {859#true} is VALID [2018-11-23 13:09:53,781 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {859#true} {859#true} #108#return; {859#true} is VALID [2018-11-23 13:09:53,781 INFO L256 TraceCheckUtils]: 3: Hoare triple {859#true} call #t~ret11 := main(); {859#true} is VALID [2018-11-23 13:09:53,782 INFO L273 TraceCheckUtils]: 4: Hoare triple {859#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {859#true} is VALID [2018-11-23 13:09:53,783 INFO L273 TraceCheckUtils]: 5: Hoare triple {859#true} assume ~tagbuf_len~0 >= 1; {861#(<= 1 main_~tagbuf_len~0)} is VALID [2018-11-23 13:09:53,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {861#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {862#(and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))} is VALID [2018-11-23 13:09:53,784 INFO L273 TraceCheckUtils]: 7: Hoare triple {862#(and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))} assume !false; {862#(and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))} is VALID [2018-11-23 13:09:53,785 INFO L273 TraceCheckUtils]: 8: Hoare triple {862#(and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {862#(and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))} is VALID [2018-11-23 13:09:53,786 INFO L273 TraceCheckUtils]: 9: Hoare triple {862#(and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))} assume !(0 != #t~nondet3);havoc #t~nondet3; {862#(and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))} is VALID [2018-11-23 13:09:53,786 INFO L256 TraceCheckUtils]: 10: Hoare triple {862#(and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {859#true} is VALID [2018-11-23 13:09:53,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {859#true} ~cond := #in~cond; {863#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:53,789 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:53,789 INFO L273 TraceCheckUtils]: 13: Hoare triple {864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:53,790 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {864#(not (= |__VERIFIER_assert_#in~cond| 0))} {862#(and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0))} #116#return; {865#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2018-11-23 13:09:53,791 INFO L256 TraceCheckUtils]: 15: Hoare triple {865#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:53,792 INFO L273 TraceCheckUtils]: 16: Hoare triple {864#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {866#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:09:53,793 INFO L273 TraceCheckUtils]: 17: Hoare triple {866#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {860#false} is VALID [2018-11-23 13:09:53,793 INFO L273 TraceCheckUtils]: 18: Hoare triple {860#false} assume !false; {860#false} is VALID [2018-11-23 13:09:53,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:53,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:53,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:53,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:53,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:53,955 INFO L256 TraceCheckUtils]: 0: Hoare triple {859#true} call ULTIMATE.init(); {859#true} is VALID [2018-11-23 13:09:53,955 INFO L273 TraceCheckUtils]: 1: Hoare triple {859#true} assume true; {859#true} is VALID [2018-11-23 13:09:53,955 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {859#true} {859#true} #108#return; {859#true} is VALID [2018-11-23 13:09:53,955 INFO L256 TraceCheckUtils]: 3: Hoare triple {859#true} call #t~ret11 := main(); {859#true} is VALID [2018-11-23 13:09:53,956 INFO L273 TraceCheckUtils]: 4: Hoare triple {859#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {859#true} is VALID [2018-11-23 13:09:53,956 INFO L273 TraceCheckUtils]: 5: Hoare triple {859#true} assume ~tagbuf_len~0 >= 1; {861#(<= 1 main_~tagbuf_len~0)} is VALID [2018-11-23 13:09:53,957 INFO L273 TraceCheckUtils]: 6: Hoare triple {861#(<= 1 main_~tagbuf_len~0)} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {888#(and (= main_~t~0 0) (<= 0 main_~tagbuf_len~0))} is VALID [2018-11-23 13:09:53,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {888#(and (= main_~t~0 0) (<= 0 main_~tagbuf_len~0))} assume !false; {888#(and (= main_~t~0 0) (<= 0 main_~tagbuf_len~0))} is VALID [2018-11-23 13:09:53,958 INFO L273 TraceCheckUtils]: 8: Hoare triple {888#(and (= main_~t~0 0) (<= 0 main_~tagbuf_len~0))} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {888#(and (= main_~t~0 0) (<= 0 main_~tagbuf_len~0))} is VALID [2018-11-23 13:09:53,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {888#(and (= main_~t~0 0) (<= 0 main_~tagbuf_len~0))} assume !(0 != #t~nondet3);havoc #t~nondet3; {888#(and (= main_~t~0 0) (<= 0 main_~tagbuf_len~0))} is VALID [2018-11-23 13:09:53,959 INFO L256 TraceCheckUtils]: 10: Hoare triple {888#(and (= main_~t~0 0) (<= 0 main_~tagbuf_len~0))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {859#true} is VALID [2018-11-23 13:09:53,960 INFO L273 TraceCheckUtils]: 11: Hoare triple {859#true} ~cond := #in~cond; {863#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:53,960 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:53,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {864#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {864#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:53,962 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {864#(not (= |__VERIFIER_assert_#in~cond| 0))} {888#(and (= main_~t~0 0) (<= 0 main_~tagbuf_len~0))} #116#return; {888#(and (= main_~t~0 0) (<= 0 main_~tagbuf_len~0))} is VALID [2018-11-23 13:09:53,964 INFO L256 TraceCheckUtils]: 15: Hoare triple {888#(and (= main_~t~0 0) (<= 0 main_~tagbuf_len~0))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {916#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:53,965 INFO L273 TraceCheckUtils]: 16: Hoare triple {916#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {920#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:09:53,966 INFO L273 TraceCheckUtils]: 17: Hoare triple {920#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {860#false} is VALID [2018-11-23 13:09:53,966 INFO L273 TraceCheckUtils]: 18: Hoare triple {860#false} assume !false; {860#false} is VALID [2018-11-23 13:09:53,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:53,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:53,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-11-23 13:09:53,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-11-23 13:09:53,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:53,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:09:54,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:54,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:09:54,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:09:54,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:09:54,020 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 11 states. [2018-11-23 13:09:55,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:55,693 INFO L93 Difference]: Finished difference Result 81 states and 108 transitions. [2018-11-23 13:09:55,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:09:55,693 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-11-23 13:09:55,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:55,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:09:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2018-11-23 13:09:55,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:09:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 102 transitions. [2018-11-23 13:09:55,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 102 transitions. [2018-11-23 13:09:55,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:55,840 INFO L225 Difference]: With dead ends: 81 [2018-11-23 13:09:55,840 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 13:09:55,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:09:55,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 13:09:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-11-23 13:09:56,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:56,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 73 states. [2018-11-23 13:09:56,035 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 73 states. [2018-11-23 13:09:56,035 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 73 states. [2018-11-23 13:09:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:56,040 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2018-11-23 13:09:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2018-11-23 13:09:56,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:56,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:56,042 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 77 states. [2018-11-23 13:09:56,042 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 77 states. [2018-11-23 13:09:56,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:56,047 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2018-11-23 13:09:56,047 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2018-11-23 13:09:56,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:56,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:56,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:56,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 13:09:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2018-11-23 13:09:56,053 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 19 [2018-11-23 13:09:56,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:56,053 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2018-11-23 13:09:56,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:09:56,053 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2018-11-23 13:09:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 13:09:56,055 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:56,055 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:56,055 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:56,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:56,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1876677586, now seen corresponding path program 1 times [2018-11-23 13:09:56,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:56,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:56,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:56,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:56,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:56,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {1316#true} call ULTIMATE.init(); {1316#true} is VALID [2018-11-23 13:09:56,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-23 13:09:56,279 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1316#true} {1316#true} #108#return; {1316#true} is VALID [2018-11-23 13:09:56,280 INFO L256 TraceCheckUtils]: 3: Hoare triple {1316#true} call #t~ret11 := main(); {1316#true} is VALID [2018-11-23 13:09:56,280 INFO L273 TraceCheckUtils]: 4: Hoare triple {1316#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1316#true} is VALID [2018-11-23 13:09:56,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {1316#true} assume ~tagbuf_len~0 >= 1; {1316#true} is VALID [2018-11-23 13:09:56,285 INFO L273 TraceCheckUtils]: 6: Hoare triple {1316#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {1318#(<= 0 main_~t~0)} is VALID [2018-11-23 13:09:56,286 INFO L273 TraceCheckUtils]: 7: Hoare triple {1318#(<= 0 main_~t~0)} assume !false; {1318#(<= 0 main_~t~0)} is VALID [2018-11-23 13:09:56,286 INFO L273 TraceCheckUtils]: 8: Hoare triple {1318#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1318#(<= 0 main_~t~0)} is VALID [2018-11-23 13:09:56,287 INFO L273 TraceCheckUtils]: 9: Hoare triple {1318#(<= 0 main_~t~0)} assume 0 != #t~nondet3;havoc #t~nondet3; {1318#(<= 0 main_~t~0)} is VALID [2018-11-23 13:09:56,287 INFO L256 TraceCheckUtils]: 10: Hoare triple {1318#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1316#true} is VALID [2018-11-23 13:09:56,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {1316#true} ~cond := #in~cond; {1319#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:56,288 INFO L273 TraceCheckUtils]: 12: Hoare triple {1319#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:56,289 INFO L273 TraceCheckUtils]: 13: Hoare triple {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:56,290 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} {1318#(<= 0 main_~t~0)} #120#return; {1316#true} is VALID [2018-11-23 13:09:56,290 INFO L256 TraceCheckUtils]: 15: Hoare triple {1316#true} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1316#true} is VALID [2018-11-23 13:09:56,290 INFO L273 TraceCheckUtils]: 16: Hoare triple {1316#true} ~cond := #in~cond; {1316#true} is VALID [2018-11-23 13:09:56,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {1316#true} assume !(0 == ~cond); {1316#true} is VALID [2018-11-23 13:09:56,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-23 13:09:56,291 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1316#true} {1316#true} #122#return; {1316#true} is VALID [2018-11-23 13:09:56,291 INFO L273 TraceCheckUtils]: 20: Hoare triple {1316#true} #t~post5 := ~t~0;~t~0 := 1 + #t~post5;havoc #t~post5; {1316#true} is VALID [2018-11-23 13:09:56,292 INFO L273 TraceCheckUtils]: 21: Hoare triple {1316#true} assume !false; {1316#true} is VALID [2018-11-23 13:09:56,307 INFO L273 TraceCheckUtils]: 22: Hoare triple {1316#true} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1321#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2018-11-23 13:09:56,309 INFO L273 TraceCheckUtils]: 23: Hoare triple {1321#(not (= main_~tagbuf_len~0 main_~t~0))} assume 0 != #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1321#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2018-11-23 13:09:56,312 INFO L273 TraceCheckUtils]: 24: Hoare triple {1321#(not (= main_~tagbuf_len~0 main_~t~0))} assume 0 != #t~nondet7;havoc #t~nondet7; {1321#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2018-11-23 13:09:56,312 INFO L256 TraceCheckUtils]: 25: Hoare triple {1321#(not (= main_~tagbuf_len~0 main_~t~0))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1316#true} is VALID [2018-11-23 13:09:56,312 INFO L273 TraceCheckUtils]: 26: Hoare triple {1316#true} ~cond := #in~cond; {1316#true} is VALID [2018-11-23 13:09:56,313 INFO L273 TraceCheckUtils]: 27: Hoare triple {1316#true} assume !(0 == ~cond); {1316#true} is VALID [2018-11-23 13:09:56,313 INFO L273 TraceCheckUtils]: 28: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-23 13:09:56,317 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1316#true} {1321#(not (= main_~tagbuf_len~0 main_~t~0))} #128#return; {1321#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2018-11-23 13:09:56,317 INFO L256 TraceCheckUtils]: 30: Hoare triple {1321#(not (= main_~tagbuf_len~0 main_~t~0))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1316#true} is VALID [2018-11-23 13:09:56,318 INFO L273 TraceCheckUtils]: 31: Hoare triple {1316#true} ~cond := #in~cond; {1319#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:56,318 INFO L273 TraceCheckUtils]: 32: Hoare triple {1319#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:56,318 INFO L273 TraceCheckUtils]: 33: Hoare triple {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:56,319 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} {1321#(not (= main_~tagbuf_len~0 main_~t~0))} #130#return; {1322#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2018-11-23 13:09:56,320 INFO L273 TraceCheckUtils]: 35: Hoare triple {1322#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post8 := ~t~0;~t~0 := 1 + #t~post8;havoc #t~post8; {1323#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2018-11-23 13:09:56,320 INFO L273 TraceCheckUtils]: 36: Hoare triple {1323#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {1323#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2018-11-23 13:09:56,320 INFO L256 TraceCheckUtils]: 37: Hoare triple {1323#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1316#true} is VALID [2018-11-23 13:09:56,320 INFO L273 TraceCheckUtils]: 38: Hoare triple {1316#true} ~cond := #in~cond; {1316#true} is VALID [2018-11-23 13:09:56,321 INFO L273 TraceCheckUtils]: 39: Hoare triple {1316#true} assume !(0 == ~cond); {1316#true} is VALID [2018-11-23 13:09:56,321 INFO L273 TraceCheckUtils]: 40: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-23 13:09:56,328 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1316#true} {1323#(<= main_~t~0 main_~tagbuf_len~0)} #136#return; {1323#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2018-11-23 13:09:56,329 INFO L256 TraceCheckUtils]: 42: Hoare triple {1323#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:56,329 INFO L273 TraceCheckUtils]: 43: Hoare triple {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1324#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 13:09:56,329 INFO L273 TraceCheckUtils]: 44: Hoare triple {1324#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1317#false} is VALID [2018-11-23 13:09:56,330 INFO L273 TraceCheckUtils]: 45: Hoare triple {1317#false} assume !false; {1317#false} is VALID [2018-11-23 13:09:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 13:09:56,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:56,333 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:56,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:56,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:56,544 INFO L256 TraceCheckUtils]: 0: Hoare triple {1316#true} call ULTIMATE.init(); {1316#true} is VALID [2018-11-23 13:09:56,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-23 13:09:56,545 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1316#true} {1316#true} #108#return; {1316#true} is VALID [2018-11-23 13:09:56,546 INFO L256 TraceCheckUtils]: 3: Hoare triple {1316#true} call #t~ret11 := main(); {1316#true} is VALID [2018-11-23 13:09:56,546 INFO L273 TraceCheckUtils]: 4: Hoare triple {1316#true} havoc ~tagbuf_len~0;havoc ~t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1316#true} is VALID [2018-11-23 13:09:56,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {1316#true} assume ~tagbuf_len~0 >= 1; {1316#true} is VALID [2018-11-23 13:09:56,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {1316#true} ~t~0 := 0;#t~pre2 := ~tagbuf_len~0 - 1;~tagbuf_len~0 := ~tagbuf_len~0 - 1;havoc #t~pre2; {1318#(<= 0 main_~t~0)} is VALID [2018-11-23 13:09:56,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {1318#(<= 0 main_~t~0)} assume !false; {1318#(<= 0 main_~t~0)} is VALID [2018-11-23 13:09:56,548 INFO L273 TraceCheckUtils]: 8: Hoare triple {1318#(<= 0 main_~t~0)} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1318#(<= 0 main_~t~0)} is VALID [2018-11-23 13:09:56,548 INFO L273 TraceCheckUtils]: 9: Hoare triple {1318#(<= 0 main_~t~0)} assume 0 != #t~nondet3;havoc #t~nondet3; {1318#(<= 0 main_~t~0)} is VALID [2018-11-23 13:09:56,548 INFO L256 TraceCheckUtils]: 10: Hoare triple {1318#(<= 0 main_~t~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1316#true} is VALID [2018-11-23 13:09:56,549 INFO L273 TraceCheckUtils]: 11: Hoare triple {1316#true} ~cond := #in~cond; {1319#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:56,549 INFO L273 TraceCheckUtils]: 12: Hoare triple {1319#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:56,550 INFO L273 TraceCheckUtils]: 13: Hoare triple {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:56,550 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} {1318#(<= 0 main_~t~0)} #120#return; {1316#true} is VALID [2018-11-23 13:09:56,550 INFO L256 TraceCheckUtils]: 15: Hoare triple {1316#true} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1316#true} is VALID [2018-11-23 13:09:56,550 INFO L273 TraceCheckUtils]: 16: Hoare triple {1316#true} ~cond := #in~cond; {1316#true} is VALID [2018-11-23 13:09:56,551 INFO L273 TraceCheckUtils]: 17: Hoare triple {1316#true} assume !(0 == ~cond); {1316#true} is VALID [2018-11-23 13:09:56,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-23 13:09:56,551 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1316#true} {1316#true} #122#return; {1316#true} is VALID [2018-11-23 13:09:56,551 INFO L273 TraceCheckUtils]: 20: Hoare triple {1316#true} #t~post5 := ~t~0;~t~0 := 1 + #t~post5;havoc #t~post5; {1316#true} is VALID [2018-11-23 13:09:56,551 INFO L273 TraceCheckUtils]: 21: Hoare triple {1316#true} assume !false; {1316#true} is VALID [2018-11-23 13:09:56,552 INFO L273 TraceCheckUtils]: 22: Hoare triple {1316#true} assume !(~t~0 == ~tagbuf_len~0);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; {1321#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2018-11-23 13:09:56,553 INFO L273 TraceCheckUtils]: 23: Hoare triple {1321#(not (= main_~tagbuf_len~0 main_~t~0))} assume 0 != #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1321#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2018-11-23 13:09:56,553 INFO L273 TraceCheckUtils]: 24: Hoare triple {1321#(not (= main_~tagbuf_len~0 main_~t~0))} assume 0 != #t~nondet7;havoc #t~nondet7; {1321#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2018-11-23 13:09:56,553 INFO L256 TraceCheckUtils]: 25: Hoare triple {1321#(not (= main_~tagbuf_len~0 main_~t~0))} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1316#true} is VALID [2018-11-23 13:09:56,554 INFO L273 TraceCheckUtils]: 26: Hoare triple {1316#true} ~cond := #in~cond; {1316#true} is VALID [2018-11-23 13:09:56,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {1316#true} assume !(0 == ~cond); {1316#true} is VALID [2018-11-23 13:09:56,554 INFO L273 TraceCheckUtils]: 28: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-23 13:09:56,554 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1316#true} {1321#(not (= main_~tagbuf_len~0 main_~t~0))} #128#return; {1321#(not (= main_~tagbuf_len~0 main_~t~0))} is VALID [2018-11-23 13:09:56,554 INFO L256 TraceCheckUtils]: 30: Hoare triple {1321#(not (= main_~tagbuf_len~0 main_~t~0))} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1316#true} is VALID [2018-11-23 13:09:56,555 INFO L273 TraceCheckUtils]: 31: Hoare triple {1316#true} ~cond := #in~cond; {1319#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:09:56,556 INFO L273 TraceCheckUtils]: 32: Hoare triple {1319#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:56,556 INFO L273 TraceCheckUtils]: 33: Hoare triple {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 13:09:56,557 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1320#(not (= |__VERIFIER_assert_#in~cond| 0))} {1321#(not (= main_~tagbuf_len~0 main_~t~0))} #130#return; {1322#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} is VALID [2018-11-23 13:09:56,558 INFO L273 TraceCheckUtils]: 35: Hoare triple {1322#(<= (+ main_~t~0 1) main_~tagbuf_len~0)} #t~post8 := ~t~0;~t~0 := 1 + #t~post8;havoc #t~post8; {1323#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2018-11-23 13:09:56,559 INFO L273 TraceCheckUtils]: 36: Hoare triple {1323#(<= main_~t~0 main_~tagbuf_len~0)} assume !(~t~0 == ~tagbuf_len~0); {1323#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2018-11-23 13:09:56,559 INFO L256 TraceCheckUtils]: 37: Hoare triple {1323#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if 0 <= ~t~0 then 1 else 0)); {1316#true} is VALID [2018-11-23 13:09:56,559 INFO L273 TraceCheckUtils]: 38: Hoare triple {1316#true} ~cond := #in~cond; {1316#true} is VALID [2018-11-23 13:09:56,560 INFO L273 TraceCheckUtils]: 39: Hoare triple {1316#true} assume !(0 == ~cond); {1316#true} is VALID [2018-11-23 13:09:56,560 INFO L273 TraceCheckUtils]: 40: Hoare triple {1316#true} assume true; {1316#true} is VALID [2018-11-23 13:09:56,561 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1316#true} {1323#(<= main_~t~0 main_~tagbuf_len~0)} #136#return; {1323#(<= main_~t~0 main_~tagbuf_len~0)} is VALID [2018-11-23 13:09:56,561 INFO L256 TraceCheckUtils]: 42: Hoare triple {1323#(<= main_~t~0 main_~tagbuf_len~0)} call __VERIFIER_assert((if ~t~0 <= ~tagbuf_len~0 then 1 else 0)); {1454#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:09:56,562 INFO L273 TraceCheckUtils]: 43: Hoare triple {1454#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1458#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:09:56,563 INFO L273 TraceCheckUtils]: 44: Hoare triple {1458#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1317#false} is VALID [2018-11-23 13:09:56,563 INFO L273 TraceCheckUtils]: 45: Hoare triple {1317#false} assume !false; {1317#false} is VALID [2018-11-23 13:09:56,565 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 13:09:56,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:56,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2018-11-23 13:09:56,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-11-23 13:09:56,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:56,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:09:56,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:56,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:09:56,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:09:56,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:09:56,749 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand 11 states. [2018-11-23 13:09:57,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:57,950 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2018-11-23 13:09:57,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:09:57,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2018-11-23 13:09:57,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:09:57,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2018-11-23 13:09:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:09:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 63 transitions. [2018-11-23 13:09:57,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 63 transitions. [2018-11-23 13:09:58,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:58,068 INFO L225 Difference]: With dead ends: 77 [2018-11-23 13:09:58,069 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:09:58,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:09:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:09:58,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:09:58,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:58,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:58,071 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:58,072 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:58,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:58,072 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:09:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:58,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:58,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:58,073 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:58,073 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:09:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:58,073 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:09:58,073 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:58,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:58,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:58,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:58,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:58,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:09:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:09:58,074 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-11-23 13:09:58,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:58,075 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:09:58,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:09:58,075 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:09:58,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:58,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:09:58,614 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:09:58,614 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:09:58,614 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:09:58,614 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:09:58,614 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:09:58,614 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:09:58,615 INFO L444 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,615 INFO L451 ceAbstractionStarter]: At program point L60(lines 11 63) the Hoare annotation is: true [2018-11-23 13:09:58,615 INFO L444 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,615 INFO L444 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,615 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 63) no Hoare annotation was computed. [2018-11-23 13:09:58,615 INFO L448 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2018-11-23 13:09:58,615 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 54) no Hoare annotation was computed. [2018-11-23 13:09:58,615 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2018-11-23 13:09:58,615 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-23 13:09:58,615 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2018-11-23 13:09:58,616 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 54) no Hoare annotation was computed. [2018-11-23 13:09:58,616 INFO L444 ceAbstractionStarter]: At program point L40-1(lines 40 54) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,616 INFO L444 ceAbstractionStarter]: At program point L36(line 36) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,616 INFO L444 ceAbstractionStarter]: At program point L36-1(line 36) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,616 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-11-23 13:09:58,616 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-23 13:09:58,616 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-23 13:09:58,616 INFO L444 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,616 INFO L444 ceAbstractionStarter]: At program point L20-1(line 20) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,616 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 49) no Hoare annotation was computed. [2018-11-23 13:09:58,616 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 50) no Hoare annotation was computed. [2018-11-23 13:09:58,617 INFO L444 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,617 INFO L444 ceAbstractionStarter]: At program point L46-1(line 46) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,617 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 63) no Hoare annotation was computed. [2018-11-23 13:09:58,617 INFO L444 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,617 INFO L444 ceAbstractionStarter]: At program point L42-1(line 42) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,617 INFO L444 ceAbstractionStarter]: At program point L34-2(lines 34 58) the Hoare annotation is: (and (<= 1 main_~tagbuf_len~0) (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,617 INFO L444 ceAbstractionStarter]: At program point L34-3(lines 34 58) the Hoare annotation is: (and (<= 1 main_~tagbuf_len~0) (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,618 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 63) the Hoare annotation is: true [2018-11-23 13:09:58,618 INFO L444 ceAbstractionStarter]: At program point L59(line 59) the Hoare annotation is: (and (<= 1 main_~tagbuf_len~0) (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,618 INFO L444 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,618 INFO L444 ceAbstractionStarter]: At program point L18-2(lines 18 30) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,618 INFO L444 ceAbstractionStarter]: At program point L18-3(lines 18 30) the Hoare annotation is: (and (<= (+ main_~t~0 1) main_~tagbuf_len~0) (<= 0 main_~t~0)) [2018-11-23 13:09:58,618 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-23 13:09:58,618 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 39) no Hoare annotation was computed. [2018-11-23 13:09:58,619 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:09:58,619 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:09:58,619 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:09:58,619 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:09:58,619 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:09:58,619 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:09:58,621 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:09:58,622 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:09:58,622 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:09:58,622 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:09:58,622 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:09:58,622 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:09:58,622 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:09:58,622 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:09:58,622 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:09:58,623 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:09:58,623 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2018-11-23 13:09:58,623 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:09:58,623 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:09:58,623 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:09:58,623 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:09:58,653 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 13:09:58,653 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:09:58,653 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,653 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,653 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,653 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,654 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,654 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,654 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,654 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,654 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,654 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,654 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,654 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,654 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,654 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,655 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,655 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:09:58,655 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 13:09:58,655 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 13:09:58,655 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:09:58,655 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-11-23 13:09:58,655 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2018-11-23 13:09:58,655 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 13:09:58,656 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 13:09:58,656 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-23 13:09:58,656 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-23 13:09:58,656 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-23 13:09:58,656 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-11-23 13:09:58,656 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:09:58,656 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2018-11-23 13:09:58,663 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 13:09:58,663 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-23 13:09:58,663 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-23 13:09:58,663 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 13:09:58,663 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2018-11-23 13:09:58,663 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-23 13:09:58,663 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-23 13:09:58,664 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 13:09:58,664 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-23 13:09:58,664 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-23 13:09:58,664 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2018-11-23 13:09:58,664 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. [2018-11-23 13:09:58,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:09:58 BoogieIcfgContainer [2018-11-23 13:09:58,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:09:58,674 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:09:58,674 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:09:58,674 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:09:58,675 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:09:48" (3/4) ... [2018-11-23 13:09:58,678 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:09:58,683 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:09:58,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:09:58,684 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:09:58,690 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 13:09:58,690 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 13:09:58,690 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:09:58,767 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:09:58,767 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:09:58,768 INFO L168 Benchmark]: Toolchain (without parser) took 11586.30 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 857.7 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -615.1 MB). Peak memory consumption was 242.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:58,773 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:58,773 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:58,774 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:58,774 INFO L168 Benchmark]: Boogie Preprocessor took 27.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:58,774 INFO L168 Benchmark]: RCFGBuilder took 1066.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:58,775 INFO L168 Benchmark]: TraceAbstraction took 10008.13 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 130.0 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 139.3 MB). Peak memory consumption was 269.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:09:58,775 INFO L168 Benchmark]: Witness Printer took 92.95 ms. Allocated memory is still 2.4 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:09:58,778 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 364.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 20.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1066.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10008.13 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 130.0 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 139.3 MB). Peak memory consumption was 269.4 MB. Max. memory is 7.1 GB. * Witness Printer took 92.95 ms. Allocated memory is still 2.4 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: t <= tagbuf_len && 0 <= t - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (1 <= tagbuf_len && t <= tagbuf_len) && 0 <= t - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 47 locations, 1 error locations. SAFE Result, 9.8s OverallTime, 5 OverallIterations, 6 TraceHistogramMax, 6.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 208 SDtfs, 153 SDslu, 536 SDs, 0 SdLazy, 600 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 87 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 69 PreInvPairs, 103 NumberOfFragments, 157 HoareAnnotationTreeSize, 69 FomulaSimplifications, 124 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 124 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 12377 SizeOfPredicates, 10 NumberOfNonLiveVariables, 174 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 77/108 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...