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/AutomizerC.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.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:34:39,279 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:34:39,281 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:34:39,295 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:34:39,296 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:34:39,297 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:34:39,299 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:34:39,302 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:34:39,304 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:34:39,311 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:34:39,314 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:34:39,314 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:34:39,315 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:34:39,316 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:34:39,318 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:34:39,318 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:34:39,320 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:34:39,323 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:34:39,326 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:34:39,330 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:34:39,331 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:34:39,333 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:34:39,339 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:34:39,339 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:34:39,339 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:34:39,341 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:34:39,342 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:34:39,344 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:34:39,345 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:34:39,346 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:34:39,346 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:34:39,347 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:34:39,347 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:34:39,347 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:34:39,350 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:34:39,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:34:39,351 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-14 17:34:39,377 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:34:39,378 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:34:39,379 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:34:39,379 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:34:39,379 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:34:39,380 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:34:39,380 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:34:39,380 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:34:39,380 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:34:39,380 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:34:39,381 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:34:39,381 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:34:39,381 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:34:39,381 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:34:39,381 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:34:39,381 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:34:39,382 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:34:39,382 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:34:39,382 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:34:39,382 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:34:39,382 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:34:39,383 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:34:39,383 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:34:39,383 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:34:39,383 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:34:39,383 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:34:39,384 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:34:39,384 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:34:39,384 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:34:39,384 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:34:39,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:34:39,453 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:34:39,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:34:39,459 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:34:39,460 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:34:39,462 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.i.v+lhb-reducer.c [2018-11-14 17:34:39,532 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8abaf296c/d144a28bb4314c28a89930b637af69d7/FLAGb37073b5d [2018-11-14 17:34:40,058 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:34:40,059 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-11-14 17:34:40,075 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8abaf296c/d144a28bb4314c28a89930b637af69d7/FLAGb37073b5d [2018-11-14 17:34:40,089 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8abaf296c/d144a28bb4314c28a89930b637af69d7 [2018-11-14 17:34:40,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:34:40,101 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:34:40,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:34:40,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:34:40,106 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:34:40,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:34:40" (1/1) ... [2018-11-14 17:34:40,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30414706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:40, skipping insertion in model container [2018-11-14 17:34:40,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:34:40" (1/1) ... [2018-11-14 17:34:40,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:34:40,156 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:34:40,425 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:34:40,438 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:34:40,495 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:34:40,512 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:34:40,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:40 WrapperNode [2018-11-14 17:34:40,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:34:40,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:34:40,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:34:40,514 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:34:40,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:40" (1/1) ... [2018-11-14 17:34:40,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:40" (1/1) ... [2018-11-14 17:34:40,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:40" (1/1) ... [2018-11-14 17:34:40,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:40" (1/1) ... [2018-11-14 17:34:40,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:40" (1/1) ... [2018-11-14 17:34:40,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:40" (1/1) ... [2018-11-14 17:34:40,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:40" (1/1) ... [2018-11-14 17:34:40,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:34:40,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:34:40,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:34:40,568 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:34:40,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:40" (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-14 17:34:40,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:34:40,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:34:40,725 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:34:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:34:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:34:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:34:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:34:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:34:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:34:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:34:41,885 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:34:41,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:34:41 BoogieIcfgContainer [2018-11-14 17:34:41,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:34:41,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:34:41,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:34:41,891 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:34:41,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:34:40" (1/3) ... [2018-11-14 17:34:41,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282fe3d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:34:41, skipping insertion in model container [2018-11-14 17:34:41,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:34:40" (2/3) ... [2018-11-14 17:34:41,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282fe3d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:34:41, skipping insertion in model container [2018-11-14 17:34:41,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:34:41" (3/3) ... [2018-11-14 17:34:41,895 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+lhb-reducer.c [2018-11-14 17:34:41,905 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:34:41,914 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-11-14 17:34:41,931 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-11-14 17:34:41,964 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:34:41,965 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:34:41,965 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:34:41,965 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:34:41,966 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:34:41,966 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:34:41,966 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:34:41,966 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:34:41,966 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:34:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2018-11-14 17:34:41,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 17:34:41,998 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:41,999 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:42,003 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:42,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:42,010 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2018-11-14 17:34:42,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:42,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:42,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:42,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:42,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:42,405 INFO L256 TraceCheckUtils]: 0: Hoare triple {83#true} call ULTIMATE.init(); {83#true} is VALID [2018-11-14 17:34:42,409 INFO L273 TraceCheckUtils]: 1: Hoare triple {83#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {83#true} is VALID [2018-11-14 17:34:42,409 INFO L273 TraceCheckUtils]: 2: Hoare triple {83#true} assume true; {83#true} is VALID [2018-11-14 17:34:42,410 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {83#true} {83#true} #181#return; {83#true} is VALID [2018-11-14 17:34:42,410 INFO L256 TraceCheckUtils]: 4: Hoare triple {83#true} call #t~ret7 := main(); {83#true} is VALID [2018-11-14 17:34:42,410 INFO L273 TraceCheckUtils]: 5: Hoare triple {83#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {83#true} is VALID [2018-11-14 17:34:42,411 INFO L273 TraceCheckUtils]: 6: Hoare triple {83#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {85#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:42,421 INFO L273 TraceCheckUtils]: 7: Hoare triple {85#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {85#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:42,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {85#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {86#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~12 1))} is VALID [2018-11-14 17:34:42,431 INFO L273 TraceCheckUtils]: 9: Hoare triple {86#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~12 1))} assume !(~__VERIFIER_assert__cond~12 == 0);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {87#(not (= 0 main_~__VERIFIER_assert__cond~13))} is VALID [2018-11-14 17:34:42,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {87#(not (= 0 main_~__VERIFIER_assert__cond~13))} assume ~__VERIFIER_assert__cond~13 == 0; {84#false} is VALID [2018-11-14 17:34:42,432 INFO L273 TraceCheckUtils]: 11: Hoare triple {84#false} assume !false; {84#false} is VALID [2018-11-14 17:34:42,435 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-14 17:34:42,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:42,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:34:42,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 17:34:42,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:42,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:34:42,542 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-14 17:34:42,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:34:42,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:34:42,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:34:42,556 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 5 states. [2018-11-14 17:34:42,981 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-14 17:34:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:44,207 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2018-11-14 17:34:44,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:34:44,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 17:34:44,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:44,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2018-11-14 17:34:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2018-11-14 17:34:44,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 170 transitions. [2018-11-14 17:34:44,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:44,498 INFO L225 Difference]: With dead ends: 127 [2018-11-14 17:34:44,498 INFO L226 Difference]: Without dead ends: 111 [2018-11-14 17:34:44,501 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:34:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-14 17:34:44,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2018-11-14 17:34:44,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:44,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 73 states. [2018-11-14 17:34:44,572 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 73 states. [2018-11-14 17:34:44,573 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 73 states. [2018-11-14 17:34:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:44,583 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-11-14 17:34:44,583 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-11-14 17:34:44,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:44,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:44,585 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 111 states. [2018-11-14 17:34:44,585 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 111 states. [2018-11-14 17:34:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:44,595 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-11-14 17:34:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2018-11-14 17:34:44,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:44,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:44,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:44,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-14 17:34:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-11-14 17:34:44,604 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2018-11-14 17:34:44,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:44,605 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-11-14 17:34:44,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:34:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-11-14 17:34:44,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 17:34:44,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:44,606 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:44,607 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:44,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:44,607 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2018-11-14 17:34:44,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:44,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:44,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:44,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:44,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:44,737 INFO L256 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2018-11-14 17:34:44,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {538#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {538#true} is VALID [2018-11-14 17:34:44,738 INFO L273 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2018-11-14 17:34:44,739 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #181#return; {538#true} is VALID [2018-11-14 17:34:44,739 INFO L256 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret7 := main(); {538#true} is VALID [2018-11-14 17:34:44,740 INFO L273 TraceCheckUtils]: 5: Hoare triple {538#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {538#true} is VALID [2018-11-14 17:34:44,758 INFO L273 TraceCheckUtils]: 6: Hoare triple {538#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {540#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:44,763 INFO L273 TraceCheckUtils]: 7: Hoare triple {540#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {540#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:44,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {540#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {541#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-14 17:34:44,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {541#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {542#(not (= 0 main_~__VERIFIER_assert__cond~1))} is VALID [2018-11-14 17:34:44,765 INFO L273 TraceCheckUtils]: 10: Hoare triple {542#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume ~__VERIFIER_assert__cond~1 == 0; {539#false} is VALID [2018-11-14 17:34:44,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {539#false} assume !false; {539#false} is VALID [2018-11-14 17:34:44,767 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-14 17:34:44,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:44,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:34:44,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 17:34:44,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:44,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:34:44,789 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-14 17:34:44,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:34:44,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:34:44,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:34:44,791 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 5 states. [2018-11-14 17:34:45,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:45,418 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-11-14 17:34:45,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:34:45,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-14 17:34:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2018-11-14 17:34:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:34:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2018-11-14 17:34:45,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 117 transitions. [2018-11-14 17:34:45,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:45,677 INFO L225 Difference]: With dead ends: 111 [2018-11-14 17:34:45,678 INFO L226 Difference]: Without dead ends: 109 [2018-11-14 17:34:45,679 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:34:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-14 17:34:45,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2018-11-14 17:34:45,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:45,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 71 states. [2018-11-14 17:34:45,739 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 71 states. [2018-11-14 17:34:45,740 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 71 states. [2018-11-14 17:34:45,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:45,746 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-11-14 17:34:45,746 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-11-14 17:34:45,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:45,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:45,748 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 109 states. [2018-11-14 17:34:45,748 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 109 states. [2018-11-14 17:34:45,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:45,754 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-11-14 17:34:45,754 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-11-14 17:34:45,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:45,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:45,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:45,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-14 17:34:45,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-14 17:34:45,760 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2018-11-14 17:34:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:45,761 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-14 17:34:45,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:34:45,761 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-14 17:34:45,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:34:45,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:45,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:45,763 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:45,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:45,763 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2018-11-14 17:34:45,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:45,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:45,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:45,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:45,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:45,928 INFO L256 TraceCheckUtils]: 0: Hoare triple {969#true} call ULTIMATE.init(); {969#true} is VALID [2018-11-14 17:34:45,929 INFO L273 TraceCheckUtils]: 1: Hoare triple {969#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {969#true} is VALID [2018-11-14 17:34:45,929 INFO L273 TraceCheckUtils]: 2: Hoare triple {969#true} assume true; {969#true} is VALID [2018-11-14 17:34:45,929 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {969#true} {969#true} #181#return; {969#true} is VALID [2018-11-14 17:34:45,930 INFO L256 TraceCheckUtils]: 4: Hoare triple {969#true} call #t~ret7 := main(); {969#true} is VALID [2018-11-14 17:34:45,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {969#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {969#true} is VALID [2018-11-14 17:34:45,930 INFO L273 TraceCheckUtils]: 6: Hoare triple {969#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {971#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:45,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {971#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {971#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:45,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {971#(<= 0 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {972#(and (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:45,932 INFO L273 TraceCheckUtils]: 9: Hoare triple {972#(and (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~12 == 0);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {971#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:45,933 INFO L273 TraceCheckUtils]: 10: Hoare triple {971#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~13 == 0);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {971#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:45,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {971#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {973#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:45,936 INFO L273 TraceCheckUtils]: 12: Hoare triple {973#(<= 1 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {974#(not (= 0 main_~__VERIFIER_assert__cond~14))} is VALID [2018-11-14 17:34:45,937 INFO L273 TraceCheckUtils]: 13: Hoare triple {974#(not (= 0 main_~__VERIFIER_assert__cond~14))} assume ~__VERIFIER_assert__cond~14 == 0; {970#false} is VALID [2018-11-14 17:34:45,937 INFO L273 TraceCheckUtils]: 14: Hoare triple {970#false} assume !false; {970#false} is VALID [2018-11-14 17:34:45,939 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-14 17:34:45,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:45,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:45,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 17:34:45,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:45,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:45,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:45,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:45,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:45,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:45,960 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2018-11-14 17:34:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:46,703 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-11-14 17:34:46,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:46,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 17:34:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2018-11-14 17:34:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2018-11-14 17:34:46,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 115 transitions. [2018-11-14 17:34:46,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:46,870 INFO L225 Difference]: With dead ends: 109 [2018-11-14 17:34:46,870 INFO L226 Difference]: Without dead ends: 107 [2018-11-14 17:34:46,871 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:34:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-14 17:34:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2018-11-14 17:34:46,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:46,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 69 states. [2018-11-14 17:34:46,905 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 69 states. [2018-11-14 17:34:46,905 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 69 states. [2018-11-14 17:34:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:46,910 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-11-14 17:34:46,910 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-11-14 17:34:46,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:46,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:46,911 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 107 states. [2018-11-14 17:34:46,912 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 107 states. [2018-11-14 17:34:46,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:46,916 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-11-14 17:34:46,916 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-11-14 17:34:46,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:46,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:46,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:46,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-14 17:34:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-14 17:34:46,921 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2018-11-14 17:34:46,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:46,921 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-14 17:34:46,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-14 17:34:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:34:46,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:46,922 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:46,923 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:46,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:46,924 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2018-11-14 17:34:46,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:46,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:46,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:46,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:46,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:47,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {1393#true} call ULTIMATE.init(); {1393#true} is VALID [2018-11-14 17:34:47,073 INFO L273 TraceCheckUtils]: 1: Hoare triple {1393#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1393#true} is VALID [2018-11-14 17:34:47,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {1393#true} assume true; {1393#true} is VALID [2018-11-14 17:34:47,073 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1393#true} {1393#true} #181#return; {1393#true} is VALID [2018-11-14 17:34:47,074 INFO L256 TraceCheckUtils]: 4: Hoare triple {1393#true} call #t~ret7 := main(); {1393#true} is VALID [2018-11-14 17:34:47,074 INFO L273 TraceCheckUtils]: 5: Hoare triple {1393#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1393#true} is VALID [2018-11-14 17:34:47,075 INFO L273 TraceCheckUtils]: 6: Hoare triple {1393#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1395#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:47,076 INFO L273 TraceCheckUtils]: 7: Hoare triple {1395#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {1395#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:47,077 INFO L273 TraceCheckUtils]: 8: Hoare triple {1395#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1396#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:47,077 INFO L273 TraceCheckUtils]: 9: Hoare triple {1396#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1395#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:47,080 INFO L273 TraceCheckUtils]: 10: Hoare triple {1395#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~1 == 0);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {1395#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:47,080 INFO L273 TraceCheckUtils]: 11: Hoare triple {1395#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {1397#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:47,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {1397#(<= 1 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1398#(not (= 0 main_~__VERIFIER_assert__cond~2))} is VALID [2018-11-14 17:34:47,085 INFO L273 TraceCheckUtils]: 13: Hoare triple {1398#(not (= 0 main_~__VERIFIER_assert__cond~2))} assume ~__VERIFIER_assert__cond~2 == 0; {1394#false} is VALID [2018-11-14 17:34:47,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {1394#false} assume !false; {1394#false} is VALID [2018-11-14 17:34:47,086 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-14 17:34:47,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:47,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:47,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 17:34:47,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:47,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:47,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:47,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:47,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:47,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:47,105 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2018-11-14 17:34:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:47,939 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-11-14 17:34:47,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:34:47,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 17:34:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:47,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2018-11-14 17:34:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2018-11-14 17:34:47,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 112 transitions. [2018-11-14 17:34:48,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:48,147 INFO L225 Difference]: With dead ends: 105 [2018-11-14 17:34:48,147 INFO L226 Difference]: Without dead ends: 103 [2018-11-14 17:34:48,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:48,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-14 17:34:48,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 67. [2018-11-14 17:34:48,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:48,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 67 states. [2018-11-14 17:34:48,203 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 67 states. [2018-11-14 17:34:48,203 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 67 states. [2018-11-14 17:34:48,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:48,208 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-11-14 17:34:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2018-11-14 17:34:48,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:48,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:48,208 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 103 states. [2018-11-14 17:34:48,209 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 103 states. [2018-11-14 17:34:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:48,212 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2018-11-14 17:34:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2018-11-14 17:34:48,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:48,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:48,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:48,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-14 17:34:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-14 17:34:48,215 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2018-11-14 17:34:48,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:48,216 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-14 17:34:48,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-14 17:34:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:34:48,217 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:48,217 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:48,217 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:48,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:48,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2018-11-14 17:34:48,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:48,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:48,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:48,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:48,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:48,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {1805#true} call ULTIMATE.init(); {1805#true} is VALID [2018-11-14 17:34:48,369 INFO L273 TraceCheckUtils]: 1: Hoare triple {1805#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1805#true} is VALID [2018-11-14 17:34:48,369 INFO L273 TraceCheckUtils]: 2: Hoare triple {1805#true} assume true; {1805#true} is VALID [2018-11-14 17:34:48,369 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1805#true} {1805#true} #181#return; {1805#true} is VALID [2018-11-14 17:34:48,370 INFO L256 TraceCheckUtils]: 4: Hoare triple {1805#true} call #t~ret7 := main(); {1805#true} is VALID [2018-11-14 17:34:48,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {1805#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {1805#true} is VALID [2018-11-14 17:34:48,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {1805#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1807#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:48,374 INFO L273 TraceCheckUtils]: 7: Hoare triple {1807#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {1807#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:48,377 INFO L273 TraceCheckUtils]: 8: Hoare triple {1807#(<= 0 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {1808#(and (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:48,377 INFO L273 TraceCheckUtils]: 9: Hoare triple {1808#(and (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~12 == 0);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {1807#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:48,379 INFO L273 TraceCheckUtils]: 10: Hoare triple {1807#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~13 == 0);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {1807#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:48,379 INFO L273 TraceCheckUtils]: 11: Hoare triple {1807#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {1809#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:48,381 INFO L273 TraceCheckUtils]: 12: Hoare triple {1809#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {1809#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:48,383 INFO L273 TraceCheckUtils]: 13: Hoare triple {1809#(<= 1 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~1 == 0);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {1810#(not (= 0 main_~__VERIFIER_assert__cond~18))} is VALID [2018-11-14 17:34:48,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {1810#(not (= 0 main_~__VERIFIER_assert__cond~18))} assume ~__VERIFIER_assert__cond~18 == 0; {1806#false} is VALID [2018-11-14 17:34:48,384 INFO L273 TraceCheckUtils]: 15: Hoare triple {1806#false} assume !false; {1806#false} is VALID [2018-11-14 17:34:48,385 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-14 17:34:48,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:48,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:48,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 17:34:48,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:48,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:48,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:48,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:48,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:48,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:48,415 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2018-11-14 17:34:49,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:49,194 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2018-11-14 17:34:49,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:49,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 17:34:49,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2018-11-14 17:34:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:49,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2018-11-14 17:34:49,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 159 transitions. [2018-11-14 17:34:49,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:49,410 INFO L225 Difference]: With dead ends: 150 [2018-11-14 17:34:49,410 INFO L226 Difference]: Without dead ends: 148 [2018-11-14 17:34:49,411 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:34:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-14 17:34:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 65. [2018-11-14 17:34:49,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:49,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 65 states. [2018-11-14 17:34:49,437 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 65 states. [2018-11-14 17:34:49,438 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 65 states. [2018-11-14 17:34:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:49,443 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2018-11-14 17:34:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2018-11-14 17:34:49,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:49,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:49,444 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 148 states. [2018-11-14 17:34:49,445 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 148 states. [2018-11-14 17:34:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:49,450 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2018-11-14 17:34:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2018-11-14 17:34:49,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:49,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:49,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:49,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 17:34:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-14 17:34:49,454 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 16 [2018-11-14 17:34:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:49,454 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-14 17:34:49,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:49,455 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-14 17:34:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:34:49,455 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:49,455 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:49,456 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:49,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:49,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2018-11-14 17:34:49,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:49,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:49,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:49,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:49,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:49,611 INFO L256 TraceCheckUtils]: 0: Hoare triple {2351#true} call ULTIMATE.init(); {2351#true} is VALID [2018-11-14 17:34:49,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {2351#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2351#true} is VALID [2018-11-14 17:34:49,612 INFO L273 TraceCheckUtils]: 2: Hoare triple {2351#true} assume true; {2351#true} is VALID [2018-11-14 17:34:49,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2351#true} {2351#true} #181#return; {2351#true} is VALID [2018-11-14 17:34:49,613 INFO L256 TraceCheckUtils]: 4: Hoare triple {2351#true} call #t~ret7 := main(); {2351#true} is VALID [2018-11-14 17:34:49,613 INFO L273 TraceCheckUtils]: 5: Hoare triple {2351#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {2351#true} is VALID [2018-11-14 17:34:49,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {2351#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2353#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:49,615 INFO L273 TraceCheckUtils]: 7: Hoare triple {2353#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {2353#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:49,616 INFO L273 TraceCheckUtils]: 8: Hoare triple {2353#(<= 0 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {2354#(and (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:49,616 INFO L273 TraceCheckUtils]: 9: Hoare triple {2354#(and (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~12 == 0);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {2353#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:49,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {2353#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~13 == 0);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {2353#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:49,617 INFO L273 TraceCheckUtils]: 11: Hoare triple {2353#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {2355#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:49,619 INFO L273 TraceCheckUtils]: 12: Hoare triple {2355#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {2355#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:49,619 INFO L273 TraceCheckUtils]: 13: Hoare triple {2355#(<= 1 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~1 == 0);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {2356#(not (= 0 main_~__VERIFIER_assert__cond~16))} is VALID [2018-11-14 17:34:49,620 INFO L273 TraceCheckUtils]: 14: Hoare triple {2356#(not (= 0 main_~__VERIFIER_assert__cond~16))} assume ~__VERIFIER_assert__cond~16 == 0; {2352#false} is VALID [2018-11-14 17:34:49,620 INFO L273 TraceCheckUtils]: 15: Hoare triple {2352#false} assume !false; {2352#false} is VALID [2018-11-14 17:34:49,621 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-14 17:34:49,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:49,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:49,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 17:34:49,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:49,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:49,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:49,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:49,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:49,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:49,643 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2018-11-14 17:34:50,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:50,120 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-11-14 17:34:50,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:50,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 17:34:50,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2018-11-14 17:34:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:50,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2018-11-14 17:34:50,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 107 transitions. [2018-11-14 17:34:50,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:50,237 INFO L225 Difference]: With dead ends: 101 [2018-11-14 17:34:50,237 INFO L226 Difference]: Without dead ends: 99 [2018-11-14 17:34:50,238 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:34:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-14 17:34:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2018-11-14 17:34:50,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:50,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 63 states. [2018-11-14 17:34:50,267 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 63 states. [2018-11-14 17:34:50,267 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 63 states. [2018-11-14 17:34:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:50,271 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-11-14 17:34:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-11-14 17:34:50,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:50,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:50,272 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 99 states. [2018-11-14 17:34:50,272 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 99 states. [2018-11-14 17:34:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:50,275 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-11-14 17:34:50,275 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-11-14 17:34:50,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:50,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:50,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:50,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:50,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-14 17:34:50,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-14 17:34:50,278 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2018-11-14 17:34:50,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:50,278 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-14 17:34:50,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-11-14 17:34:50,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:34:50,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:50,279 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:50,280 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:50,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:50,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2018-11-14 17:34:50,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:50,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:50,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:50,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:50,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:50,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {2745#true} call ULTIMATE.init(); {2745#true} is VALID [2018-11-14 17:34:50,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {2745#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2745#true} is VALID [2018-11-14 17:34:50,428 INFO L273 TraceCheckUtils]: 2: Hoare triple {2745#true} assume true; {2745#true} is VALID [2018-11-14 17:34:50,428 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2745#true} {2745#true} #181#return; {2745#true} is VALID [2018-11-14 17:34:50,428 INFO L256 TraceCheckUtils]: 4: Hoare triple {2745#true} call #t~ret7 := main(); {2745#true} is VALID [2018-11-14 17:34:50,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {2745#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {2745#true} is VALID [2018-11-14 17:34:50,429 INFO L273 TraceCheckUtils]: 6: Hoare triple {2745#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2747#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:50,429 INFO L273 TraceCheckUtils]: 7: Hoare triple {2747#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {2747#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:50,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {2747#(<= 0 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {2748#(= main_~__VERIFIER_assert__cond~12 1)} is VALID [2018-11-14 17:34:50,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {2748#(= main_~__VERIFIER_assert__cond~12 1)} assume !(~__VERIFIER_assert__cond~12 == 0);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {2745#true} is VALID [2018-11-14 17:34:50,430 INFO L273 TraceCheckUtils]: 10: Hoare triple {2745#true} assume !(~__VERIFIER_assert__cond~13 == 0);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {2745#true} is VALID [2018-11-14 17:34:50,431 INFO L273 TraceCheckUtils]: 11: Hoare triple {2745#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {2745#true} is VALID [2018-11-14 17:34:50,431 INFO L273 TraceCheckUtils]: 12: Hoare triple {2745#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_15~0;~__tmp_15~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {2749#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:50,432 INFO L273 TraceCheckUtils]: 13: Hoare triple {2749#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~14 == 0);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {2750#(not (= 0 main_~__VERIFIER_assert__cond~15))} is VALID [2018-11-14 17:34:50,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {2750#(not (= 0 main_~__VERIFIER_assert__cond~15))} assume ~__VERIFIER_assert__cond~15 == 0; {2746#false} is VALID [2018-11-14 17:34:50,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {2746#false} assume !false; {2746#false} is VALID [2018-11-14 17:34:50,436 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-14 17:34:50,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:50,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:50,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 17:34:50,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:50,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:50,451 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:50,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:50,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:50,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:50,452 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 6 states. [2018-11-14 17:34:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:50,995 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-11-14 17:34:50,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:50,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 17:34:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:50,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-11-14 17:34:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-11-14 17:34:51,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 105 transitions. [2018-11-14 17:34:51,321 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:51,323 INFO L225 Difference]: With dead ends: 99 [2018-11-14 17:34:51,323 INFO L226 Difference]: Without dead ends: 95 [2018-11-14 17:34:51,324 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:34:51,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-14 17:34:51,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 59. [2018-11-14 17:34:51,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:51,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 59 states. [2018-11-14 17:34:51,346 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 59 states. [2018-11-14 17:34:51,346 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 59 states. [2018-11-14 17:34:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:51,349 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-11-14 17:34:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-11-14 17:34:51,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:51,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:51,349 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 95 states. [2018-11-14 17:34:51,350 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 95 states. [2018-11-14 17:34:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:51,353 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-11-14 17:34:51,353 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-11-14 17:34:51,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:51,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:51,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:51,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:51,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 17:34:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-14 17:34:51,356 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2018-11-14 17:34:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:51,356 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-14 17:34:51,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-11-14 17:34:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:34:51,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:51,357 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:51,358 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:51,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:51,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2018-11-14 17:34:51,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:51,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:51,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:51,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:51,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:51,700 INFO L256 TraceCheckUtils]: 0: Hoare triple {3131#true} call ULTIMATE.init(); {3131#true} is VALID [2018-11-14 17:34:51,701 INFO L273 TraceCheckUtils]: 1: Hoare triple {3131#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3131#true} is VALID [2018-11-14 17:34:51,701 INFO L273 TraceCheckUtils]: 2: Hoare triple {3131#true} assume true; {3131#true} is VALID [2018-11-14 17:34:51,701 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3131#true} {3131#true} #181#return; {3131#true} is VALID [2018-11-14 17:34:51,702 INFO L256 TraceCheckUtils]: 4: Hoare triple {3131#true} call #t~ret7 := main(); {3131#true} is VALID [2018-11-14 17:34:51,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {3131#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {3131#true} is VALID [2018-11-14 17:34:51,708 INFO L273 TraceCheckUtils]: 6: Hoare triple {3131#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3133#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:51,708 INFO L273 TraceCheckUtils]: 7: Hoare triple {3133#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {3133#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:51,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {3133#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3134#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:34:51,710 INFO L273 TraceCheckUtils]: 9: Hoare triple {3134#(= main_~__VERIFIER_assert__cond~0 1)} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3131#true} is VALID [2018-11-14 17:34:51,710 INFO L273 TraceCheckUtils]: 10: Hoare triple {3131#true} assume !(~__VERIFIER_assert__cond~1 == 0);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {3131#true} is VALID [2018-11-14 17:34:51,710 INFO L273 TraceCheckUtils]: 11: Hoare triple {3131#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {3131#true} is VALID [2018-11-14 17:34:51,710 INFO L273 TraceCheckUtils]: 12: Hoare triple {3131#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_3~0;~__tmp_3~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3135#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:51,711 INFO L273 TraceCheckUtils]: 13: Hoare triple {3135#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~2 == 0);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3136#(not (= 0 main_~__VERIFIER_assert__cond~3))} is VALID [2018-11-14 17:34:51,712 INFO L273 TraceCheckUtils]: 14: Hoare triple {3136#(not (= 0 main_~__VERIFIER_assert__cond~3))} assume ~__VERIFIER_assert__cond~3 == 0; {3132#false} is VALID [2018-11-14 17:34:51,712 INFO L273 TraceCheckUtils]: 15: Hoare triple {3132#false} assume !false; {3132#false} is VALID [2018-11-14 17:34:51,713 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-14 17:34:51,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:51,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:51,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 17:34:51,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:51,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:51,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:51,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:51,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:51,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:51,728 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states. [2018-11-14 17:34:52,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:52,145 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-11-14 17:34:52,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:34:52,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-14 17:34:52,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:52,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2018-11-14 17:34:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2018-11-14 17:34:52,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 100 transitions. [2018-11-14 17:34:52,284 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:52,286 INFO L225 Difference]: With dead ends: 93 [2018-11-14 17:34:52,287 INFO L226 Difference]: Without dead ends: 87 [2018-11-14 17:34:52,287 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:34:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-14 17:34:52,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 55. [2018-11-14 17:34:52,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:52,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 55 states. [2018-11-14 17:34:52,338 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 55 states. [2018-11-14 17:34:52,338 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 55 states. [2018-11-14 17:34:52,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:52,341 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-11-14 17:34:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-11-14 17:34:52,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:52,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:52,342 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 87 states. [2018-11-14 17:34:52,342 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 87 states. [2018-11-14 17:34:52,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:52,344 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-11-14 17:34:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-11-14 17:34:52,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:52,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:52,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:52,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-14 17:34:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-14 17:34:52,346 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2018-11-14 17:34:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:52,346 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-14 17:34:52,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-11-14 17:34:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:34:52,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:52,347 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:52,347 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:52,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:52,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2018-11-14 17:34:52,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:52,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:52,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:52,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:52,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:52,659 INFO L256 TraceCheckUtils]: 0: Hoare triple {3493#true} call ULTIMATE.init(); {3493#true} is VALID [2018-11-14 17:34:52,660 INFO L273 TraceCheckUtils]: 1: Hoare triple {3493#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3493#true} is VALID [2018-11-14 17:34:52,660 INFO L273 TraceCheckUtils]: 2: Hoare triple {3493#true} assume true; {3493#true} is VALID [2018-11-14 17:34:52,660 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3493#true} {3493#true} #181#return; {3493#true} is VALID [2018-11-14 17:34:52,660 INFO L256 TraceCheckUtils]: 4: Hoare triple {3493#true} call #t~ret7 := main(); {3493#true} is VALID [2018-11-14 17:34:52,661 INFO L273 TraceCheckUtils]: 5: Hoare triple {3493#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {3493#true} is VALID [2018-11-14 17:34:52,675 INFO L273 TraceCheckUtils]: 6: Hoare triple {3493#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3495#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:52,676 INFO L273 TraceCheckUtils]: 7: Hoare triple {3495#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {3496#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:52,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {3496#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {3497#(and (= main_~__VERIFIER_assert__cond~12 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 17:34:52,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {3497#(and (= main_~__VERIFIER_assert__cond~12 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~12 == 0);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {3498#(or (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= 0 main_~__VERIFIER_assert__cond~13))} is VALID [2018-11-14 17:34:52,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {3498#(or (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= 0 main_~__VERIFIER_assert__cond~13))} assume !(~__VERIFIER_assert__cond~13 == 0);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {3499#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:52,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {3499#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {3500#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:52,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {3500#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {3500#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:52,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {3500#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(~main____CPAchecker_TMP_0~1 == 0);havoc ~__tmp_19~0;~__tmp_19~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~18;~__VERIFIER_assert__cond~18 := ~__tmp_19~0; {3500#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:52,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {3500#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~18 == 0);havoc ~__tmp_20~0;~__tmp_20~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~19;~__VERIFIER_assert__cond~19 := ~__tmp_20~0; {3501#(not (= 0 main_~__VERIFIER_assert__cond~19))} is VALID [2018-11-14 17:34:52,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {3501#(not (= 0 main_~__VERIFIER_assert__cond~19))} assume ~__VERIFIER_assert__cond~19 == 0; {3494#false} is VALID [2018-11-14 17:34:52,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {3494#false} assume !false; {3494#false} is VALID [2018-11-14 17:34:52,685 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-14 17:34:52,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:52,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 17:34:52,686 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-14 17:34:52,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:52,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:34:52,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:52,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:34:52,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:34:52,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:52,703 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 9 states. [2018-11-14 17:34:53,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:53,667 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-11-14 17:34:53,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:53,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-14 17:34:53,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:53,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:34:53,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2018-11-14 17:34:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:34:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2018-11-14 17:34:53,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2018-11-14 17:34:54,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:54,012 INFO L225 Difference]: With dead ends: 94 [2018-11-14 17:34:54,012 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 17:34:54,013 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:34:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 17:34:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2018-11-14 17:34:54,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:54,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 53 states. [2018-11-14 17:34:54,049 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 53 states. [2018-11-14 17:34:54,049 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 53 states. [2018-11-14 17:34:54,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:54,052 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-11-14 17:34:54,052 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2018-11-14 17:34:54,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:54,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:54,053 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 92 states. [2018-11-14 17:34:54,053 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 92 states. [2018-11-14 17:34:54,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:54,055 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-11-14 17:34:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2018-11-14 17:34:54,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:54,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:54,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:54,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 17:34:54,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-11-14 17:34:54,057 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2018-11-14 17:34:54,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:54,058 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-11-14 17:34:54,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:34:54,058 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-11-14 17:34:54,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:34:54,058 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:54,059 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:54,059 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:54,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:54,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1945179456, now seen corresponding path program 1 times [2018-11-14 17:34:54,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:54,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:54,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:54,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:54,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:54,230 INFO L256 TraceCheckUtils]: 0: Hoare triple {3865#true} call ULTIMATE.init(); {3865#true} is VALID [2018-11-14 17:34:54,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {3865#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3865#true} is VALID [2018-11-14 17:34:54,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {3865#true} assume true; {3865#true} is VALID [2018-11-14 17:34:54,231 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3865#true} {3865#true} #181#return; {3865#true} is VALID [2018-11-14 17:34:54,231 INFO L256 TraceCheckUtils]: 4: Hoare triple {3865#true} call #t~ret7 := main(); {3865#true} is VALID [2018-11-14 17:34:54,232 INFO L273 TraceCheckUtils]: 5: Hoare triple {3865#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {3865#true} is VALID [2018-11-14 17:34:54,232 INFO L273 TraceCheckUtils]: 6: Hoare triple {3865#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3867#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:54,233 INFO L273 TraceCheckUtils]: 7: Hoare triple {3867#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {3868#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:54,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {3868#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !!(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_13~0;~__tmp_13~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {3869#(and (= main_~__VERIFIER_assert__cond~12 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 17:34:54,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {3869#(and (= main_~__VERIFIER_assert__cond~12 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~12 == 0);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {3870#(or (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= 0 main_~__VERIFIER_assert__cond~13))} is VALID [2018-11-14 17:34:54,235 INFO L273 TraceCheckUtils]: 10: Hoare triple {3870#(or (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= 0 main_~__VERIFIER_assert__cond~13))} assume !(~__VERIFIER_assert__cond~13 == 0);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {3871#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:54,235 INFO L273 TraceCheckUtils]: 11: Hoare triple {3871#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {3872#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:54,236 INFO L273 TraceCheckUtils]: 12: Hoare triple {3872#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {3872#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:54,237 INFO L273 TraceCheckUtils]: 13: Hoare triple {3872#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main____CPAchecker_TMP_0~1 == 0);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {3872#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:54,237 INFO L273 TraceCheckUtils]: 14: Hoare triple {3872#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~16 == 0);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {3873#(not (= 0 main_~__VERIFIER_assert__cond~17))} is VALID [2018-11-14 17:34:54,238 INFO L273 TraceCheckUtils]: 15: Hoare triple {3873#(not (= 0 main_~__VERIFIER_assert__cond~17))} assume ~__VERIFIER_assert__cond~17 == 0; {3866#false} is VALID [2018-11-14 17:34:54,238 INFO L273 TraceCheckUtils]: 16: Hoare triple {3866#false} assume !false; {3866#false} is VALID [2018-11-14 17:34:54,239 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-14 17:34:54,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:54,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 17:34:54,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-14 17:34:54,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:54,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:34:54,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:54,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:34:54,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:34:54,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:54,256 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 9 states. [2018-11-14 17:34:55,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:55,576 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-11-14 17:34:55,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:34:55,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-14 17:34:55,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:34:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2018-11-14 17:34:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:34:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2018-11-14 17:34:55,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 91 transitions. [2018-11-14 17:34:55,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:55,689 INFO L225 Difference]: With dead ends: 85 [2018-11-14 17:34:55,689 INFO L226 Difference]: Without dead ends: 83 [2018-11-14 17:34:55,690 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:34:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-14 17:34:55,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 51. [2018-11-14 17:34:55,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:55,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 51 states. [2018-11-14 17:34:55,725 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 51 states. [2018-11-14 17:34:55,725 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 51 states. [2018-11-14 17:34:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:55,728 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-11-14 17:34:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-11-14 17:34:55,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:55,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:55,728 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 83 states. [2018-11-14 17:34:55,729 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 83 states. [2018-11-14 17:34:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:55,730 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-11-14 17:34:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-11-14 17:34:55,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:55,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:55,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:55,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-14 17:34:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-14 17:34:55,732 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-11-14 17:34:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:55,733 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-14 17:34:55,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:34:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 17:34:55,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:34:55,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:55,734 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:55,735 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:55,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:55,735 INFO L82 PathProgramCache]: Analyzing trace with hash 449409464, now seen corresponding path program 1 times [2018-11-14 17:34:55,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:55,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:55,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:55,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:55,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:55,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {4208#true} call ULTIMATE.init(); {4208#true} is VALID [2018-11-14 17:34:55,826 INFO L273 TraceCheckUtils]: 1: Hoare triple {4208#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4208#true} is VALID [2018-11-14 17:34:55,826 INFO L273 TraceCheckUtils]: 2: Hoare triple {4208#true} assume true; {4208#true} is VALID [2018-11-14 17:34:55,826 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4208#true} {4208#true} #181#return; {4208#true} is VALID [2018-11-14 17:34:55,827 INFO L256 TraceCheckUtils]: 4: Hoare triple {4208#true} call #t~ret7 := main(); {4208#true} is VALID [2018-11-14 17:34:55,827 INFO L273 TraceCheckUtils]: 5: Hoare triple {4208#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {4208#true} is VALID [2018-11-14 17:34:55,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {4208#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4210#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:55,828 INFO L273 TraceCheckUtils]: 7: Hoare triple {4210#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {4210#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:55,829 INFO L273 TraceCheckUtils]: 8: Hoare triple {4210#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4211#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:55,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {4211#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4210#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:55,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {4210#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~1 == 0);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {4210#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:55,831 INFO L273 TraceCheckUtils]: 11: Hoare triple {4210#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {4212#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:55,831 INFO L273 TraceCheckUtils]: 12: Hoare triple {4212#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {4212#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:55,841 INFO L273 TraceCheckUtils]: 13: Hoare triple {4212#(<= 1 main_~main__t~0)} assume !(~main____CPAchecker_TMP_3~0 == 0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {4212#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:55,842 INFO L273 TraceCheckUtils]: 14: Hoare triple {4212#(<= 1 main_~main__t~0)} assume !(~main____CPAchecker_TMP_4~0 == 0);havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {4213#(not (= 0 main_~__VERIFIER_assert__cond~4))} is VALID [2018-11-14 17:34:55,842 INFO L273 TraceCheckUtils]: 15: Hoare triple {4213#(not (= 0 main_~__VERIFIER_assert__cond~4))} assume ~__VERIFIER_assert__cond~4 == 0; {4209#false} is VALID [2018-11-14 17:34:55,842 INFO L273 TraceCheckUtils]: 16: Hoare triple {4209#false} assume !false; {4209#false} is VALID [2018-11-14 17:34:55,843 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-14 17:34:55,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:55,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:55,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 17:34:55,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:55,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:55,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:55,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:55,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:55,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:55,883 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2018-11-14 17:34:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:56,428 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2018-11-14 17:34:56,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:34:56,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 17:34:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2018-11-14 17:34:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2018-11-14 17:34:56,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 126 transitions. [2018-11-14 17:34:56,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:56,588 INFO L225 Difference]: With dead ends: 115 [2018-11-14 17:34:56,588 INFO L226 Difference]: Without dead ends: 113 [2018-11-14 17:34:56,588 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:56,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-14 17:34:56,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 49. [2018-11-14 17:34:56,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:56,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 49 states. [2018-11-14 17:34:56,626 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 49 states. [2018-11-14 17:34:56,626 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 49 states. [2018-11-14 17:34:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:56,629 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2018-11-14 17:34:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2018-11-14 17:34:56,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:56,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:56,630 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 113 states. [2018-11-14 17:34:56,630 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 113 states. [2018-11-14 17:34:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:56,633 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2018-11-14 17:34:56,633 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2018-11-14 17:34:56,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:56,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:56,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:56,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 17:34:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-14 17:34:56,635 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 17 [2018-11-14 17:34:56,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:56,636 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-14 17:34:56,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:56,636 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 17:34:56,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:34:56,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:56,637 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:56,637 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:56,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:56,638 INFO L82 PathProgramCache]: Analyzing trace with hash 450948664, now seen corresponding path program 1 times [2018-11-14 17:34:56,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:56,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:56,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:56,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:56,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:56,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {4636#true} call ULTIMATE.init(); {4636#true} is VALID [2018-11-14 17:34:56,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {4636#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4636#true} is VALID [2018-11-14 17:34:56,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {4636#true} assume true; {4636#true} is VALID [2018-11-14 17:34:56,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4636#true} {4636#true} #181#return; {4636#true} is VALID [2018-11-14 17:34:56,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {4636#true} call #t~ret7 := main(); {4636#true} is VALID [2018-11-14 17:34:56,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {4636#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {4636#true} is VALID [2018-11-14 17:34:56,813 INFO L273 TraceCheckUtils]: 6: Hoare triple {4636#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4638#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:56,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {4638#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {4638#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:56,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {4638#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4639#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:56,814 INFO L273 TraceCheckUtils]: 9: Hoare triple {4639#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4638#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:56,814 INFO L273 TraceCheckUtils]: 10: Hoare triple {4638#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~1 == 0);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {4638#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:56,815 INFO L273 TraceCheckUtils]: 11: Hoare triple {4638#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {4640#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:56,815 INFO L273 TraceCheckUtils]: 12: Hoare triple {4640#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {4640#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:56,816 INFO L273 TraceCheckUtils]: 13: Hoare triple {4640#(<= 1 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_3~0 == 0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {4640#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:56,817 INFO L273 TraceCheckUtils]: 14: Hoare triple {4640#(<= 1 main_~main__t~0)} assume !(~main____CPAchecker_TMP_6~0 == 0);havoc ~__tmp_11~0;~__tmp_11~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {4641#(not (= 0 main_~__VERIFIER_assert__cond~10))} is VALID [2018-11-14 17:34:56,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {4641#(not (= 0 main_~__VERIFIER_assert__cond~10))} assume ~__VERIFIER_assert__cond~10 == 0; {4637#false} is VALID [2018-11-14 17:34:56,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {4637#false} assume !false; {4637#false} is VALID [2018-11-14 17:34:56,819 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-14 17:34:56,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:56,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:56,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 17:34:56,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:56,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:56,852 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:56,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:56,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:56,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:56,853 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-11-14 17:34:57,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:57,222 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-11-14 17:34:57,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:34:57,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-14 17:34:57,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2018-11-14 17:34:57,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2018-11-14 17:34:57,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2018-11-14 17:34:57,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:57,326 INFO L225 Difference]: With dead ends: 77 [2018-11-14 17:34:57,327 INFO L226 Difference]: Without dead ends: 75 [2018-11-14 17:34:57,327 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:57,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-14 17:34:57,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 47. [2018-11-14 17:34:57,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:57,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 47 states. [2018-11-14 17:34:57,352 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 47 states. [2018-11-14 17:34:57,352 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 47 states. [2018-11-14 17:34:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:57,355 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-11-14 17:34:57,355 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-11-14 17:34:57,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:57,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:57,356 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 75 states. [2018-11-14 17:34:57,356 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 75 states. [2018-11-14 17:34:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:57,358 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-11-14 17:34:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-11-14 17:34:57,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:57,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:57,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:57,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:34:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-14 17:34:57,360 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2018-11-14 17:34:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:57,360 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-14 17:34:57,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 17:34:57,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:34:57,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:57,361 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:57,361 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:57,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:57,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1048160016, now seen corresponding path program 1 times [2018-11-14 17:34:57,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:57,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:57,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:57,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:57,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:57,942 INFO L256 TraceCheckUtils]: 0: Hoare triple {4944#true} call ULTIMATE.init(); {4944#true} is VALID [2018-11-14 17:34:57,943 INFO L273 TraceCheckUtils]: 1: Hoare triple {4944#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4944#true} is VALID [2018-11-14 17:34:57,943 INFO L273 TraceCheckUtils]: 2: Hoare triple {4944#true} assume true; {4944#true} is VALID [2018-11-14 17:34:57,943 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4944#true} {4944#true} #181#return; {4944#true} is VALID [2018-11-14 17:34:57,943 INFO L256 TraceCheckUtils]: 4: Hoare triple {4944#true} call #t~ret7 := main(); {4944#true} is VALID [2018-11-14 17:34:57,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {4944#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {4944#true} is VALID [2018-11-14 17:34:57,945 INFO L273 TraceCheckUtils]: 6: Hoare triple {4944#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4946#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:57,946 INFO L273 TraceCheckUtils]: 7: Hoare triple {4946#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {4946#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:57,946 INFO L273 TraceCheckUtils]: 8: Hoare triple {4946#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4947#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:57,946 INFO L273 TraceCheckUtils]: 9: Hoare triple {4947#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4946#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:57,947 INFO L273 TraceCheckUtils]: 10: Hoare triple {4946#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~1 == 0);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {4946#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:57,947 INFO L273 TraceCheckUtils]: 11: Hoare triple {4946#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {4948#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:57,948 INFO L273 TraceCheckUtils]: 12: Hoare triple {4948#(<= 1 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {4948#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:57,948 INFO L273 TraceCheckUtils]: 13: Hoare triple {4948#(<= 1 main_~main__t~0)} assume !(~main____CPAchecker_TMP_3~0 == 0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {4948#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:57,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {4948#(<= 1 main_~main__t~0)} assume !!(~main____CPAchecker_TMP_4~0 == 0); {4948#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:34:57,949 INFO L273 TraceCheckUtils]: 15: Hoare triple {4948#(<= 1 main_~main__t~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {4949#(not (= 0 main_~__VERIFIER_assert__cond~8))} is VALID [2018-11-14 17:34:57,949 INFO L273 TraceCheckUtils]: 16: Hoare triple {4949#(not (= 0 main_~__VERIFIER_assert__cond~8))} assume ~__VERIFIER_assert__cond~8 == 0; {4945#false} is VALID [2018-11-14 17:34:57,950 INFO L273 TraceCheckUtils]: 17: Hoare triple {4945#false} assume !false; {4945#false} is VALID [2018-11-14 17:34:57,950 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-14 17:34:57,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:57,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:34:57,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 17:34:57,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:57,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:34:58,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:58,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:34:58,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:34:58,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:34:58,036 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2018-11-14 17:34:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:58,687 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2018-11-14 17:34:58,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:34:58,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 17:34:58,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2018-11-14 17:34:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:34:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2018-11-14 17:34:58,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 124 transitions. [2018-11-14 17:34:59,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:59,164 INFO L225 Difference]: With dead ends: 113 [2018-11-14 17:34:59,164 INFO L226 Difference]: Without dead ends: 111 [2018-11-14 17:34:59,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:59,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-14 17:34:59,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 45. [2018-11-14 17:34:59,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:59,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 45 states. [2018-11-14 17:34:59,298 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 45 states. [2018-11-14 17:34:59,298 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 45 states. [2018-11-14 17:34:59,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:59,302 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2018-11-14 17:34:59,302 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2018-11-14 17:34:59,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:59,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:59,302 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 111 states. [2018-11-14 17:34:59,303 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 111 states. [2018-11-14 17:34:59,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:59,305 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2018-11-14 17:34:59,305 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2018-11-14 17:34:59,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:59,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:59,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:59,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:59,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-14 17:34:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-14 17:34:59,307 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2018-11-14 17:34:59,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:59,307 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-14 17:34:59,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:34:59,307 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-14 17:34:59,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:34:59,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:59,308 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:59,308 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:59,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:59,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1046794596, now seen corresponding path program 1 times [2018-11-14 17:34:59,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:59,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:59,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:59,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:34:59,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:59,839 INFO L256 TraceCheckUtils]: 0: Hoare triple {5362#true} call ULTIMATE.init(); {5362#true} is VALID [2018-11-14 17:34:59,840 INFO L273 TraceCheckUtils]: 1: Hoare triple {5362#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5362#true} is VALID [2018-11-14 17:34:59,840 INFO L273 TraceCheckUtils]: 2: Hoare triple {5362#true} assume true; {5362#true} is VALID [2018-11-14 17:34:59,841 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5362#true} {5362#true} #181#return; {5362#true} is VALID [2018-11-14 17:34:59,841 INFO L256 TraceCheckUtils]: 4: Hoare triple {5362#true} call #t~ret7 := main(); {5362#true} is VALID [2018-11-14 17:34:59,841 INFO L273 TraceCheckUtils]: 5: Hoare triple {5362#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {5362#true} is VALID [2018-11-14 17:34:59,842 INFO L273 TraceCheckUtils]: 6: Hoare triple {5362#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5364#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:34:59,842 INFO L273 TraceCheckUtils]: 7: Hoare triple {5364#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {5365#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:34:59,843 INFO L273 TraceCheckUtils]: 8: Hoare triple {5365#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5366#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 17:34:59,844 INFO L273 TraceCheckUtils]: 9: Hoare triple {5366#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5367#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} is VALID [2018-11-14 17:34:59,844 INFO L273 TraceCheckUtils]: 10: Hoare triple {5367#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} assume !(~__VERIFIER_assert__cond~1 == 0);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {5368#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:59,845 INFO L273 TraceCheckUtils]: 11: Hoare triple {5368#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {5369#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:59,846 INFO L273 TraceCheckUtils]: 12: Hoare triple {5369#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {5369#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:59,846 INFO L273 TraceCheckUtils]: 13: Hoare triple {5369#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main____CPAchecker_TMP_3~0 == 0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {5369#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:59,848 INFO L273 TraceCheckUtils]: 14: Hoare triple {5369#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main____CPAchecker_TMP_4~0 == 0);havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5369#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:34:59,850 INFO L273 TraceCheckUtils]: 15: Hoare triple {5369#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~4 == 0);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {5370#(not (= 0 main_~__VERIFIER_assert__cond~5))} is VALID [2018-11-14 17:34:59,851 INFO L273 TraceCheckUtils]: 16: Hoare triple {5370#(not (= 0 main_~__VERIFIER_assert__cond~5))} assume ~__VERIFIER_assert__cond~5 == 0; {5363#false} is VALID [2018-11-14 17:34:59,851 INFO L273 TraceCheckUtils]: 17: Hoare triple {5363#false} assume !false; {5363#false} is VALID [2018-11-14 17:34:59,851 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-14 17:34:59,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:34:59,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 17:34:59,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-14 17:34:59,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:59,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:34:59,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:59,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:34:59,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:34:59,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:34:59,870 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 9 states. [2018-11-14 17:35:00,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:00,402 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-11-14 17:35:00,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:35:00,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-14 17:35:00,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:00,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:35:00,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-14 17:35:00,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:35:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2018-11-14 17:35:00,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2018-11-14 17:35:00,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:00,861 INFO L225 Difference]: With dead ends: 60 [2018-11-14 17:35:00,861 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 17:35:00,862 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:35:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 17:35:00,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2018-11-14 17:35:00,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:00,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 43 states. [2018-11-14 17:35:00,896 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 43 states. [2018-11-14 17:35:00,896 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 43 states. [2018-11-14 17:35:00,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:00,898 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-14 17:35:00,898 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-14 17:35:00,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:00,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:00,899 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 58 states. [2018-11-14 17:35:00,899 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 58 states. [2018-11-14 17:35:00,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:00,900 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-14 17:35:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-11-14 17:35:00,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:00,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:00,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:00,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 17:35:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-14 17:35:00,902 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2018-11-14 17:35:00,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:00,902 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-14 17:35:00,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:35:00,902 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-14 17:35:00,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:35:00,903 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:00,903 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:00,903 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:00,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:00,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1094509846, now seen corresponding path program 1 times [2018-11-14 17:35:00,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:00,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:00,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:00,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:00,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:01,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {5621#true} call ULTIMATE.init(); {5621#true} is VALID [2018-11-14 17:35:01,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {5621#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5621#true} is VALID [2018-11-14 17:35:01,069 INFO L273 TraceCheckUtils]: 2: Hoare triple {5621#true} assume true; {5621#true} is VALID [2018-11-14 17:35:01,069 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5621#true} {5621#true} #181#return; {5621#true} is VALID [2018-11-14 17:35:01,070 INFO L256 TraceCheckUtils]: 4: Hoare triple {5621#true} call #t~ret7 := main(); {5621#true} is VALID [2018-11-14 17:35:01,070 INFO L273 TraceCheckUtils]: 5: Hoare triple {5621#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {5621#true} is VALID [2018-11-14 17:35:01,072 INFO L273 TraceCheckUtils]: 6: Hoare triple {5621#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5623#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:35:01,073 INFO L273 TraceCheckUtils]: 7: Hoare triple {5623#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {5624#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:35:01,074 INFO L273 TraceCheckUtils]: 8: Hoare triple {5624#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5625#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 17:35:01,075 INFO L273 TraceCheckUtils]: 9: Hoare triple {5625#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5626#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} is VALID [2018-11-14 17:35:01,076 INFO L273 TraceCheckUtils]: 10: Hoare triple {5626#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} assume !(~__VERIFIER_assert__cond~1 == 0);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {5627#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:35:01,077 INFO L273 TraceCheckUtils]: 11: Hoare triple {5627#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {5628#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:35:01,077 INFO L273 TraceCheckUtils]: 12: Hoare triple {5628#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {5628#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:35:01,078 INFO L273 TraceCheckUtils]: 13: Hoare triple {5628#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(~main____CPAchecker_TMP_3~0 == 0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {5628#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:35:01,079 INFO L273 TraceCheckUtils]: 14: Hoare triple {5628#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main____CPAchecker_TMP_6~0 == 0);havoc ~__tmp_11~0;~__tmp_11~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {5628#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:35:01,079 INFO L273 TraceCheckUtils]: 15: Hoare triple {5628#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~10 == 0);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {5629#(not (= 0 main_~__VERIFIER_assert__cond~11))} is VALID [2018-11-14 17:35:01,080 INFO L273 TraceCheckUtils]: 16: Hoare triple {5629#(not (= 0 main_~__VERIFIER_assert__cond~11))} assume ~__VERIFIER_assert__cond~11 == 0; {5622#false} is VALID [2018-11-14 17:35:01,080 INFO L273 TraceCheckUtils]: 17: Hoare triple {5622#false} assume !false; {5622#false} is VALID [2018-11-14 17:35:01,081 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-14 17:35:01,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:35:01,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 17:35:01,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-14 17:35:01,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:01,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:35:01,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:01,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:35:01,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:35:01,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:35:01,099 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2018-11-14 17:35:01,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:01,908 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-11-14 17:35:01,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:35:01,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-14 17:35:01,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:01,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:35:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2018-11-14 17:35:01,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:35:01,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2018-11-14 17:35:01,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2018-11-14 17:35:01,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:01,997 INFO L225 Difference]: With dead ends: 44 [2018-11-14 17:35:01,997 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 17:35:01,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:35:01,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 17:35:02,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-14 17:35:02,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:02,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-14 17:35:02,030 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-14 17:35:02,031 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-14 17:35:02,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:02,032 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 17:35:02,032 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 17:35:02,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:02,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:02,033 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-14 17:35:02,033 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-14 17:35:02,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:02,034 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-14 17:35:02,034 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-14 17:35:02,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:02,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:02,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:02,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 17:35:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-14 17:35:02,036 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2018-11-14 17:35:02,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:02,036 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-14 17:35:02,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:35:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 17:35:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:35:02,037 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:02,037 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:02,038 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:02,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:02,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1866774741, now seen corresponding path program 1 times [2018-11-14 17:35:02,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:02,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:02,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:02,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:02,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:02,239 INFO L256 TraceCheckUtils]: 0: Hoare triple {5820#true} call ULTIMATE.init(); {5820#true} is VALID [2018-11-14 17:35:02,239 INFO L273 TraceCheckUtils]: 1: Hoare triple {5820#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5820#true} is VALID [2018-11-14 17:35:02,239 INFO L273 TraceCheckUtils]: 2: Hoare triple {5820#true} assume true; {5820#true} is VALID [2018-11-14 17:35:02,239 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5820#true} {5820#true} #181#return; {5820#true} is VALID [2018-11-14 17:35:02,239 INFO L256 TraceCheckUtils]: 4: Hoare triple {5820#true} call #t~ret7 := main(); {5820#true} is VALID [2018-11-14 17:35:02,240 INFO L273 TraceCheckUtils]: 5: Hoare triple {5820#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {5820#true} is VALID [2018-11-14 17:35:02,240 INFO L273 TraceCheckUtils]: 6: Hoare triple {5820#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5822#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:35:02,241 INFO L273 TraceCheckUtils]: 7: Hoare triple {5822#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {5823#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:35:02,241 INFO L273 TraceCheckUtils]: 8: Hoare triple {5823#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5824#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-14 17:35:02,243 INFO L273 TraceCheckUtils]: 9: Hoare triple {5824#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5825#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} is VALID [2018-11-14 17:35:02,243 INFO L273 TraceCheckUtils]: 10: Hoare triple {5825#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} assume !(~__VERIFIER_assert__cond~1 == 0);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {5826#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:35:02,244 INFO L273 TraceCheckUtils]: 11: Hoare triple {5826#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {5827#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:35:02,247 INFO L273 TraceCheckUtils]: 12: Hoare triple {5827#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {5827#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:35:02,248 INFO L273 TraceCheckUtils]: 13: Hoare triple {5827#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~main____CPAchecker_TMP_3~0 == 0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {5827#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:35:02,251 INFO L273 TraceCheckUtils]: 14: Hoare triple {5827#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(~main____CPAchecker_TMP_4~0 == 0); {5827#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:35:02,254 INFO L273 TraceCheckUtils]: 15: Hoare triple {5827#(<= main_~main__t~0 main_~main__tagbuf_len~0)} havoc ~__tmp_9~0;~__tmp_9~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5827#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:35:02,256 INFO L273 TraceCheckUtils]: 16: Hoare triple {5827#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~8 == 0);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {5828#(not (= 0 main_~__VERIFIER_assert__cond~9))} is VALID [2018-11-14 17:35:02,256 INFO L273 TraceCheckUtils]: 17: Hoare triple {5828#(not (= 0 main_~__VERIFIER_assert__cond~9))} assume ~__VERIFIER_assert__cond~9 == 0; {5821#false} is VALID [2018-11-14 17:35:02,256 INFO L273 TraceCheckUtils]: 18: Hoare triple {5821#false} assume !false; {5821#false} is VALID [2018-11-14 17:35:02,257 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-14 17:35:02,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:35:02,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-14 17:35:02,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-14 17:35:02,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:02,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:35:02,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:02,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:35:02,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:35:02,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:35:02,281 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 9 states. [2018-11-14 17:35:02,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:02,812 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-11-14 17:35:02,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:35:02,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-14 17:35:02,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:35:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2018-11-14 17:35:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:35:02,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2018-11-14 17:35:02,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2018-11-14 17:35:02,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:02,876 INFO L225 Difference]: With dead ends: 55 [2018-11-14 17:35:02,876 INFO L226 Difference]: Without dead ends: 53 [2018-11-14 17:35:02,876 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:35:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-14 17:35:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-11-14 17:35:02,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:02,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 37 states. [2018-11-14 17:35:02,916 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 37 states. [2018-11-14 17:35:02,916 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 37 states. [2018-11-14 17:35:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:02,918 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-11-14 17:35:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-14 17:35:02,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:02,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:02,919 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 53 states. [2018-11-14 17:35:02,919 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 53 states. [2018-11-14 17:35:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:02,920 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-11-14 17:35:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-14 17:35:02,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:02,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:02,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:02,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:02,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:35:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-14 17:35:02,922 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2018-11-14 17:35:02,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:02,922 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-14 17:35:02,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:35:02,922 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 17:35:02,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:35:02,923 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:02,923 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:02,923 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:02,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:02,924 INFO L82 PathProgramCache]: Analyzing trace with hash 947355911, now seen corresponding path program 1 times [2018-11-14 17:35:02,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:02,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:02,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:02,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:02,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:03,015 INFO L256 TraceCheckUtils]: 0: Hoare triple {6058#true} call ULTIMATE.init(); {6058#true} is VALID [2018-11-14 17:35:03,016 INFO L273 TraceCheckUtils]: 1: Hoare triple {6058#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6058#true} is VALID [2018-11-14 17:35:03,016 INFO L273 TraceCheckUtils]: 2: Hoare triple {6058#true} assume true; {6058#true} is VALID [2018-11-14 17:35:03,016 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6058#true} {6058#true} #181#return; {6058#true} is VALID [2018-11-14 17:35:03,016 INFO L256 TraceCheckUtils]: 4: Hoare triple {6058#true} call #t~ret7 := main(); {6058#true} is VALID [2018-11-14 17:35:03,016 INFO L273 TraceCheckUtils]: 5: Hoare triple {6058#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {6058#true} is VALID [2018-11-14 17:35:03,017 INFO L273 TraceCheckUtils]: 6: Hoare triple {6058#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6060#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:35:03,018 INFO L273 TraceCheckUtils]: 7: Hoare triple {6060#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {6060#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:35:03,018 INFO L273 TraceCheckUtils]: 8: Hoare triple {6060#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6061#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:03,018 INFO L273 TraceCheckUtils]: 9: Hoare triple {6061#(= main_~__VERIFIER_assert__cond~0 1)} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6058#true} is VALID [2018-11-14 17:35:03,018 INFO L273 TraceCheckUtils]: 10: Hoare triple {6058#true} assume !(~__VERIFIER_assert__cond~1 == 0);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {6058#true} is VALID [2018-11-14 17:35:03,019 INFO L273 TraceCheckUtils]: 11: Hoare triple {6058#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6058#true} is VALID [2018-11-14 17:35:03,019 INFO L273 TraceCheckUtils]: 12: Hoare triple {6058#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {6058#true} is VALID [2018-11-14 17:35:03,019 INFO L273 TraceCheckUtils]: 13: Hoare triple {6058#true} assume !(~main____CPAchecker_TMP_3~0 == 0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {6058#true} is VALID [2018-11-14 17:35:03,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {6058#true} assume !(~main____CPAchecker_TMP_4~0 == 0);havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6062#(or (= 0 main_~__VERIFIER_assert__cond~4) (<= 0 main_~main__t~0))} is VALID [2018-11-14 17:35:03,020 INFO L273 TraceCheckUtils]: 15: Hoare triple {6062#(or (= 0 main_~__VERIFIER_assert__cond~4) (<= 0 main_~main__t~0))} assume !(~__VERIFIER_assert__cond~4 == 0);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {6060#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:35:03,020 INFO L273 TraceCheckUtils]: 16: Hoare triple {6060#(<= 0 main_~main__t~0)} assume !(~__VERIFIER_assert__cond~5 == 0);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6063#(<= 1 main_~main__t~0)} is VALID [2018-11-14 17:35:03,021 INFO L273 TraceCheckUtils]: 17: Hoare triple {6063#(<= 1 main_~main__t~0)} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6064#(not (= 0 main_~__VERIFIER_assert__cond~6))} is VALID [2018-11-14 17:35:03,022 INFO L273 TraceCheckUtils]: 18: Hoare triple {6064#(not (= 0 main_~__VERIFIER_assert__cond~6))} assume ~__VERIFIER_assert__cond~6 == 0; {6059#false} is VALID [2018-11-14 17:35:03,022 INFO L273 TraceCheckUtils]: 19: Hoare triple {6059#false} assume !false; {6059#false} is VALID [2018-11-14 17:35:03,023 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-14 17:35:03,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:35:03,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 17:35:03,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 17:35:03,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:03,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:35:03,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:03,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:35:03,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:35:03,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:35:03,041 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2018-11-14 17:35:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:03,920 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-14 17:35:03,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:35:03,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 17:35:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:03,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:35:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2018-11-14 17:35:03,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:35:03,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2018-11-14 17:35:03,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2018-11-14 17:35:03,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:03,981 INFO L225 Difference]: With dead ends: 53 [2018-11-14 17:35:03,981 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 17:35:03,982 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:35:03,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 17:35:04,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2018-11-14 17:35:04,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:04,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 35 states. [2018-11-14 17:35:04,028 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 35 states. [2018-11-14 17:35:04,028 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 35 states. [2018-11-14 17:35:04,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:04,029 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-14 17:35:04,029 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-14 17:35:04,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:04,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:04,030 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 51 states. [2018-11-14 17:35:04,030 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 51 states. [2018-11-14 17:35:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:04,031 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-14 17:35:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-14 17:35:04,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:04,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:04,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:04,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:35:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-14 17:35:04,033 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2018-11-14 17:35:04,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:04,033 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-14 17:35:04,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:35:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-14 17:35:04,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:35:04,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:35:04,034 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:35:04,035 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:35:04,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:35:04,035 INFO L82 PathProgramCache]: Analyzing trace with hash -696734716, now seen corresponding path program 1 times [2018-11-14 17:35:04,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:35:04,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:35:04,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:04,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:35:04,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:35:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:35:04,159 INFO L256 TraceCheckUtils]: 0: Hoare triple {6287#true} call ULTIMATE.init(); {6287#true} is VALID [2018-11-14 17:35:04,160 INFO L273 TraceCheckUtils]: 1: Hoare triple {6287#true} ~__return_main~0 := 0;~__tmp_259_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {6287#true} is VALID [2018-11-14 17:35:04,160 INFO L273 TraceCheckUtils]: 2: Hoare triple {6287#true} assume true; {6287#true} is VALID [2018-11-14 17:35:04,161 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6287#true} {6287#true} #181#return; {6287#true} is VALID [2018-11-14 17:35:04,161 INFO L256 TraceCheckUtils]: 4: Hoare triple {6287#true} call #t~ret7 := main(); {6287#true} is VALID [2018-11-14 17:35:04,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {6287#true} havoc ~main__tagbuf_len~0;havoc ~main__t~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tagbuf_len~0 := #t~nondet1;havoc #t~nondet1; {6287#true} is VALID [2018-11-14 17:35:04,162 INFO L273 TraceCheckUtils]: 6: Hoare triple {6287#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {6289#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:35:04,162 INFO L273 TraceCheckUtils]: 7: Hoare triple {6289#(<= 0 main_~main__t~0)} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet2;havoc #t~nondet2; {6289#(<= 0 main_~main__t~0)} is VALID [2018-11-14 17:35:04,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {6289#(<= 0 main_~main__t~0)} assume !(~main____CPAchecker_TMP_0~0 == 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6290#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-14 17:35:04,163 INFO L273 TraceCheckUtils]: 9: Hoare triple {6290#(= main_~__VERIFIER_assert__cond~0 1)} assume !(~__VERIFIER_assert__cond~0 == 0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6287#true} is VALID [2018-11-14 17:35:04,163 INFO L273 TraceCheckUtils]: 10: Hoare triple {6287#true} assume !(~__VERIFIER_assert__cond~1 == 0);~__tmp_259_0~0 := ~main____CPAchecker_TMP_0~0; {6287#true} is VALID [2018-11-14 17:35:04,163 INFO L273 TraceCheckUtils]: 11: Hoare triple {6287#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_259_0~0;~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6287#true} is VALID [2018-11-14 17:35:04,163 INFO L273 TraceCheckUtils]: 12: Hoare triple {6287#true} assume !(~main__t~0 == ~main__tagbuf_len~0);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet3;havoc #t~nondet3; {6287#true} is VALID [2018-11-14 17:35:04,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {6287#true} assume !(~main____CPAchecker_TMP_3~0 == 0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {6287#true} is VALID [2018-11-14 17:35:04,163 INFO L273 TraceCheckUtils]: 14: Hoare triple {6287#true} assume !(~main____CPAchecker_TMP_4~0 == 0);havoc ~__tmp_5~0;~__tmp_5~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6287#true} is VALID [2018-11-14 17:35:04,164 INFO L273 TraceCheckUtils]: 15: Hoare triple {6287#true} assume !(~__VERIFIER_assert__cond~4 == 0);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {6287#true} is VALID [2018-11-14 17:35:04,164 INFO L273 TraceCheckUtils]: 16: Hoare triple {6287#true} assume !(~__VERIFIER_assert__cond~5 == 0);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := ~main__t~0 + 1; {6287#true} is VALID [2018-11-14 17:35:04,171 INFO L273 TraceCheckUtils]: 17: Hoare triple {6287#true} assume ~main__t~0 == ~main__tagbuf_len~0;havoc ~__tmp_7~0;~__tmp_7~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6291#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-14 17:35:04,171 INFO L273 TraceCheckUtils]: 18: Hoare triple {6291#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(~__VERIFIER_assert__cond~6 == 0);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6292#(not (= 0 main_~__VERIFIER_assert__cond~7))} is VALID [2018-11-14 17:35:04,172 INFO L273 TraceCheckUtils]: 19: Hoare triple {6292#(not (= 0 main_~__VERIFIER_assert__cond~7))} assume ~__VERIFIER_assert__cond~7 == 0; {6288#false} is VALID [2018-11-14 17:35:04,172 INFO L273 TraceCheckUtils]: 20: Hoare triple {6288#false} assume !false; {6288#false} is VALID [2018-11-14 17:35:04,172 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-14 17:35:04,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:35:04,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:35:04,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 17:35:04,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:35:04,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:35:04,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:04,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:35:04,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:35:04,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:35:04,191 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2018-11-14 17:35:04,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:04,736 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-14 17:35:04,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:35:04,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-14 17:35:04,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:35:04,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:35:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2018-11-14 17:35:04,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:35:04,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2018-11-14 17:35:04,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2018-11-14 17:35:04,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:35:04,796 INFO L225 Difference]: With dead ends: 49 [2018-11-14 17:35:04,796 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 17:35:04,797 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:35:04,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 17:35:04,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 17:35:04,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:35:04,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:04,798 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:04,798 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:04,799 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:35:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:04,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:04,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:04,799 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:04,799 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:35:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:35:04,800 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:35:04,800 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:04,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:04,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:35:04,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:35:04,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:35:04,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 17:35:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 17:35:04,801 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-14 17:35:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:35:04,801 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 17:35:04,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:35:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:35:04,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:35:04,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 17:35:04,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-14 17:35:04,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-14 17:35:05,277 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-14 17:35:05,591 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2018-11-14 17:35:05,788 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-11-14 17:35:06,320 WARN L179 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 13 [2018-11-14 17:35:06,328 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:35:06,329 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:35:06,329 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:35:06,329 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:35:06,329 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 17:35:06,329 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:35:06,329 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:35:06,329 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2018-11-14 17:35:06,330 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2018-11-14 17:35:06,330 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2018-11-14 17:35:06,330 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 397) no Hoare annotation was computed. [2018-11-14 17:35:06,330 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2018-11-14 17:35:06,330 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2018-11-14 17:35:06,330 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2018-11-14 17:35:06,331 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2018-11-14 17:35:06,331 INFO L425 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2018-11-14 17:35:06,331 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2018-11-14 17:35:06,331 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2018-11-14 17:35:06,331 INFO L425 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2018-11-14 17:35:06,331 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2018-11-14 17:35:06,331 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2018-11-14 17:35:06,332 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2018-11-14 17:35:06,332 INFO L428 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2018-11-14 17:35:06,332 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2018-11-14 17:35:06,332 INFO L425 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2018-11-14 17:35:06,332 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2018-11-14 17:35:06,332 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2018-11-14 17:35:06,333 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2018-11-14 17:35:06,333 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2018-11-14 17:35:06,333 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2018-11-14 17:35:06,333 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2018-11-14 17:35:06,333 INFO L425 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2018-11-14 17:35:06,333 INFO L425 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2018-11-14 17:35:06,333 INFO L425 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2018-11-14 17:35:06,334 INFO L421 ceAbstractionStarter]: At program point L244(lines 96 246) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2018-11-14 17:35:06,334 INFO L425 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2018-11-14 17:35:06,334 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-14 17:35:06,334 INFO L425 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2018-11-14 17:35:06,334 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 397) no Hoare annotation was computed. [2018-11-14 17:35:06,334 INFO L425 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-11-14 17:35:06,336 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2018-11-14 17:35:06,336 INFO L425 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2018-11-14 17:35:06,336 INFO L425 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2018-11-14 17:35:06,336 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2018-11-14 17:35:06,337 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 397) the Hoare annotation is: true [2018-11-14 17:35:06,337 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2018-11-14 17:35:06,337 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-14 17:35:06,337 INFO L425 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-11-14 17:35:06,337 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2018-11-14 17:35:06,337 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-14 17:35:06,337 INFO L425 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2018-11-14 17:35:06,338 INFO L425 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2018-11-14 17:35:06,338 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2018-11-14 17:35:06,338 INFO L425 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2018-11-14 17:35:06,338 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2018-11-14 17:35:06,338 INFO L425 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2018-11-14 17:35:06,338 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2018-11-14 17:35:06,338 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2018-11-14 17:35:06,339 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2018-11-14 17:35:06,339 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2018-11-14 17:35:06,339 INFO L421 ceAbstractionStarter]: At program point L379(lines 277 386) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~13)) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0)) [2018-11-14 17:35:06,339 INFO L421 ceAbstractionStarter]: At program point L346(lines 27 390) the Hoare annotation is: (and (or (<= 1 main_~main__t~0) (= main_~__VERIFIER_assert__cond~0 1)) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2018-11-14 17:35:06,339 INFO L425 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2018-11-14 17:35:06,339 INFO L425 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2018-11-14 17:35:06,340 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2018-11-14 17:35:06,340 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-14 17:35:06,340 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2018-11-14 17:35:06,340 INFO L425 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2018-11-14 17:35:06,341 INFO L421 ceAbstractionStarter]: At program point L190(lines 51 248) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2018-11-14 17:35:06,341 INFO L425 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-11-14 17:35:06,341 INFO L425 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2018-11-14 17:35:06,341 INFO L425 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2018-11-14 17:35:06,341 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-14 17:35:06,341 INFO L425 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2018-11-14 17:35:06,341 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2018-11-14 17:35:06,342 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-11-14 17:35:06,342 INFO L425 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2018-11-14 17:35:06,342 INFO L425 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2018-11-14 17:35:06,342 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-14 17:35:06,342 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2018-11-14 17:35:06,345 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:35:06,345 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 17:35:06,346 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:35:06,346 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:35:06,346 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 17:35:06,346 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-14 17:35:06,346 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:35:06,346 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:35:06,346 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 17:35:06,346 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-14 17:35:06,347 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:35:06,347 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-14 17:35:06,347 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-14 17:35:06,347 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:35:06,347 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-14 17:35:06,347 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-14 17:35:06,347 WARN L170 areAnnotationChecker]: L260 has no Hoare annotation [2018-11-14 17:35:06,347 WARN L170 areAnnotationChecker]: L260 has no Hoare annotation [2018-11-14 17:35:06,348 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-14 17:35:06,348 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-11-14 17:35:06,348 WARN L170 areAnnotationChecker]: L271 has no Hoare annotation [2018-11-14 17:35:06,348 WARN L170 areAnnotationChecker]: L271 has no Hoare annotation [2018-11-14 17:35:06,348 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2018-11-14 17:35:06,348 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2018-11-14 17:35:06,364 WARN L170 areAnnotationChecker]: L273 has no Hoare annotation [2018-11-14 17:35:06,364 WARN L170 areAnnotationChecker]: L273 has no Hoare annotation [2018-11-14 17:35:06,364 WARN L170 areAnnotationChecker]: L283 has no Hoare annotation [2018-11-14 17:35:06,364 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2018-11-14 17:35:06,365 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-14 17:35:06,365 WARN L170 areAnnotationChecker]: L283 has no Hoare annotation [2018-11-14 17:35:06,365 WARN L170 areAnnotationChecker]: L283 has no Hoare annotation [2018-11-14 17:35:06,365 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2018-11-14 17:35:06,365 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2018-11-14 17:35:06,365 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-14 17:35:06,365 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2018-11-14 17:35:06,365 WARN L170 areAnnotationChecker]: L290 has no Hoare annotation [2018-11-14 17:35:06,365 WARN L170 areAnnotationChecker]: L290 has no Hoare annotation [2018-11-14 17:35:06,366 WARN L170 areAnnotationChecker]: L319 has no Hoare annotation [2018-11-14 17:35:06,366 WARN L170 areAnnotationChecker]: L319 has no Hoare annotation [2018-11-14 17:35:06,366 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2018-11-14 17:35:06,366 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2018-11-14 17:35:06,366 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2018-11-14 17:35:06,367 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2018-11-14 17:35:06,367 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2018-11-14 17:35:06,367 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2018-11-14 17:35:06,367 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2018-11-14 17:35:06,367 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2018-11-14 17:35:06,367 WARN L170 areAnnotationChecker]: L292 has no Hoare annotation [2018-11-14 17:35:06,367 WARN L170 areAnnotationChecker]: L292 has no Hoare annotation [2018-11-14 17:35:06,367 WARN L170 areAnnotationChecker]: L302 has no Hoare annotation [2018-11-14 17:35:06,368 WARN L170 areAnnotationChecker]: L302 has no Hoare annotation [2018-11-14 17:35:06,368 WARN L170 areAnnotationChecker]: L326 has no Hoare annotation [2018-11-14 17:35:06,368 WARN L170 areAnnotationChecker]: L326 has no Hoare annotation [2018-11-14 17:35:06,368 WARN L170 areAnnotationChecker]: L359 has no Hoare annotation [2018-11-14 17:35:06,368 WARN L170 areAnnotationChecker]: L359 has no Hoare annotation [2018-11-14 17:35:06,368 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2018-11-14 17:35:06,368 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2018-11-14 17:35:06,368 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:35:06,369 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2018-11-14 17:35:06,369 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2018-11-14 17:35:06,369 WARN L170 areAnnotationChecker]: L169 has no Hoare annotation [2018-11-14 17:35:06,369 WARN L170 areAnnotationChecker]: L217 has no Hoare annotation [2018-11-14 17:35:06,369 WARN L170 areAnnotationChecker]: L217 has no Hoare annotation [2018-11-14 17:35:06,369 WARN L170 areAnnotationChecker]: L304 has no Hoare annotation [2018-11-14 17:35:06,369 WARN L170 areAnnotationChecker]: L304 has no Hoare annotation [2018-11-14 17:35:06,369 WARN L170 areAnnotationChecker]: L328 has no Hoare annotation [2018-11-14 17:35:06,370 WARN L170 areAnnotationChecker]: L328 has no Hoare annotation [2018-11-14 17:35:06,370 WARN L170 areAnnotationChecker]: L338 has no Hoare annotation [2018-11-14 17:35:06,370 WARN L170 areAnnotationChecker]: L338 has no Hoare annotation [2018-11-14 17:35:06,370 WARN L170 areAnnotationChecker]: L361 has no Hoare annotation [2018-11-14 17:35:06,370 WARN L170 areAnnotationChecker]: L361 has no Hoare annotation [2018-11-14 17:35:06,370 WARN L170 areAnnotationChecker]: L371 has no Hoare annotation [2018-11-14 17:35:06,370 WARN L170 areAnnotationChecker]: L371 has no Hoare annotation [2018-11-14 17:35:06,370 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2018-11-14 17:35:06,370 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2018-11-14 17:35:06,371 WARN L170 areAnnotationChecker]: L119 has no Hoare annotation [2018-11-14 17:35:06,371 WARN L170 areAnnotationChecker]: L119 has no Hoare annotation [2018-11-14 17:35:06,371 WARN L170 areAnnotationChecker]: L169 has no Hoare annotation [2018-11-14 17:35:06,371 WARN L170 areAnnotationChecker]: L169 has no Hoare annotation [2018-11-14 17:35:06,371 WARN L170 areAnnotationChecker]: L219 has no Hoare annotation [2018-11-14 17:35:06,371 WARN L170 areAnnotationChecker]: L219 has no Hoare annotation [2018-11-14 17:35:06,371 WARN L170 areAnnotationChecker]: L229 has no Hoare annotation [2018-11-14 17:35:06,371 WARN L170 areAnnotationChecker]: L229 has no Hoare annotation [2018-11-14 17:35:06,372 WARN L170 areAnnotationChecker]: L340 has no Hoare annotation [2018-11-14 17:35:06,372 WARN L170 areAnnotationChecker]: L340 has no Hoare annotation [2018-11-14 17:35:06,372 WARN L170 areAnnotationChecker]: L373 has no Hoare annotation [2018-11-14 17:35:06,372 WARN L170 areAnnotationChecker]: L373 has no Hoare annotation [2018-11-14 17:35:06,372 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2018-11-14 17:35:06,372 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2018-11-14 17:35:06,372 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2018-11-14 17:35:06,372 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2018-11-14 17:35:06,373 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2018-11-14 17:35:06,373 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2018-11-14 17:35:06,373 WARN L170 areAnnotationChecker]: L181 has no Hoare annotation [2018-11-14 17:35:06,373 WARN L170 areAnnotationChecker]: L181 has no Hoare annotation [2018-11-14 17:35:06,373 WARN L170 areAnnotationChecker]: L231 has no Hoare annotation [2018-11-14 17:35:06,373 WARN L170 areAnnotationChecker]: L231 has no Hoare annotation [2018-11-14 17:35:06,373 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2018-11-14 17:35:06,373 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2018-11-14 17:35:06,374 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2018-11-14 17:35:06,374 WARN L170 areAnnotationChecker]: L183 has no Hoare annotation [2018-11-14 17:35:06,374 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2018-11-14 17:35:06,374 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2018-11-14 17:35:06,374 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2018-11-14 17:35:06,374 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2018-11-14 17:35:06,374 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2018-11-14 17:35:06,374 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2018-11-14 17:35:06,375 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:35:06,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:35:06 BoogieIcfgContainer [2018-11-14 17:35:06,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:35:06,398 INFO L168 Benchmark]: Toolchain (without parser) took 26298.86 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -266.4 MB). Peak memory consumption was 824.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:06,400 INFO L168 Benchmark]: CDTParser took 0.28 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-14 17:35:06,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.84 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:06,408 INFO L168 Benchmark]: Boogie Preprocessor took 53.11 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-14 17:35:06,408 INFO L168 Benchmark]: RCFGBuilder took 1318.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.2 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:06,409 INFO L168 Benchmark]: TraceAbstraction took 24509.28 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 353.9 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 486.6 MB). Peak memory consumption was 840.5 MB. Max. memory is 7.1 GB. [2018-11-14 17:35:06,416 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.28 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 411.84 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.11 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 1318.85 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.2 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24509.28 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 353.9 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 486.6 MB). Peak memory consumption was 840.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((!(0 == __VERIFIER_assert__cond) && main__t + 1 <= main__tagbuf_len) && __VERIFIER_assert__cond == 1) && 0 <= main__t - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((1 <= main__t || __VERIFIER_assert__cond == 1) && main__t + 1 <= main__tagbuf_len) && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 80 locations, 18 error locations. SAFE Result, 24.3s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 16.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 872 SDtfs, 2552 SDslu, 1663 SDs, 0 SdLazy, 1817 SolverSat, 269 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, 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.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 614 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 54 HoareAnnotationTreeSize, 9 FomulaSimplifications, 9989709 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 9 FomulaSimplificationsInter, 16618 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 11454 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...