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+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-19 00:06:39,859 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-19 00:06:39,861 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-19 00:06:39,877 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-19 00:06:39,878 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-19 00:06:39,879 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-19 00:06:39,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-19 00:06:39,883 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-19 00:06:39,886 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-19 00:06:39,893 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-19 00:06:39,894 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-19 00:06:39,894 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-19 00:06:39,897 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-19 00:06:39,898 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-19 00:06:39,899 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-19 00:06:39,902 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-19 00:06:39,904 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-19 00:06:39,907 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-19 00:06:39,909 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-19 00:06:39,913 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-19 00:06:39,915 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-19 00:06:39,917 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-19 00:06:39,921 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-19 00:06:39,921 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-19 00:06:39,921 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-19 00:06:39,922 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-19 00:06:39,926 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-19 00:06:39,927 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-19 00:06:39,927 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-19 00:06:39,931 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-19 00:06:39,931 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-19 00:06:39,933 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-19 00:06:39,933 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-19 00:06:39,934 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-19 00:06:39,935 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-19 00:06:39,935 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-19 00:06:39,936 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-19 00:06:39,964 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-19 00:06:39,964 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-19 00:06:39,966 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-19 00:06:39,966 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-19 00:06:39,968 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-19 00:06:39,968 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-19 00:06:39,968 INFO L133 SettingsManager]: * Use SBE=true [2018-11-19 00:06:39,968 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-19 00:06:39,968 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-19 00:06:39,969 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-19 00:06:39,969 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-19 00:06:39,969 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-19 00:06:39,969 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-19 00:06:39,969 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-19 00:06:39,970 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-19 00:06:39,970 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-19 00:06:39,970 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-19 00:06:39,970 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-19 00:06:39,971 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-19 00:06:39,971 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-19 00:06:39,971 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-19 00:06:39,971 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-19 00:06:39,971 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-19 00:06:39,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-19 00:06:39,973 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-19 00:06:39,973 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-19 00:06:39,973 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-19 00:06:39,973 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-19 00:06:39,974 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-19 00:06:39,974 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-19 00:06:39,974 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-19 00:06:40,036 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-19 00:06:40,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-19 00:06:40,053 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-19 00:06:40,055 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-19 00:06:40,055 INFO L276 PluginConnector]: CDTParser initialized [2018-11-19 00:06:40,056 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+nlh-reducer.c [2018-11-19 00:06:40,113 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb38123c/dd8a720a66c74794ad18aae0b48c3420/FLAG5ffd4ea38 [2018-11-19 00:06:40,586 INFO L307 CDTParser]: Found 1 translation units. [2018-11-19 00:06:40,586 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-19 00:06:40,594 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb38123c/dd8a720a66c74794ad18aae0b48c3420/FLAG5ffd4ea38 [2018-11-19 00:06:40,923 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb38123c/dd8a720a66c74794ad18aae0b48c3420 [2018-11-19 00:06:40,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-19 00:06:40,935 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-19 00:06:40,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-19 00:06:40,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-19 00:06:40,940 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-19 00:06:40,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:06:40" (1/1) ... [2018-11-19 00:06:40,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@656ed4c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:06:40, skipping insertion in model container [2018-11-19 00:06:40,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:06:40" (1/1) ... [2018-11-19 00:06:40,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-19 00:06:41,003 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-19 00:06:41,307 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 00:06:41,312 INFO L191 MainTranslator]: Completed pre-run [2018-11-19 00:06:41,354 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 00:06:41,377 INFO L195 MainTranslator]: Completed translation [2018-11-19 00:06:41,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:06:41 WrapperNode [2018-11-19 00:06:41,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-19 00:06:41,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-19 00:06:41,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-19 00:06:41,379 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-19 00:06:41,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:06:41" (1/1) ... [2018-11-19 00:06:41,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:06:41" (1/1) ... [2018-11-19 00:06:41,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:06:41" (1/1) ... [2018-11-19 00:06:41,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:06:41" (1/1) ... [2018-11-19 00:06:41,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:06:41" (1/1) ... [2018-11-19 00:06:41,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:06:41" (1/1) ... [2018-11-19 00:06:41,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:06:41" (1/1) ... [2018-11-19 00:06:41,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-19 00:06:41,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-19 00:06:41,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-19 00:06:41,450 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-19 00:06:41,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:06:41" (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-19 00:06:41,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-19 00:06:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-19 00:06:41,616 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-19 00:06:41,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-19 00:06:41,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-19 00:06:41,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-19 00:06:41,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-19 00:06:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-19 00:06:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-19 00:06:41,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-19 00:06:42,755 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-19 00:06:42,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:06:42 BoogieIcfgContainer [2018-11-19 00:06:42,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-19 00:06:42,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-19 00:06:42,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-19 00:06:42,761 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-19 00:06:42,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:06:40" (1/3) ... [2018-11-19 00:06:42,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5fe63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:06:42, skipping insertion in model container [2018-11-19 00:06:42,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:06:41" (2/3) ... [2018-11-19 00:06:42,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5fe63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:06:42, skipping insertion in model container [2018-11-19 00:06:42,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:06:42" (3/3) ... [2018-11-19 00:06:42,765 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-19 00:06:42,774 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-19 00:06:42,783 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-11-19 00:06:42,797 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-11-19 00:06:42,825 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-19 00:06:42,825 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-19 00:06:42,826 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-19 00:06:42,826 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-19 00:06:42,826 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-19 00:06:42,826 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-19 00:06:42,826 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-19 00:06:42,826 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-19 00:06:42,827 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-19 00:06:42,846 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-11-19 00:06:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-19 00:06:42,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:06:42,853 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:06:42,856 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:06:42,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:06:42,861 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2018-11-19 00:06:42,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:06:42,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:06:42,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:42,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:42,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:43,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {79#true} call ULTIMATE.init(); {79#true} is VALID [2018-11-19 00:06:43,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {79#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {79#true} is VALID [2018-11-19 00:06:43,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {79#true} assume true; {79#true} is VALID [2018-11-19 00:06:43,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {79#true} {79#true} #171#return; {79#true} is VALID [2018-11-19 00:06:43,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {79#true} call #t~ret7 := main(); {79#true} is VALID [2018-11-19 00:06:43,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {79#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; {79#true} is VALID [2018-11-19 00:06:43,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {79#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {81#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:06:43,266 INFO L273 TraceCheckUtils]: 7: Hoare triple {81#(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; {81#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:06:43,269 INFO L273 TraceCheckUtils]: 8: Hoare triple {81#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_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; {82#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~12 1))} is VALID [2018-11-19 00:06:43,278 INFO L273 TraceCheckUtils]: 9: Hoare triple {82#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~12 1))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {83#(not (= 0 main_~__VERIFIER_assert__cond~13))} is VALID [2018-11-19 00:06:43,279 INFO L273 TraceCheckUtils]: 10: Hoare triple {83#(not (= 0 main_~__VERIFIER_assert__cond~13))} assume 0 == ~__VERIFIER_assert__cond~13; {80#false} is VALID [2018-11-19 00:06:43,279 INFO L273 TraceCheckUtils]: 11: Hoare triple {80#false} assume !false; {80#false} is VALID [2018-11-19 00:06:43,282 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-19 00:06:43,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:06:43,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-19 00:06:43,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-19 00:06:43,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:43,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-19 00:06:43,337 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-19 00:06:43,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-19 00:06:43,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-19 00:06:43,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-19 00:06:43,349 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-11-19 00:06:43,941 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-19 00:06:44,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:44,929 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2018-11-19 00:06:44,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-19 00:06:44,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-19 00:06:44,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:06:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 00:06:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2018-11-19 00:06:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 00:06:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 172 transitions. [2018-11-19 00:06:44,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 172 transitions. [2018-11-19 00:06:45,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:45,544 INFO L225 Difference]: With dead ends: 129 [2018-11-19 00:06:45,545 INFO L226 Difference]: Without dead ends: 113 [2018-11-19 00:06:45,548 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-19 00:06:45,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-19 00:06:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2018-11-19 00:06:45,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:06:45,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 69 states. [2018-11-19 00:06:45,612 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 69 states. [2018-11-19 00:06:45,612 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 69 states. [2018-11-19 00:06:45,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:45,622 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-11-19 00:06:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-11-19 00:06:45,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:45,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:45,625 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 113 states. [2018-11-19 00:06:45,625 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 113 states. [2018-11-19 00:06:45,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:45,634 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-11-19 00:06:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-11-19 00:06:45,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:45,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:45,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:06:45,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:06:45,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-19 00:06:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-19 00:06:45,643 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2018-11-19 00:06:45,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:06:45,644 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-19 00:06:45,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-19 00:06:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-19 00:06:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-19 00:06:45,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:06:45,645 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:06:45,646 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:06:45,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:06:45,647 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2018-11-19 00:06:45,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:06:45,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:06:45,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:45,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:45,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:45,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {536#true} call ULTIMATE.init(); {536#true} is VALID [2018-11-19 00:06:45,748 INFO L273 TraceCheckUtils]: 1: Hoare triple {536#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {536#true} is VALID [2018-11-19 00:06:45,748 INFO L273 TraceCheckUtils]: 2: Hoare triple {536#true} assume true; {536#true} is VALID [2018-11-19 00:06:45,749 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {536#true} {536#true} #171#return; {536#true} is VALID [2018-11-19 00:06:45,749 INFO L256 TraceCheckUtils]: 4: Hoare triple {536#true} call #t~ret7 := main(); {536#true} is VALID [2018-11-19 00:06:45,749 INFO L273 TraceCheckUtils]: 5: Hoare triple {536#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; {536#true} is VALID [2018-11-19 00:06:45,750 INFO L273 TraceCheckUtils]: 6: Hoare triple {536#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {538#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:45,751 INFO L273 TraceCheckUtils]: 7: Hoare triple {538#(<= 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; {538#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:45,770 INFO L273 TraceCheckUtils]: 8: Hoare triple {538#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {538#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:45,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {538#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {539#(= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2018-11-19 00:06:45,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {539#(= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {537#false} is VALID [2018-11-19 00:06:45,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {537#false} assume !false; {537#false} is VALID [2018-11-19 00:06:45,781 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-19 00:06:45,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:06:45,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-19 00:06:45,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-19 00:06:45,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:45,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-19 00:06:45,834 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-19 00:06:45,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-19 00:06:45,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-19 00:06:45,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-19 00:06:45,836 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2018-11-19 00:06:46,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:46,075 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-19 00:06:46,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-19 00:06:46,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-19 00:06:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:06:46,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-19 00:06:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-11-19 00:06:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-19 00:06:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2018-11-19 00:06:46,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2018-11-19 00:06:46,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:46,407 INFO L225 Difference]: With dead ends: 69 [2018-11-19 00:06:46,407 INFO L226 Difference]: Without dead ends: 67 [2018-11-19 00:06:46,408 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-19 00:06:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-19 00:06:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-19 00:06:46,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:06:46,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2018-11-19 00:06:46,439 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-19 00:06:46,439 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-19 00:06:46,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:46,443 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-19 00:06:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-19 00:06:46,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:46,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:46,445 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-19 00:06:46,445 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-19 00:06:46,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:46,449 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-19 00:06:46,449 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-19 00:06:46,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:46,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:46,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:06:46,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:06:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-19 00:06:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-19 00:06:46,454 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2018-11-19 00:06:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:06:46,455 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-19 00:06:46,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-19 00:06:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-19 00:06:46,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-19 00:06:46,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:06:46,456 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:06:46,457 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:06:46,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:06:46,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2018-11-19 00:06:46,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:06:46,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:06:46,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:46,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:46,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:46,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {830#true} is VALID [2018-11-19 00:06:46,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {830#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {830#true} is VALID [2018-11-19 00:06:46,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2018-11-19 00:06:46,649 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #171#return; {830#true} is VALID [2018-11-19 00:06:46,649 INFO L256 TraceCheckUtils]: 4: Hoare triple {830#true} call #t~ret7 := main(); {830#true} is VALID [2018-11-19 00:06:46,650 INFO L273 TraceCheckUtils]: 5: Hoare triple {830#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; {830#true} is VALID [2018-11-19 00:06:46,650 INFO L273 TraceCheckUtils]: 6: Hoare triple {830#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {832#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:06:46,652 INFO L273 TraceCheckUtils]: 7: Hoare triple {832#(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; {832#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:06:46,652 INFO L273 TraceCheckUtils]: 8: Hoare triple {832#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {832#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:06:46,654 INFO L273 TraceCheckUtils]: 9: Hoare triple {832#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {833#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~0 1))} is VALID [2018-11-19 00:06:46,655 INFO L273 TraceCheckUtils]: 10: Hoare triple {833#(and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~0 1))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {834#(not (= 0 main_~__VERIFIER_assert__cond~1))} is VALID [2018-11-19 00:06:46,656 INFO L273 TraceCheckUtils]: 11: Hoare triple {834#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume 0 == ~__VERIFIER_assert__cond~1; {831#false} is VALID [2018-11-19 00:06:46,656 INFO L273 TraceCheckUtils]: 12: Hoare triple {831#false} assume !false; {831#false} is VALID [2018-11-19 00:06:46,657 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-19 00:06:46,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:06:46,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-19 00:06:46,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-19 00:06:46,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:46,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-19 00:06:46,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:46,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-19 00:06:46,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-19 00:06:46,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-19 00:06:46,680 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2018-11-19 00:06:47,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:47,146 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-19 00:06:47,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-19 00:06:47,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-19 00:06:47,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:06:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 00:06:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-19 00:06:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 00:06:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-19 00:06:47,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2018-11-19 00:06:47,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:47,273 INFO L225 Difference]: With dead ends: 73 [2018-11-19 00:06:47,273 INFO L226 Difference]: Without dead ends: 71 [2018-11-19 00:06:47,274 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-19 00:06:47,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-19 00:06:47,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-19 00:06:47,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:06:47,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 70 states. [2018-11-19 00:06:47,301 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 70 states. [2018-11-19 00:06:47,301 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 70 states. [2018-11-19 00:06:47,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:47,304 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-11-19 00:06:47,305 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-19 00:06:47,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:47,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:47,306 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 71 states. [2018-11-19 00:06:47,306 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 71 states. [2018-11-19 00:06:47,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:47,310 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-11-19 00:06:47,310 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-11-19 00:06:47,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:47,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:47,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:06:47,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:06:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-19 00:06:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-11-19 00:06:47,314 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2018-11-19 00:06:47,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:06:47,315 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-11-19 00:06:47,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-19 00:06:47,315 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-19 00:06:47,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-19 00:06:47,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:06:47,316 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:06:47,317 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:06:47,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:06:47,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2018-11-19 00:06:47,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:06:47,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:06:47,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:47,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:47,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:47,436 INFO L256 TraceCheckUtils]: 0: Hoare triple {1145#true} call ULTIMATE.init(); {1145#true} is VALID [2018-11-19 00:06:47,436 INFO L273 TraceCheckUtils]: 1: Hoare triple {1145#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1145#true} is VALID [2018-11-19 00:06:47,437 INFO L273 TraceCheckUtils]: 2: Hoare triple {1145#true} assume true; {1145#true} is VALID [2018-11-19 00:06:47,437 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1145#true} {1145#true} #171#return; {1145#true} is VALID [2018-11-19 00:06:47,438 INFO L256 TraceCheckUtils]: 4: Hoare triple {1145#true} call #t~ret7 := main(); {1145#true} is VALID [2018-11-19 00:06:47,438 INFO L273 TraceCheckUtils]: 5: Hoare triple {1145#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; {1145#true} is VALID [2018-11-19 00:06:47,439 INFO L273 TraceCheckUtils]: 6: Hoare triple {1145#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1147#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:47,443 INFO L273 TraceCheckUtils]: 7: Hoare triple {1147#(<= 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; {1147#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:47,443 INFO L273 TraceCheckUtils]: 8: Hoare triple {1147#(<= 0 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_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; {1148#(and (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:06:47,445 INFO L273 TraceCheckUtils]: 9: Hoare triple {1148#(and (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {1147#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:47,445 INFO L273 TraceCheckUtils]: 10: Hoare triple {1147#(<= 0 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {1147#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:47,449 INFO L273 TraceCheckUtils]: 11: Hoare triple {1147#(<= 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 := 1 + ~main__t~0; {1149#(<= 1 main_~main__t~0)} is VALID [2018-11-19 00:06:47,449 INFO L273 TraceCheckUtils]: 12: Hoare triple {1149#(<= 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; {1150#(not (= 0 main_~__VERIFIER_assert__cond~14))} is VALID [2018-11-19 00:06:47,450 INFO L273 TraceCheckUtils]: 13: Hoare triple {1150#(not (= 0 main_~__VERIFIER_assert__cond~14))} assume 0 == ~__VERIFIER_assert__cond~14; {1146#false} is VALID [2018-11-19 00:06:47,450 INFO L273 TraceCheckUtils]: 14: Hoare triple {1146#false} assume !false; {1146#false} is VALID [2018-11-19 00:06:47,451 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-19 00:06:47,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:06:47,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-19 00:06:47,452 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-19 00:06:47,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:47,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-19 00:06:47,474 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-19 00:06:47,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-19 00:06:47,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-19 00:06:47,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-19 00:06:47,476 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 6 states. [2018-11-19 00:06:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:48,218 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-11-19 00:06:48,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-19 00:06:48,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-19 00:06:48,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:06:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:06:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2018-11-19 00:06:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:06:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2018-11-19 00:06:48,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 113 transitions. [2018-11-19 00:06:48,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:48,362 INFO L225 Difference]: With dead ends: 107 [2018-11-19 00:06:48,363 INFO L226 Difference]: Without dead ends: 105 [2018-11-19 00:06:48,363 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-19 00:06:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-19 00:06:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 68. [2018-11-19 00:06:48,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:06:48,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 68 states. [2018-11-19 00:06:48,407 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 68 states. [2018-11-19 00:06:48,407 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 68 states. [2018-11-19 00:06:48,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:48,412 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-11-19 00:06:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-11-19 00:06:48,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:48,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:48,413 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 105 states. [2018-11-19 00:06:48,413 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 105 states. [2018-11-19 00:06:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:48,418 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-11-19 00:06:48,418 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-11-19 00:06:48,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:48,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:48,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:06:48,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:06:48,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-19 00:06:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-19 00:06:48,422 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2018-11-19 00:06:48,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:06:48,423 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-19 00:06:48,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-19 00:06:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-19 00:06:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-19 00:06:48,424 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:06:48,424 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:06:48,424 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:06:48,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:06:48,425 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2018-11-19 00:06:48,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:06:48,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:06:48,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:48,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:48,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:48,589 INFO L256 TraceCheckUtils]: 0: Hoare triple {1563#true} call ULTIMATE.init(); {1563#true} is VALID [2018-11-19 00:06:48,590 INFO L273 TraceCheckUtils]: 1: Hoare triple {1563#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1563#true} is VALID [2018-11-19 00:06:48,590 INFO L273 TraceCheckUtils]: 2: Hoare triple {1563#true} assume true; {1563#true} is VALID [2018-11-19 00:06:48,590 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1563#true} {1563#true} #171#return; {1563#true} is VALID [2018-11-19 00:06:48,591 INFO L256 TraceCheckUtils]: 4: Hoare triple {1563#true} call #t~ret7 := main(); {1563#true} is VALID [2018-11-19 00:06:48,591 INFO L273 TraceCheckUtils]: 5: Hoare triple {1563#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; {1563#true} is VALID [2018-11-19 00:06:48,592 INFO L273 TraceCheckUtils]: 6: Hoare triple {1563#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1565#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:48,593 INFO L273 TraceCheckUtils]: 7: Hoare triple {1565#(<= 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; {1565#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:48,593 INFO L273 TraceCheckUtils]: 8: Hoare triple {1565#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {1565#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:48,594 INFO L273 TraceCheckUtils]: 9: Hoare triple {1565#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {1566#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:06:48,598 INFO L273 TraceCheckUtils]: 10: Hoare triple {1566#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1565#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:48,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {1565#(<= 0 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {1567#(<= 1 main_~main__t~0)} is VALID [2018-11-19 00:06:48,600 INFO L273 TraceCheckUtils]: 12: Hoare triple {1567#(<= 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; {1568#(not (= 0 main_~__VERIFIER_assert__cond~2))} is VALID [2018-11-19 00:06:48,600 INFO L273 TraceCheckUtils]: 13: Hoare triple {1568#(not (= 0 main_~__VERIFIER_assert__cond~2))} assume 0 == ~__VERIFIER_assert__cond~2; {1564#false} is VALID [2018-11-19 00:06:48,600 INFO L273 TraceCheckUtils]: 14: Hoare triple {1564#false} assume !false; {1564#false} is VALID [2018-11-19 00:06:48,601 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-19 00:06:48,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:06:48,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-19 00:06:48,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-19 00:06:48,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:48,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-19 00:06:48,618 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-19 00:06:48,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-19 00:06:48,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-19 00:06:48,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-19 00:06:48,620 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 6 states. [2018-11-19 00:06:49,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:49,567 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-19 00:06:49,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-19 00:06:49,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-19 00:06:49,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:06:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:06:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2018-11-19 00:06:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:06:49,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2018-11-19 00:06:49,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2018-11-19 00:06:49,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:49,655 INFO L225 Difference]: With dead ends: 69 [2018-11-19 00:06:49,655 INFO L226 Difference]: Without dead ends: 67 [2018-11-19 00:06:49,656 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-19 00:06:49,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-19 00:06:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-19 00:06:49,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:06:49,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 66 states. [2018-11-19 00:06:49,691 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 66 states. [2018-11-19 00:06:49,691 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 66 states. [2018-11-19 00:06:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:49,694 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-19 00:06:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-19 00:06:49,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:49,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:49,695 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 67 states. [2018-11-19 00:06:49,695 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 67 states. [2018-11-19 00:06:49,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:49,698 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-19 00:06:49,698 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-19 00:06:49,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:49,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:49,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:06:49,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:06:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-19 00:06:49,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-19 00:06:49,702 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2018-11-19 00:06:49,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:06:49,702 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-19 00:06:49,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-19 00:06:49,702 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-19 00:06:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-19 00:06:49,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:06:49,704 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:06:49,707 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:06:49,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:06:49,707 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2018-11-19 00:06:49,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:06:49,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:06:49,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:49,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:49,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:49,913 INFO L256 TraceCheckUtils]: 0: Hoare triple {1863#true} call ULTIMATE.init(); {1863#true} is VALID [2018-11-19 00:06:49,914 INFO L273 TraceCheckUtils]: 1: Hoare triple {1863#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {1863#true} is VALID [2018-11-19 00:06:49,914 INFO L273 TraceCheckUtils]: 2: Hoare triple {1863#true} assume true; {1863#true} is VALID [2018-11-19 00:06:49,914 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1863#true} {1863#true} #171#return; {1863#true} is VALID [2018-11-19 00:06:49,914 INFO L256 TraceCheckUtils]: 4: Hoare triple {1863#true} call #t~ret7 := main(); {1863#true} is VALID [2018-11-19 00:06:49,915 INFO L273 TraceCheckUtils]: 5: Hoare triple {1863#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; {1863#true} is VALID [2018-11-19 00:06:49,915 INFO L273 TraceCheckUtils]: 6: Hoare triple {1863#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {1865#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:49,916 INFO L273 TraceCheckUtils]: 7: Hoare triple {1865#(<= 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; {1865#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:49,916 INFO L273 TraceCheckUtils]: 8: Hoare triple {1865#(<= 0 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_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; {1866#(and (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:06:49,917 INFO L273 TraceCheckUtils]: 9: Hoare triple {1866#(and (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {1865#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:49,917 INFO L273 TraceCheckUtils]: 10: Hoare triple {1865#(<= 0 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {1865#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:49,918 INFO L273 TraceCheckUtils]: 11: Hoare triple {1865#(<= 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 := 1 + ~main__t~0; {1867#(<= 1 main_~main__t~0)} is VALID [2018-11-19 00:06:49,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {1867#(<= 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; {1867#(<= 1 main_~main__t~0)} is VALID [2018-11-19 00:06:49,919 INFO L273 TraceCheckUtils]: 13: Hoare triple {1867#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {1868#(not (= 0 main_~__VERIFIER_assert__cond~16))} is VALID [2018-11-19 00:06:49,920 INFO L273 TraceCheckUtils]: 14: Hoare triple {1868#(not (= 0 main_~__VERIFIER_assert__cond~16))} assume 0 == ~__VERIFIER_assert__cond~16; {1864#false} is VALID [2018-11-19 00:06:49,921 INFO L273 TraceCheckUtils]: 15: Hoare triple {1864#false} assume !false; {1864#false} is VALID [2018-11-19 00:06:49,922 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-19 00:06:49,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:06:49,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-19 00:06:49,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-19 00:06:49,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:49,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-19 00:06:49,942 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-19 00:06:49,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-19 00:06:49,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-19 00:06:49,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-19 00:06:49,944 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-11-19 00:06:50,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:50,620 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-11-19 00:06:50,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-19 00:06:50,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-19 00:06:50,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:06:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:06:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2018-11-19 00:06:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:06:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2018-11-19 00:06:50,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 155 transitions. [2018-11-19 00:06:51,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:51,054 INFO L225 Difference]: With dead ends: 146 [2018-11-19 00:06:51,054 INFO L226 Difference]: Without dead ends: 144 [2018-11-19 00:06:51,054 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-19 00:06:51,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-19 00:06:51,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 64. [2018-11-19 00:06:51,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:06:51,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 64 states. [2018-11-19 00:06:51,093 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 64 states. [2018-11-19 00:06:51,093 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 64 states. [2018-11-19 00:06:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:51,097 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-11-19 00:06:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-11-19 00:06:51,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:51,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:51,098 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 144 states. [2018-11-19 00:06:51,098 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 144 states. [2018-11-19 00:06:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:51,102 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2018-11-19 00:06:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2018-11-19 00:06:51,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:51,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:51,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:06:51,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:06:51,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-19 00:06:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-11-19 00:06:51,105 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2018-11-19 00:06:51,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:06:51,106 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-11-19 00:06:51,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-19 00:06:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-19 00:06:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-19 00:06:51,106 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:06:51,107 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:06:51,107 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:06:51,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:06:51,108 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2018-11-19 00:06:51,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:06:51,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:06:51,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:51,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:51,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:51,223 INFO L256 TraceCheckUtils]: 0: Hoare triple {2397#true} call ULTIMATE.init(); {2397#true} is VALID [2018-11-19 00:06:51,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {2397#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2397#true} is VALID [2018-11-19 00:06:51,224 INFO L273 TraceCheckUtils]: 2: Hoare triple {2397#true} assume true; {2397#true} is VALID [2018-11-19 00:06:51,225 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2397#true} {2397#true} #171#return; {2397#true} is VALID [2018-11-19 00:06:51,225 INFO L256 TraceCheckUtils]: 4: Hoare triple {2397#true} call #t~ret7 := main(); {2397#true} is VALID [2018-11-19 00:06:51,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {2397#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; {2397#true} is VALID [2018-11-19 00:06:51,226 INFO L273 TraceCheckUtils]: 6: Hoare triple {2397#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2399#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:51,226 INFO L273 TraceCheckUtils]: 7: Hoare triple {2399#(<= 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; {2399#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:51,227 INFO L273 TraceCheckUtils]: 8: Hoare triple {2399#(<= 0 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_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; {2400#(= main_~__VERIFIER_assert__cond~12 1)} is VALID [2018-11-19 00:06:51,227 INFO L273 TraceCheckUtils]: 9: Hoare triple {2400#(= main_~__VERIFIER_assert__cond~12 1)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {2397#true} is VALID [2018-11-19 00:06:51,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {2397#true} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {2397#true} is VALID [2018-11-19 00:06:51,228 INFO L273 TraceCheckUtils]: 11: Hoare triple {2397#true} ~main____CPAchecker_TMP_0~0 := ~__tmp_383_0~0;~main____CPAchecker_TMP_1~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {2397#true} is VALID [2018-11-19 00:06:51,228 INFO L273 TraceCheckUtils]: 12: Hoare triple {2397#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; {2401#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:51,229 INFO L273 TraceCheckUtils]: 13: Hoare triple {2401#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {2402#(not (= 0 main_~__VERIFIER_assert__cond~15))} is VALID [2018-11-19 00:06:51,230 INFO L273 TraceCheckUtils]: 14: Hoare triple {2402#(not (= 0 main_~__VERIFIER_assert__cond~15))} assume 0 == ~__VERIFIER_assert__cond~15; {2398#false} is VALID [2018-11-19 00:06:51,230 INFO L273 TraceCheckUtils]: 15: Hoare triple {2398#false} assume !false; {2398#false} is VALID [2018-11-19 00:06:51,230 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-19 00:06:51,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:06:51,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-19 00:06:51,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-19 00:06:51,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:51,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-19 00:06:51,245 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-19 00:06:51,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-19 00:06:51,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-19 00:06:51,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-19 00:06:51,246 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-11-19 00:06:51,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:51,770 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-11-19 00:06:51,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-19 00:06:51,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-19 00:06:51,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:06:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:06:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-11-19 00:06:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:06:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2018-11-19 00:06:51,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 105 transitions. [2018-11-19 00:06:51,877 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-19 00:06:51,879 INFO L225 Difference]: With dead ends: 99 [2018-11-19 00:06:51,879 INFO L226 Difference]: Without dead ends: 95 [2018-11-19 00:06:51,879 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-19 00:06:51,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-19 00:06:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 60. [2018-11-19 00:06:51,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:06:51,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 60 states. [2018-11-19 00:06:51,903 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 60 states. [2018-11-19 00:06:51,903 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 60 states. [2018-11-19 00:06:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:51,906 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-11-19 00:06:51,906 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-11-19 00:06:51,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:51,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:51,907 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 95 states. [2018-11-19 00:06:51,907 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 95 states. [2018-11-19 00:06:51,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:51,910 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-11-19 00:06:51,910 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-11-19 00:06:51,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:51,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:51,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:06:51,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:06:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-19 00:06:51,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-19 00:06:51,913 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2018-11-19 00:06:51,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:06:51,914 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-19 00:06:51,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-19 00:06:51,914 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-19 00:06:51,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-19 00:06:51,914 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:06:51,914 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:06:51,915 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:06:51,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:06:51,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2018-11-19 00:06:51,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:06:51,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:06:51,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:51,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:51,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:51,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:52,018 INFO L256 TraceCheckUtils]: 0: Hoare triple {2785#true} call ULTIMATE.init(); {2785#true} is VALID [2018-11-19 00:06:52,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {2785#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {2785#true} is VALID [2018-11-19 00:06:52,019 INFO L273 TraceCheckUtils]: 2: Hoare triple {2785#true} assume true; {2785#true} is VALID [2018-11-19 00:06:52,020 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2785#true} {2785#true} #171#return; {2785#true} is VALID [2018-11-19 00:06:52,020 INFO L256 TraceCheckUtils]: 4: Hoare triple {2785#true} call #t~ret7 := main(); {2785#true} is VALID [2018-11-19 00:06:52,020 INFO L273 TraceCheckUtils]: 5: Hoare triple {2785#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; {2785#true} is VALID [2018-11-19 00:06:52,025 INFO L273 TraceCheckUtils]: 6: Hoare triple {2785#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {2787#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:52,026 INFO L273 TraceCheckUtils]: 7: Hoare triple {2787#(<= 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; {2787#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:52,026 INFO L273 TraceCheckUtils]: 8: Hoare triple {2787#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {2787#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:52,029 INFO L273 TraceCheckUtils]: 9: Hoare triple {2787#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {2788#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:06:52,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {2788#(= main_~__VERIFIER_assert__cond~0 1)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2785#true} is VALID [2018-11-19 00:06:52,029 INFO L273 TraceCheckUtils]: 11: Hoare triple {2785#true} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {2785#true} is VALID [2018-11-19 00:06:52,031 INFO L273 TraceCheckUtils]: 12: Hoare triple {2785#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; {2789#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:52,032 INFO L273 TraceCheckUtils]: 13: Hoare triple {2789#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2790#(not (= 0 main_~__VERIFIER_assert__cond~3))} is VALID [2018-11-19 00:06:52,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {2790#(not (= 0 main_~__VERIFIER_assert__cond~3))} assume 0 == ~__VERIFIER_assert__cond~3; {2786#false} is VALID [2018-11-19 00:06:52,033 INFO L273 TraceCheckUtils]: 15: Hoare triple {2786#false} assume !false; {2786#false} is VALID [2018-11-19 00:06:52,034 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-19 00:06:52,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:06:52,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-19 00:06:52,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-19 00:06:52,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:52,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-19 00:06:52,090 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-19 00:06:52,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-19 00:06:52,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-19 00:06:52,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-19 00:06:52,092 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 6 states. [2018-11-19 00:06:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:52,431 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-19 00:06:52,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-19 00:06:52,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-19 00:06:52,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:06:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:06:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2018-11-19 00:06:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:06:52,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2018-11-19 00:06:52,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2018-11-19 00:06:52,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:52,541 INFO L225 Difference]: With dead ends: 61 [2018-11-19 00:06:52,542 INFO L226 Difference]: Without dead ends: 57 [2018-11-19 00:06:52,542 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-19 00:06:52,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-19 00:06:52,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-19 00:06:52,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:06:52,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 56 states. [2018-11-19 00:06:52,573 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 56 states. [2018-11-19 00:06:52,573 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 56 states. [2018-11-19 00:06:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:52,576 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-19 00:06:52,576 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-19 00:06:52,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:52,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:52,576 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 57 states. [2018-11-19 00:06:52,577 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 57 states. [2018-11-19 00:06:52,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:52,578 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-19 00:06:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-19 00:06:52,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:52,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:52,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:06:52,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:06:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-19 00:06:52,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-19 00:06:52,581 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2018-11-19 00:06:52,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:06:52,581 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-19 00:06:52,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-19 00:06:52,582 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-19 00:06:52,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-19 00:06:52,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:06:52,582 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:06:52,583 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:06:52,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:06:52,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2018-11-19 00:06:52,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:06:52,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:06:52,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:52,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:52,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:53,067 INFO L256 TraceCheckUtils]: 0: Hoare triple {3053#true} call ULTIMATE.init(); {3053#true} is VALID [2018-11-19 00:06:53,067 INFO L273 TraceCheckUtils]: 1: Hoare triple {3053#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3053#true} is VALID [2018-11-19 00:06:53,067 INFO L273 TraceCheckUtils]: 2: Hoare triple {3053#true} assume true; {3053#true} is VALID [2018-11-19 00:06:53,068 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3053#true} {3053#true} #171#return; {3053#true} is VALID [2018-11-19 00:06:53,068 INFO L256 TraceCheckUtils]: 4: Hoare triple {3053#true} call #t~ret7 := main(); {3053#true} is VALID [2018-11-19 00:06:53,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {3053#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; {3053#true} is VALID [2018-11-19 00:06:53,083 INFO L273 TraceCheckUtils]: 6: Hoare triple {3053#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3055#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:53,084 INFO L273 TraceCheckUtils]: 7: Hoare triple {3055#(<= 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; {3056#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:06:53,085 INFO L273 TraceCheckUtils]: 8: Hoare triple {3056#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_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; {3057#(and (= main_~__VERIFIER_assert__cond~12 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-19 00:06:53,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {3057#(and (= main_~__VERIFIER_assert__cond~12 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {3058#(or (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= 0 main_~__VERIFIER_assert__cond~13))} is VALID [2018-11-19 00:06:53,086 INFO L273 TraceCheckUtils]: 10: Hoare triple {3058#(or (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= 0 main_~__VERIFIER_assert__cond~13))} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {3059#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:53,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {3059#(<= (+ 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 := 1 + ~main__t~0; {3060#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:53,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {3060#(<= 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; {3060#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:53,093 INFO L273 TraceCheckUtils]: 13: Hoare triple {3060#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_0~1);havoc ~__tmp_17~0;~__tmp_17~0 := (if 0 <= ~main__t~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {3060#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:53,093 INFO L273 TraceCheckUtils]: 14: Hoare triple {3060#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {3061#(not (= 0 main_~__VERIFIER_assert__cond~17))} is VALID [2018-11-19 00:06:53,094 INFO L273 TraceCheckUtils]: 15: Hoare triple {3061#(not (= 0 main_~__VERIFIER_assert__cond~17))} assume 0 == ~__VERIFIER_assert__cond~17; {3054#false} is VALID [2018-11-19 00:06:53,094 INFO L273 TraceCheckUtils]: 16: Hoare triple {3054#false} assume !false; {3054#false} is VALID [2018-11-19 00:06:53,095 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-19 00:06:53,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:06:53,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-19 00:06:53,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-19 00:06:53,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:53,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-19 00:06:53,113 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-19 00:06:53,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-19 00:06:53,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-19 00:06:53,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-19 00:06:53,114 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2018-11-19 00:06:54,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:54,463 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-11-19 00:06:54,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-19 00:06:54,463 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-19 00:06:54,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:06:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 00:06:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2018-11-19 00:06:54,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 00:06:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2018-11-19 00:06:54,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2018-11-19 00:06:54,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:54,579 INFO L225 Difference]: With dead ends: 95 [2018-11-19 00:06:54,579 INFO L226 Difference]: Without dead ends: 93 [2018-11-19 00:06:54,580 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-19 00:06:54,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-19 00:06:54,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2018-11-19 00:06:54,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:06:54,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 54 states. [2018-11-19 00:06:54,653 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 54 states. [2018-11-19 00:06:54,653 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 54 states. [2018-11-19 00:06:54,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:54,659 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-11-19 00:06:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-11-19 00:06:54,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:54,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:54,662 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 93 states. [2018-11-19 00:06:54,663 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 93 states. [2018-11-19 00:06:54,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:54,669 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2018-11-19 00:06:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-11-19 00:06:54,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:54,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:54,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:06:54,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:06:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-19 00:06:54,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-19 00:06:54,671 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2018-11-19 00:06:54,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:06:54,671 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-19 00:06:54,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-19 00:06:54,671 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-19 00:06:54,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-19 00:06:54,672 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:06:54,672 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:06:54,673 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:06:54,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:06:54,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2018-11-19 00:06:54,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:06:54,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:06:54,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:54,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:54,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:54,752 INFO L256 TraceCheckUtils]: 0: Hoare triple {3431#true} call ULTIMATE.init(); {3431#true} is VALID [2018-11-19 00:06:54,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {3431#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3431#true} is VALID [2018-11-19 00:06:54,753 INFO L273 TraceCheckUtils]: 2: Hoare triple {3431#true} assume true; {3431#true} is VALID [2018-11-19 00:06:54,753 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3431#true} {3431#true} #171#return; {3431#true} is VALID [2018-11-19 00:06:54,754 INFO L256 TraceCheckUtils]: 4: Hoare triple {3431#true} call #t~ret7 := main(); {3431#true} is VALID [2018-11-19 00:06:54,754 INFO L273 TraceCheckUtils]: 5: Hoare triple {3431#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; {3431#true} is VALID [2018-11-19 00:06:54,755 INFO L273 TraceCheckUtils]: 6: Hoare triple {3431#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3433#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:54,755 INFO L273 TraceCheckUtils]: 7: Hoare triple {3433#(<= 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; {3433#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:54,755 INFO L273 TraceCheckUtils]: 8: Hoare triple {3433#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {3433#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:54,756 INFO L273 TraceCheckUtils]: 9: Hoare triple {3433#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {3434#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:06:54,756 INFO L273 TraceCheckUtils]: 10: Hoare triple {3434#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3433#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:54,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {3433#(<= 0 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {3435#(<= 1 main_~main__t~0)} is VALID [2018-11-19 00:06:54,757 INFO L273 TraceCheckUtils]: 12: Hoare triple {3435#(<= 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; {3435#(<= 1 main_~main__t~0)} is VALID [2018-11-19 00:06:54,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {3435#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {3435#(<= 1 main_~main__t~0)} is VALID [2018-11-19 00:06:54,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {3435#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_4~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; {3436#(not (= 0 main_~__VERIFIER_assert__cond~4))} is VALID [2018-11-19 00:06:54,760 INFO L273 TraceCheckUtils]: 15: Hoare triple {3436#(not (= 0 main_~__VERIFIER_assert__cond~4))} assume 0 == ~__VERIFIER_assert__cond~4; {3432#false} is VALID [2018-11-19 00:06:54,760 INFO L273 TraceCheckUtils]: 16: Hoare triple {3432#false} assume !false; {3432#false} is VALID [2018-11-19 00:06:54,761 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-19 00:06:54,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:06:54,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-19 00:06:54,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-19 00:06:54,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:54,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-19 00:06:54,805 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-19 00:06:54,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-19 00:06:54,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-19 00:06:54,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-19 00:06:54,806 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2018-11-19 00:06:55,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:55,132 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-19 00:06:55,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-19 00:06:55,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-19 00:06:55,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:06:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:06:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2018-11-19 00:06:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:06:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2018-11-19 00:06:55,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 78 transitions. [2018-11-19 00:06:55,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:55,212 INFO L225 Difference]: With dead ends: 72 [2018-11-19 00:06:55,213 INFO L226 Difference]: Without dead ends: 70 [2018-11-19 00:06:55,213 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-19 00:06:55,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-19 00:06:55,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2018-11-19 00:06:55,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:06:55,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 52 states. [2018-11-19 00:06:55,275 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 52 states. [2018-11-19 00:06:55,275 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 52 states. [2018-11-19 00:06:55,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:55,277 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-19 00:06:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-19 00:06:55,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:55,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:55,278 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 70 states. [2018-11-19 00:06:55,278 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 70 states. [2018-11-19 00:06:55,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:55,280 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-11-19 00:06:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-11-19 00:06:55,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:55,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:55,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:06:55,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:06:55,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-19 00:06:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-19 00:06:55,282 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2018-11-19 00:06:55,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:06:55,282 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-19 00:06:55,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-19 00:06:55,283 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-19 00:06:55,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-19 00:06:55,283 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:06:55,283 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:06:55,284 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:06:55,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:06:55,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2018-11-19 00:06:55,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:06:55,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:06:55,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:55,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:55,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:55,758 INFO L256 TraceCheckUtils]: 0: Hoare triple {3728#true} call ULTIMATE.init(); {3728#true} is VALID [2018-11-19 00:06:55,758 INFO L273 TraceCheckUtils]: 1: Hoare triple {3728#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3728#true} is VALID [2018-11-19 00:06:55,758 INFO L273 TraceCheckUtils]: 2: Hoare triple {3728#true} assume true; {3728#true} is VALID [2018-11-19 00:06:55,759 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3728#true} {3728#true} #171#return; {3728#true} is VALID [2018-11-19 00:06:55,759 INFO L256 TraceCheckUtils]: 4: Hoare triple {3728#true} call #t~ret7 := main(); {3728#true} is VALID [2018-11-19 00:06:55,759 INFO L273 TraceCheckUtils]: 5: Hoare triple {3728#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; {3728#true} is VALID [2018-11-19 00:06:55,760 INFO L273 TraceCheckUtils]: 6: Hoare triple {3728#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3730#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:55,760 INFO L273 TraceCheckUtils]: 7: Hoare triple {3730#(<= 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; {3730#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:55,761 INFO L273 TraceCheckUtils]: 8: Hoare triple {3730#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {3730#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:55,761 INFO L273 TraceCheckUtils]: 9: Hoare triple {3730#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {3731#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:06:55,762 INFO L273 TraceCheckUtils]: 10: Hoare triple {3731#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3730#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:55,762 INFO L273 TraceCheckUtils]: 11: Hoare triple {3730#(<= 0 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {3732#(<= 1 main_~main__t~0)} is VALID [2018-11-19 00:06:55,763 INFO L273 TraceCheckUtils]: 12: Hoare triple {3732#(<= 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; {3732#(<= 1 main_~main__t~0)} is VALID [2018-11-19 00:06:55,763 INFO L273 TraceCheckUtils]: 13: Hoare triple {3732#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {3732#(<= 1 main_~main__t~0)} is VALID [2018-11-19 00:06:55,765 INFO L273 TraceCheckUtils]: 14: Hoare triple {3732#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_6~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; {3733#(not (= 0 main_~__VERIFIER_assert__cond~10))} is VALID [2018-11-19 00:06:55,765 INFO L273 TraceCheckUtils]: 15: Hoare triple {3733#(not (= 0 main_~__VERIFIER_assert__cond~10))} assume 0 == ~__VERIFIER_assert__cond~10; {3729#false} is VALID [2018-11-19 00:06:55,766 INFO L273 TraceCheckUtils]: 16: Hoare triple {3729#false} assume !false; {3729#false} is VALID [2018-11-19 00:06:55,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-19 00:06:55,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:06:55,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-19 00:06:55,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-19 00:06:55,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:55,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-19 00:06:55,784 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-19 00:06:55,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-19 00:06:55,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-19 00:06:55,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-19 00:06:55,785 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-11-19 00:06:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:56,194 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-19 00:06:56,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-19 00:06:56,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-19 00:06:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:06:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:06:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2018-11-19 00:06:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:06:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2018-11-19 00:06:56,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 57 transitions. [2018-11-19 00:06:56,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:56,252 INFO L225 Difference]: With dead ends: 53 [2018-11-19 00:06:56,252 INFO L226 Difference]: Without dead ends: 51 [2018-11-19 00:06:56,253 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-19 00:06:56,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-19 00:06:56,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-19 00:06:56,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:06:56,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-19 00:06:56,297 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-19 00:06:56,297 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-19 00:06:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:56,299 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-19 00:06:56,299 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-19 00:06:56,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:56,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:56,299 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-19 00:06:56,299 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-19 00:06:56,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:56,301 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-19 00:06:56,301 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-19 00:06:56,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:56,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:56,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:06:56,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:06:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-19 00:06:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-19 00:06:56,303 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-11-19 00:06:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:06:56,303 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-19 00:06:56,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-19 00:06:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-19 00:06:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-19 00:06:56,303 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:06:56,303 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-19 00:06:56,304 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:06:56,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:06:56,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2018-11-19 00:06:56,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:06:56,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:06:56,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:56,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:56,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:56,503 INFO L256 TraceCheckUtils]: 0: Hoare triple {3964#true} call ULTIMATE.init(); {3964#true} is VALID [2018-11-19 00:06:56,504 INFO L273 TraceCheckUtils]: 1: Hoare triple {3964#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {3964#true} is VALID [2018-11-19 00:06:56,504 INFO L273 TraceCheckUtils]: 2: Hoare triple {3964#true} assume true; {3964#true} is VALID [2018-11-19 00:06:56,504 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3964#true} {3964#true} #171#return; {3964#true} is VALID [2018-11-19 00:06:56,504 INFO L256 TraceCheckUtils]: 4: Hoare triple {3964#true} call #t~ret7 := main(); {3964#true} is VALID [2018-11-19 00:06:56,504 INFO L273 TraceCheckUtils]: 5: Hoare triple {3964#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; {3964#true} is VALID [2018-11-19 00:06:56,505 INFO L273 TraceCheckUtils]: 6: Hoare triple {3964#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {3966#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:56,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {3966#(<= 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; {3967#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:06:56,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {3967#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !!(0 == ~main____CPAchecker_TMP_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; {3968#(and (= main_~__VERIFIER_assert__cond~12 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-19 00:06:56,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {3968#(and (= main_~__VERIFIER_assert__cond~12 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {3969#(or (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= 0 main_~__VERIFIER_assert__cond~13))} is VALID [2018-11-19 00:06:56,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {3969#(or (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= 0 main_~__VERIFIER_assert__cond~13))} assume !(0 == ~__VERIFIER_assert__cond~13);~__tmp_383_0~0 := ~main____CPAchecker_TMP_0~0; {3970#(<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:56,508 INFO L273 TraceCheckUtils]: 11: Hoare triple {3970#(<= (+ 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 := 1 + ~main__t~0; {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:56,508 INFO L273 TraceCheckUtils]: 12: Hoare triple {3971#(<= 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; {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:56,508 INFO L273 TraceCheckUtils]: 13: Hoare triple {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_0~1);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~1; {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:56,509 INFO L273 TraceCheckUtils]: 14: Hoare triple {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:56,510 INFO L273 TraceCheckUtils]: 15: Hoare triple {3971#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3972#(not (= 0 main_~__VERIFIER_assert__cond~1))} is VALID [2018-11-19 00:06:56,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {3972#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume 0 == ~__VERIFIER_assert__cond~1; {3965#false} is VALID [2018-11-19 00:06:56,511 INFO L273 TraceCheckUtils]: 17: Hoare triple {3965#false} assume !false; {3965#false} is VALID [2018-11-19 00:06:56,512 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-19 00:06:56,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:06:56,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-19 00:06:56,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-19 00:06:56,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:56,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-19 00:06:56,552 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-19 00:06:56,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-19 00:06:56,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-19 00:06:56,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-19 00:06:56,553 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2018-11-19 00:06:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:57,160 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-19 00:06:57,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-19 00:06:57,161 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-19 00:06:57,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:06:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 00:06:57,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-19 00:06:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 00:06:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2018-11-19 00:06:57,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2018-11-19 00:06:57,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:57,225 INFO L225 Difference]: With dead ends: 51 [2018-11-19 00:06:57,225 INFO L226 Difference]: Without dead ends: 49 [2018-11-19 00:06:57,226 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-19 00:06:57,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-19 00:06:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-19 00:06:57,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:06:57,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 45 states. [2018-11-19 00:06:57,256 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 45 states. [2018-11-19 00:06:57,257 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 45 states. [2018-11-19 00:06:57,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:57,259 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-19 00:06:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-19 00:06:57,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:57,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:57,259 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 49 states. [2018-11-19 00:06:57,260 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 49 states. [2018-11-19 00:06:57,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:57,261 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-19 00:06:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-19 00:06:57,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:57,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:57,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:06:57,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:06:57,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-19 00:06:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-19 00:06:57,263 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2018-11-19 00:06:57,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:06:57,264 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-19 00:06:57,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-19 00:06:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-19 00:06:57,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-19 00:06:57,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:06:57,264 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-19 00:06:57,265 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:06:57,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:06:57,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2018-11-19 00:06:57,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:06:57,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:06:57,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:57,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:57,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:57,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {4197#true} call ULTIMATE.init(); {4197#true} is VALID [2018-11-19 00:06:57,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {4197#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4197#true} is VALID [2018-11-19 00:06:57,345 INFO L273 TraceCheckUtils]: 2: Hoare triple {4197#true} assume true; {4197#true} is VALID [2018-11-19 00:06:57,345 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4197#true} {4197#true} #171#return; {4197#true} is VALID [2018-11-19 00:06:57,345 INFO L256 TraceCheckUtils]: 4: Hoare triple {4197#true} call #t~ret7 := main(); {4197#true} is VALID [2018-11-19 00:06:57,346 INFO L273 TraceCheckUtils]: 5: Hoare triple {4197#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; {4197#true} is VALID [2018-11-19 00:06:57,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {4197#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4199#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:57,348 INFO L273 TraceCheckUtils]: 7: Hoare triple {4199#(<= 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; {4199#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:57,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {4199#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {4199#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:57,350 INFO L273 TraceCheckUtils]: 9: Hoare triple {4199#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {4200#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:06:57,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {4200#(and (= main_~__VERIFIER_assert__cond~0 1) (<= 0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4199#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:57,353 INFO L273 TraceCheckUtils]: 11: Hoare triple {4199#(<= 0 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {4201#(<= 1 main_~main__t~0)} is VALID [2018-11-19 00:06:57,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {4201#(<= 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; {4201#(<= 1 main_~main__t~0)} is VALID [2018-11-19 00:06:57,356 INFO L273 TraceCheckUtils]: 13: Hoare triple {4201#(<= 1 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {4201#(<= 1 main_~main__t~0)} is VALID [2018-11-19 00:06:57,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {4201#(<= 1 main_~main__t~0)} assume !!(0 == ~main____CPAchecker_TMP_4~0); {4201#(<= 1 main_~main__t~0)} is VALID [2018-11-19 00:06:57,363 INFO L273 TraceCheckUtils]: 15: Hoare triple {4201#(<= 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; {4202#(not (= 0 main_~__VERIFIER_assert__cond~8))} is VALID [2018-11-19 00:06:57,363 INFO L273 TraceCheckUtils]: 16: Hoare triple {4202#(not (= 0 main_~__VERIFIER_assert__cond~8))} assume 0 == ~__VERIFIER_assert__cond~8; {4198#false} is VALID [2018-11-19 00:06:57,364 INFO L273 TraceCheckUtils]: 17: Hoare triple {4198#false} assume !false; {4198#false} is VALID [2018-11-19 00:06:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:06:57,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:06:57,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-19 00:06:57,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-19 00:06:57,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:57,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-19 00:06:57,392 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-19 00:06:57,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-19 00:06:57,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-19 00:06:57,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-19 00:06:57,393 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-11-19 00:06:58,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:58,149 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-11-19 00:06:58,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-19 00:06:58,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-19 00:06:58,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:06:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:06:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2018-11-19 00:06:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:06:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2018-11-19 00:06:58,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2018-11-19 00:06:58,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:58,308 INFO L225 Difference]: With dead ends: 69 [2018-11-19 00:06:58,308 INFO L226 Difference]: Without dead ends: 67 [2018-11-19 00:06:58,308 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-19 00:06:58,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-19 00:06:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-11-19 00:06:58,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:06:58,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 43 states. [2018-11-19 00:06:58,336 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 43 states. [2018-11-19 00:06:58,336 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 43 states. [2018-11-19 00:06:58,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:58,338 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-11-19 00:06:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-11-19 00:06:58,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:58,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:58,338 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 67 states. [2018-11-19 00:06:58,338 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 67 states. [2018-11-19 00:06:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:58,339 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-11-19 00:06:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-11-19 00:06:58,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:58,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:58,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:06:58,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:06:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-19 00:06:58,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-19 00:06:58,341 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2018-11-19 00:06:58,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:06:58,341 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-19 00:06:58,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-19 00:06:58,342 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-19 00:06:58,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-19 00:06:58,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:06:58,342 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-19 00:06:58,343 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:06:58,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:06:58,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2018-11-19 00:06:58,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:06:58,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:06:58,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:58,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:58,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:58,876 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 7 [2018-11-19 00:06:59,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {4475#true} call ULTIMATE.init(); {4475#true} is VALID [2018-11-19 00:06:59,105 INFO L273 TraceCheckUtils]: 1: Hoare triple {4475#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4475#true} is VALID [2018-11-19 00:06:59,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {4475#true} assume true; {4475#true} is VALID [2018-11-19 00:06:59,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4475#true} {4475#true} #171#return; {4475#true} is VALID [2018-11-19 00:06:59,106 INFO L256 TraceCheckUtils]: 4: Hoare triple {4475#true} call #t~ret7 := main(); {4475#true} is VALID [2018-11-19 00:06:59,106 INFO L273 TraceCheckUtils]: 5: Hoare triple {4475#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; {4475#true} is VALID [2018-11-19 00:06:59,119 INFO L273 TraceCheckUtils]: 6: Hoare triple {4475#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4477#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:59,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {4477#(<= 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; {4478#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:06:59,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {4478#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {4478#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:06:59,130 INFO L273 TraceCheckUtils]: 9: Hoare triple {4478#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {4479#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-19 00:06:59,132 INFO L273 TraceCheckUtils]: 10: Hoare triple {4479#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4480#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} is VALID [2018-11-19 00:06:59,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {4480#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {4481#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:59,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {4481#(<= 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; {4481#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:59,137 INFO L273 TraceCheckUtils]: 13: Hoare triple {4481#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {4481#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:59,139 INFO L273 TraceCheckUtils]: 14: Hoare triple {4481#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_4~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; {4481#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:59,142 INFO L273 TraceCheckUtils]: 15: Hoare triple {4481#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {4482#(not (= 0 main_~__VERIFIER_assert__cond~5))} is VALID [2018-11-19 00:06:59,144 INFO L273 TraceCheckUtils]: 16: Hoare triple {4482#(not (= 0 main_~__VERIFIER_assert__cond~5))} assume 0 == ~__VERIFIER_assert__cond~5; {4476#false} is VALID [2018-11-19 00:06:59,144 INFO L273 TraceCheckUtils]: 17: Hoare triple {4476#false} assume !false; {4476#false} is VALID [2018-11-19 00:06:59,145 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-19 00:06:59,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:06:59,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-19 00:06:59,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-19 00:06:59,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:59,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-19 00:06:59,164 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-19 00:06:59,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-19 00:06:59,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-19 00:06:59,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-19 00:06:59,165 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 8 states. [2018-11-19 00:06:59,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:59,698 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-19 00:06:59,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-19 00:06:59,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-19 00:06:59,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:06:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-19 00:06:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-19 00:06:59,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-19 00:06:59,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2018-11-19 00:06:59,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2018-11-19 00:06:59,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:06:59,767 INFO L225 Difference]: With dead ends: 57 [2018-11-19 00:06:59,768 INFO L226 Difference]: Without dead ends: 55 [2018-11-19 00:06:59,768 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-19 00:06:59,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-19 00:06:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2018-11-19 00:06:59,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:06:59,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 41 states. [2018-11-19 00:06:59,798 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 41 states. [2018-11-19 00:06:59,798 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 41 states. [2018-11-19 00:06:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:59,800 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-11-19 00:06:59,800 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-11-19 00:06:59,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:59,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:59,801 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 55 states. [2018-11-19 00:06:59,801 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 55 states. [2018-11-19 00:06:59,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:06:59,803 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-11-19 00:06:59,803 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-11-19 00:06:59,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:06:59,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:06:59,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:06:59,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:06:59,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-19 00:06:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-19 00:06:59,805 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2018-11-19 00:06:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:06:59,805 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-19 00:06:59,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-19 00:06:59,805 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-19 00:06:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-19 00:06:59,805 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:06:59,806 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-19 00:06:59,806 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:06:59,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:06:59,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2018-11-19 00:06:59,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:06:59,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:06:59,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:59,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:06:59,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:06:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:06:59,966 INFO L256 TraceCheckUtils]: 0: Hoare triple {4721#true} call ULTIMATE.init(); {4721#true} is VALID [2018-11-19 00:06:59,966 INFO L273 TraceCheckUtils]: 1: Hoare triple {4721#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4721#true} is VALID [2018-11-19 00:06:59,966 INFO L273 TraceCheckUtils]: 2: Hoare triple {4721#true} assume true; {4721#true} is VALID [2018-11-19 00:06:59,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4721#true} {4721#true} #171#return; {4721#true} is VALID [2018-11-19 00:06:59,967 INFO L256 TraceCheckUtils]: 4: Hoare triple {4721#true} call #t~ret7 := main(); {4721#true} is VALID [2018-11-19 00:06:59,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {4721#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; {4721#true} is VALID [2018-11-19 00:06:59,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {4721#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4723#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:06:59,968 INFO L273 TraceCheckUtils]: 7: Hoare triple {4723#(<= 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; {4724#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:06:59,969 INFO L273 TraceCheckUtils]: 8: Hoare triple {4724#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {4724#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:06:59,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {4724#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {4725#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-19 00:06:59,970 INFO L273 TraceCheckUtils]: 10: Hoare triple {4725#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4726#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} is VALID [2018-11-19 00:06:59,971 INFO L273 TraceCheckUtils]: 11: Hoare triple {4726#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {4727#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:59,972 INFO L273 TraceCheckUtils]: 12: Hoare triple {4727#(<= 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; {4727#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:59,972 INFO L273 TraceCheckUtils]: 13: Hoare triple {4727#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_6~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_6~0 := #t~nondet5;havoc #t~nondet5; {4727#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:59,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {4727#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_6~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; {4727#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:06:59,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {4727#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {4728#(not (= 0 main_~__VERIFIER_assert__cond~11))} is VALID [2018-11-19 00:06:59,974 INFO L273 TraceCheckUtils]: 16: Hoare triple {4728#(not (= 0 main_~__VERIFIER_assert__cond~11))} assume 0 == ~__VERIFIER_assert__cond~11; {4722#false} is VALID [2018-11-19 00:06:59,974 INFO L273 TraceCheckUtils]: 17: Hoare triple {4722#false} assume !false; {4722#false} is VALID [2018-11-19 00:06:59,975 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-19 00:06:59,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:06:59,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-19 00:06:59,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-19 00:06:59,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:06:59,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-19 00:06:59,990 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-19 00:06:59,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-19 00:06:59,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-19 00:06:59,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-19 00:06:59,991 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-11-19 00:07:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:00,399 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-19 00:07:00,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-19 00:07:00,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-19 00:07:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:07:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-19 00:07:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-19 00:07:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-19 00:07:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-19 00:07:00,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2018-11-19 00:07:00,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:00,570 INFO L225 Difference]: With dead ends: 41 [2018-11-19 00:07:00,570 INFO L226 Difference]: Without dead ends: 37 [2018-11-19 00:07:00,571 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-19 00:07:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-19 00:07:00,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-19 00:07:00,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:07:00,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-19 00:07:00,600 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-19 00:07:00,600 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-19 00:07:00,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:00,601 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-19 00:07:00,601 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-19 00:07:00,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:00,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:00,602 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-19 00:07:00,602 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-19 00:07:00,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:00,603 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-19 00:07:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-19 00:07:00,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:00,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:00,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:07:00,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:07:00,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-19 00:07:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-19 00:07:00,605 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2018-11-19 00:07:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:07:00,605 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-19 00:07:00,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-19 00:07:00,606 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-19 00:07:00,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-19 00:07:00,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:07:00,606 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-19 00:07:00,607 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:07:00,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:07:00,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2018-11-19 00:07:00,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:07:00,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:07:00,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:00,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:07:00,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:00,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {4907#true} call ULTIMATE.init(); {4907#true} is VALID [2018-11-19 00:07:00,857 INFO L273 TraceCheckUtils]: 1: Hoare triple {4907#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {4907#true} is VALID [2018-11-19 00:07:00,857 INFO L273 TraceCheckUtils]: 2: Hoare triple {4907#true} assume true; {4907#true} is VALID [2018-11-19 00:07:00,857 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4907#true} {4907#true} #171#return; {4907#true} is VALID [2018-11-19 00:07:00,858 INFO L256 TraceCheckUtils]: 4: Hoare triple {4907#true} call #t~ret7 := main(); {4907#true} is VALID [2018-11-19 00:07:00,858 INFO L273 TraceCheckUtils]: 5: Hoare triple {4907#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; {4907#true} is VALID [2018-11-19 00:07:00,859 INFO L273 TraceCheckUtils]: 6: Hoare triple {4907#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {4909#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:07:00,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {4909#(<= 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; {4910#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:07:00,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {4910#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {4910#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:07:00,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {4910#(and (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0))} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {4911#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} is VALID [2018-11-19 00:07:00,861 INFO L273 TraceCheckUtils]: 10: Hoare triple {4911#(and (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)))} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4912#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} is VALID [2018-11-19 00:07:00,863 INFO L273 TraceCheckUtils]: 11: Hoare triple {4912#(or (= 0 main_~__VERIFIER_assert__cond~1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0))} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:07:00,864 INFO L273 TraceCheckUtils]: 12: Hoare triple {4913#(<= 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; {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:07:00,864 INFO L273 TraceCheckUtils]: 13: Hoare triple {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:07:00,865 INFO L273 TraceCheckUtils]: 14: Hoare triple {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !!(0 == ~main____CPAchecker_TMP_4~0); {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:07:00,866 INFO L273 TraceCheckUtils]: 15: Hoare triple {4913#(<= 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; {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:07:00,870 INFO L273 TraceCheckUtils]: 16: Hoare triple {4913#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {4914#(not (= 0 main_~__VERIFIER_assert__cond~9))} is VALID [2018-11-19 00:07:00,872 INFO L273 TraceCheckUtils]: 17: Hoare triple {4914#(not (= 0 main_~__VERIFIER_assert__cond~9))} assume 0 == ~__VERIFIER_assert__cond~9; {4908#false} is VALID [2018-11-19 00:07:00,873 INFO L273 TraceCheckUtils]: 18: Hoare triple {4908#false} assume !false; {4908#false} is VALID [2018-11-19 00:07:00,874 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-19 00:07:00,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:07:00,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-19 00:07:00,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-19 00:07:00,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:07:00,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-19 00:07:00,901 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-19 00:07:00,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-19 00:07:00,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-19 00:07:00,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-19 00:07:00,902 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-19 00:07:01,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:01,468 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-19 00:07:01,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-19 00:07:01,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-19 00:07:01,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:07:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-19 00:07:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-11-19 00:07:01,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-19 00:07:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-11-19 00:07:01,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2018-11-19 00:07:01,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:01,976 INFO L225 Difference]: With dead ends: 52 [2018-11-19 00:07:01,976 INFO L226 Difference]: Without dead ends: 50 [2018-11-19 00:07:01,977 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-19 00:07:01,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-19 00:07:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-11-19 00:07:02,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:07:02,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 35 states. [2018-11-19 00:07:02,006 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 35 states. [2018-11-19 00:07:02,007 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 35 states. [2018-11-19 00:07:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:02,008 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-19 00:07:02,008 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-19 00:07:02,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:02,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:02,009 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 50 states. [2018-11-19 00:07:02,009 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 50 states. [2018-11-19 00:07:02,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:02,011 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-19 00:07:02,011 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-19 00:07:02,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:02,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:02,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:07:02,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:07:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-19 00:07:02,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-19 00:07:02,012 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2018-11-19 00:07:02,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:07:02,013 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-19 00:07:02,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-19 00:07:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-19 00:07:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-19 00:07:02,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:07:02,014 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-19 00:07:02,014 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:07:02,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:07:02,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2018-11-19 00:07:02,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:07:02,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:07:02,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:02,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:07:02,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:02,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {5132#true} call ULTIMATE.init(); {5132#true} is VALID [2018-11-19 00:07:02,322 INFO L273 TraceCheckUtils]: 1: Hoare triple {5132#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5132#true} is VALID [2018-11-19 00:07:02,322 INFO L273 TraceCheckUtils]: 2: Hoare triple {5132#true} assume true; {5132#true} is VALID [2018-11-19 00:07:02,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5132#true} {5132#true} #171#return; {5132#true} is VALID [2018-11-19 00:07:02,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {5132#true} call #t~ret7 := main(); {5132#true} is VALID [2018-11-19 00:07:02,323 INFO L273 TraceCheckUtils]: 5: Hoare triple {5132#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; {5132#true} is VALID [2018-11-19 00:07:02,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {5132#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5134#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:07:02,328 INFO L273 TraceCheckUtils]: 7: Hoare triple {5134#(<= 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; {5134#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:07:02,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {5134#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {5134#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:07:02,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {5134#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {5135#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:07:02,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {5135#(= main_~__VERIFIER_assert__cond~0 1)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5132#true} is VALID [2018-11-19 00:07:02,329 INFO L273 TraceCheckUtils]: 11: Hoare triple {5132#true} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5132#true} is VALID [2018-11-19 00:07:02,329 INFO L273 TraceCheckUtils]: 12: Hoare triple {5132#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; {5132#true} is VALID [2018-11-19 00:07:02,329 INFO L273 TraceCheckUtils]: 13: Hoare triple {5132#true} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {5132#true} is VALID [2018-11-19 00:07:02,330 INFO L273 TraceCheckUtils]: 14: Hoare triple {5132#true} assume !(0 == ~main____CPAchecker_TMP_4~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; {5136#(or (= 0 main_~__VERIFIER_assert__cond~4) (<= 0 main_~main__t~0))} is VALID [2018-11-19 00:07:02,330 INFO L273 TraceCheckUtils]: 15: Hoare triple {5136#(or (= 0 main_~__VERIFIER_assert__cond~4) (<= 0 main_~main__t~0))} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {5134#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:07:02,331 INFO L273 TraceCheckUtils]: 16: Hoare triple {5134#(<= 0 main_~main__t~0)} assume !(0 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5137#(<= 1 main_~main__t~0)} is VALID [2018-11-19 00:07:02,332 INFO L273 TraceCheckUtils]: 17: Hoare triple {5137#(<= 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; {5138#(not (= 0 main_~__VERIFIER_assert__cond~6))} is VALID [2018-11-19 00:07:02,332 INFO L273 TraceCheckUtils]: 18: Hoare triple {5138#(not (= 0 main_~__VERIFIER_assert__cond~6))} assume 0 == ~__VERIFIER_assert__cond~6; {5133#false} is VALID [2018-11-19 00:07:02,333 INFO L273 TraceCheckUtils]: 19: Hoare triple {5133#false} assume !false; {5133#false} is VALID [2018-11-19 00:07:02,333 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-19 00:07:02,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:07:02,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-19 00:07:02,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-19 00:07:02,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:07:02,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-19 00:07:02,352 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-19 00:07:02,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-19 00:07:02,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-19 00:07:02,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-19 00:07:02,353 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2018-11-19 00:07:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:02,628 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-19 00:07:02,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-19 00:07:02,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-19 00:07:02,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:07:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-19 00:07:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-11-19 00:07:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-19 00:07:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2018-11-19 00:07:02,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2018-11-19 00:07:03,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:03,133 INFO L225 Difference]: With dead ends: 39 [2018-11-19 00:07:03,133 INFO L226 Difference]: Without dead ends: 37 [2018-11-19 00:07:03,134 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-19 00:07:03,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-19 00:07:03,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-19 00:07:03,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:07:03,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 33 states. [2018-11-19 00:07:03,177 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 33 states. [2018-11-19 00:07:03,177 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 33 states. [2018-11-19 00:07:03,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:03,178 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-19 00:07:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-19 00:07:03,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:03,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:03,179 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 37 states. [2018-11-19 00:07:03,179 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 37 states. [2018-11-19 00:07:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:03,180 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-19 00:07:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-19 00:07:03,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:03,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:03,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:07:03,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:07:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-19 00:07:03,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-19 00:07:03,181 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2018-11-19 00:07:03,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:07:03,181 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-19 00:07:03,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-19 00:07:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-19 00:07:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-19 00:07:03,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:07:03,182 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-19 00:07:03,182 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:07:03,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:07:03,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2018-11-19 00:07:03,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:07:03,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:07:03,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:03,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:07:03,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:07:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:07:03,407 INFO L256 TraceCheckUtils]: 0: Hoare triple {5313#true} call ULTIMATE.init(); {5313#true} is VALID [2018-11-19 00:07:03,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {5313#true} ~__return_main~0 := 0;~__tmp_247_0~0 := 0;~__return_305~0 := 0;~__tmp_383_0~0 := 0; {5313#true} is VALID [2018-11-19 00:07:03,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {5313#true} assume true; {5313#true} is VALID [2018-11-19 00:07:03,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5313#true} {5313#true} #171#return; {5313#true} is VALID [2018-11-19 00:07:03,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {5313#true} call #t~ret7 := main(); {5313#true} is VALID [2018-11-19 00:07:03,409 INFO L273 TraceCheckUtils]: 5: Hoare triple {5313#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; {5313#true} is VALID [2018-11-19 00:07:03,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {5313#true} assume ~main__tagbuf_len~0 >= 1;~main__t~0 := 0;~main__tagbuf_len~0 := ~main__tagbuf_len~0 - 1; {5315#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:07:03,412 INFO L273 TraceCheckUtils]: 7: Hoare triple {5315#(<= 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; {5315#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:07:03,413 INFO L273 TraceCheckUtils]: 8: Hoare triple {5315#(<= 0 main_~main__t~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);~__tmp_247_0~0 := ~main____CPAchecker_TMP_0~0; {5315#(<= 0 main_~main__t~0)} is VALID [2018-11-19 00:07:03,414 INFO L273 TraceCheckUtils]: 9: Hoare triple {5315#(<= 0 main_~main__t~0)} ~main____CPAchecker_TMP_0~0 := ~__tmp_247_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; {5316#(= main_~__VERIFIER_assert__cond~0 1)} is VALID [2018-11-19 00:07:03,414 INFO L273 TraceCheckUtils]: 10: Hoare triple {5316#(= main_~__VERIFIER_assert__cond~0 1)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5313#true} is VALID [2018-11-19 00:07:03,414 INFO L273 TraceCheckUtils]: 11: Hoare triple {5313#true} assume !(0 == ~__VERIFIER_assert__cond~1);~main____CPAchecker_TMP_2~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5313#true} is VALID [2018-11-19 00:07:03,414 INFO L273 TraceCheckUtils]: 12: Hoare triple {5313#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; {5313#true} is VALID [2018-11-19 00:07:03,414 INFO L273 TraceCheckUtils]: 13: Hoare triple {5313#true} assume !(0 == ~main____CPAchecker_TMP_3~0);havoc ~main____CPAchecker_TMP_4~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_4~0 := #t~nondet4;havoc #t~nondet4; {5313#true} is VALID [2018-11-19 00:07:03,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {5313#true} assume !(0 == ~main____CPAchecker_TMP_4~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; {5313#true} is VALID [2018-11-19 00:07:03,415 INFO L273 TraceCheckUtils]: 15: Hoare triple {5313#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {5313#true} is VALID [2018-11-19 00:07:03,415 INFO L273 TraceCheckUtils]: 16: Hoare triple {5313#true} assume !(0 == ~__VERIFIER_assert__cond~5);~main____CPAchecker_TMP_5~0 := ~main__t~0;~main__t~0 := 1 + ~main__t~0; {5313#true} is VALID [2018-11-19 00:07:03,415 INFO L273 TraceCheckUtils]: 17: Hoare triple {5313#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; {5317#(<= main_~main__t~0 main_~main__tagbuf_len~0)} is VALID [2018-11-19 00:07:03,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {5317#(<= main_~main__t~0 main_~main__tagbuf_len~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~main__t~0 <= ~main__tagbuf_len~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5318#(not (= 0 main_~__VERIFIER_assert__cond~7))} is VALID [2018-11-19 00:07:03,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {5318#(not (= 0 main_~__VERIFIER_assert__cond~7))} assume 0 == ~__VERIFIER_assert__cond~7; {5314#false} is VALID [2018-11-19 00:07:03,416 INFO L273 TraceCheckUtils]: 20: Hoare triple {5314#false} assume !false; {5314#false} is VALID [2018-11-19 00:07:03,417 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-19 00:07:03,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:07:03,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-19 00:07:03,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-19 00:07:03,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:07:03,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-19 00:07:03,438 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-19 00:07:03,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-19 00:07:03,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-19 00:07:03,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-19 00:07:03,439 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2018-11-19 00:07:03,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:03,761 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-19 00:07:03,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-19 00:07:03,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-19 00:07:03,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:07:03,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:07:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2018-11-19 00:07:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-19 00:07:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2018-11-19 00:07:03,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2018-11-19 00:07:03,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:07:03,802 INFO L225 Difference]: With dead ends: 37 [2018-11-19 00:07:03,802 INFO L226 Difference]: Without dead ends: 0 [2018-11-19 00:07:03,803 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-19 00:07:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-19 00:07:03,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-19 00:07:03,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:07:03,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:03,804 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:03,804 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:03,804 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-19 00:07:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 00:07:03,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:03,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:03,804 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:03,804 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-19 00:07:03,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:07:03,805 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-19 00:07:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 00:07:03,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:03,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:07:03,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:07:03,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:07:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-19 00:07:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-19 00:07:03,806 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-19 00:07:03,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:07:03,806 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-19 00:07:03,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-19 00:07:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-19 00:07:03,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:07:03,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-19 00:07:03,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:03,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:03,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-19 00:07:04,258 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-19 00:07:04,259 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-19 00:07:04,259 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-19 00:07:04,259 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-19 00:07:04,259 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-19 00:07:04,259 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-19 00:07:04,259 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-19 00:07:04,259 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2018-11-19 00:07:04,259 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2018-11-19 00:07:04,259 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-19 00:07:04,260 INFO L425 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-19 00:07:04,260 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2018-11-19 00:07:04,260 INFO L425 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2018-11-19 00:07:04,260 INFO L425 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-19 00:07:04,260 INFO L425 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2018-11-19 00:07:04,260 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2018-11-19 00:07:04,260 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2018-11-19 00:07:04,260 INFO L425 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2018-11-19 00:07:04,260 INFO L425 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2018-11-19 00:07:04,260 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2018-11-19 00:07:04,260 INFO L425 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2018-11-19 00:07:04,260 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2018-11-19 00:07:04,261 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2018-11-19 00:07:04,261 INFO L425 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-11-19 00:07:04,261 INFO L425 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2018-11-19 00:07:04,261 INFO L425 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2018-11-19 00:07:04,261 INFO L428 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2018-11-19 00:07:04,261 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2018-11-19 00:07:04,261 INFO L425 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2018-11-19 00:07:04,261 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2018-11-19 00:07:04,261 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-11-19 00:07:04,261 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2018-11-19 00:07:04,261 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2018-11-19 00:07:04,261 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2018-11-19 00:07:04,262 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2018-11-19 00:07:04,262 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2018-11-19 00:07:04,262 INFO L421 ceAbstractionStarter]: At program point L352(lines 278 359) 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-19 00:07:04,262 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: true [2018-11-19 00:07:04,262 INFO L425 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2018-11-19 00:07:04,262 INFO L425 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2018-11-19 00:07:04,262 INFO L421 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (= 1 main_~__VERIFIER_assert__cond~0) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (not (= 0 main_~__VERIFIER_assert__cond~1)) (<= 1 main_~main__t~0)) [2018-11-19 00:07:04,263 INFO L425 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-19 00:07:04,263 INFO L425 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2018-11-19 00:07:04,263 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-19 00:07:04,263 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-19 00:07:04,263 INFO L425 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2018-11-19 00:07:04,263 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2018-11-19 00:07:04,263 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2018-11-19 00:07:04,263 INFO L425 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2018-11-19 00:07:04,263 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2018-11-19 00:07:04,264 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-19 00:07:04,264 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2018-11-19 00:07:04,264 INFO L425 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2018-11-19 00:07:04,264 INFO L425 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2018-11-19 00:07:04,264 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2018-11-19 00:07:04,264 INFO L425 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-11-19 00:07:04,264 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2018-11-19 00:07:04,264 INFO L425 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2018-11-19 00:07:04,265 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2018-11-19 00:07:04,265 INFO L425 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-19 00:07:04,265 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2018-11-19 00:07:04,265 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2018-11-19 00:07:04,265 INFO L425 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2018-11-19 00:07:04,265 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2018-11-19 00:07:04,265 INFO L425 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2018-11-19 00:07:04,265 INFO L425 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-11-19 00:07:04,266 INFO L425 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2018-11-19 00:07:04,266 INFO L421 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2018-11-19 00:07:04,266 INFO L421 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~__VERIFIER_assert__cond~1)) (<= 1 main_~main__t~0)) [2018-11-19 00:07:04,266 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-19 00:07:04,266 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-19 00:07:04,266 INFO L425 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-11-19 00:07:04,266 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2018-11-19 00:07:04,267 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2018-11-19 00:07:04,267 INFO L425 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-11-19 00:07:04,267 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2018-11-19 00:07:04,269 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-19 00:07:04,269 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-19 00:07:04,269 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-19 00:07:04,269 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-19 00:07:04,269 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-19 00:07:04,269 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-19 00:07:04,270 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-19 00:07:04,270 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-19 00:07:04,270 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-19 00:07:04,270 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-19 00:07:04,270 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-19 00:07:04,270 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-19 00:07:04,270 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-19 00:07:04,270 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-19 00:07:04,270 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-19 00:07:04,270 WARN L170 areAnnotationChecker]: L261 has no Hoare annotation [2018-11-19 00:07:04,271 WARN L170 areAnnotationChecker]: L261 has no Hoare annotation [2018-11-19 00:07:04,271 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-19 00:07:04,271 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-19 00:07:04,271 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2018-11-19 00:07:04,271 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2018-11-19 00:07:04,271 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-11-19 00:07:04,271 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-11-19 00:07:04,271 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-19 00:07:04,272 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-19 00:07:04,272 WARN L170 areAnnotationChecker]: L274 has no Hoare annotation [2018-11-19 00:07:04,272 WARN L170 areAnnotationChecker]: L274 has no Hoare annotation [2018-11-19 00:07:04,272 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2018-11-19 00:07:04,272 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2018-11-19 00:07:04,272 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2018-11-19 00:07:04,272 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-19 00:07:04,272 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2018-11-19 00:07:04,272 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2018-11-19 00:07:04,273 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2018-11-19 00:07:04,273 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-19 00:07:04,273 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-11-19 00:07:04,273 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2018-11-19 00:07:04,273 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2018-11-19 00:07:04,273 WARN L170 areAnnotationChecker]: L291 has no Hoare annotation [2018-11-19 00:07:04,273 WARN L170 areAnnotationChecker]: L291 has no Hoare annotation [2018-11-19 00:07:04,273 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2018-11-19 00:07:04,273 WARN L170 areAnnotationChecker]: L320 has no Hoare annotation [2018-11-19 00:07:04,274 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2018-11-19 00:07:04,274 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2018-11-19 00:07:04,274 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-19 00:07:04,274 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2018-11-19 00:07:04,274 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2018-11-19 00:07:04,274 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2018-11-19 00:07:04,274 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2018-11-19 00:07:04,274 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2018-11-19 00:07:04,274 WARN L170 areAnnotationChecker]: L293 has no Hoare annotation [2018-11-19 00:07:04,274 WARN L170 areAnnotationChecker]: L293 has no Hoare annotation [2018-11-19 00:07:04,275 WARN L170 areAnnotationChecker]: L303 has no Hoare annotation [2018-11-19 00:07:04,275 WARN L170 areAnnotationChecker]: L303 has no Hoare annotation [2018-11-19 00:07:04,275 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2018-11-19 00:07:04,275 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2018-11-19 00:07:04,275 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2018-11-19 00:07:04,275 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2018-11-19 00:07:04,275 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-19 00:07:04,275 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2018-11-19 00:07:04,275 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2018-11-19 00:07:04,276 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-19 00:07:04,276 WARN L170 areAnnotationChecker]: L218 has no Hoare annotation [2018-11-19 00:07:04,276 WARN L170 areAnnotationChecker]: L218 has no Hoare annotation [2018-11-19 00:07:04,276 WARN L170 areAnnotationChecker]: L305 has no Hoare annotation [2018-11-19 00:07:04,276 WARN L170 areAnnotationChecker]: L305 has no Hoare annotation [2018-11-19 00:07:04,276 WARN L170 areAnnotationChecker]: L334 has no Hoare annotation [2018-11-19 00:07:04,276 WARN L170 areAnnotationChecker]: L334 has no Hoare annotation [2018-11-19 00:07:04,276 WARN L170 areAnnotationChecker]: L344 has no Hoare annotation [2018-11-19 00:07:04,276 WARN L170 areAnnotationChecker]: L344 has no Hoare annotation [2018-11-19 00:07:04,277 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2018-11-19 00:07:04,277 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2018-11-19 00:07:04,277 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2018-11-19 00:07:04,277 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2018-11-19 00:07:04,277 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-19 00:07:04,277 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2018-11-19 00:07:04,277 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2018-11-19 00:07:04,277 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2018-11-19 00:07:04,277 WARN L170 areAnnotationChecker]: L230 has no Hoare annotation [2018-11-19 00:07:04,278 WARN L170 areAnnotationChecker]: L230 has no Hoare annotation [2018-11-19 00:07:04,278 WARN L170 areAnnotationChecker]: L346 has no Hoare annotation [2018-11-19 00:07:04,278 WARN L170 areAnnotationChecker]: L346 has no Hoare annotation [2018-11-19 00:07:04,278 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2018-11-19 00:07:04,278 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2018-11-19 00:07:04,278 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2018-11-19 00:07:04,278 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2018-11-19 00:07:04,278 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2018-11-19 00:07:04,278 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2018-11-19 00:07:04,279 WARN L170 areAnnotationChecker]: L182 has no Hoare annotation [2018-11-19 00:07:04,279 WARN L170 areAnnotationChecker]: L182 has no Hoare annotation [2018-11-19 00:07:04,279 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2018-11-19 00:07:04,279 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2018-11-19 00:07:04,279 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-19 00:07:04,279 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2018-11-19 00:07:04,279 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2018-11-19 00:07:04,279 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2018-11-19 00:07:04,279 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2018-11-19 00:07:04,279 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2018-11-19 00:07:04,279 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2018-11-19 00:07:04,280 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2018-11-19 00:07:04,280 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2018-11-19 00:07:04,280 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2018-11-19 00:07:04,280 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-19 00:07:04,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:07:04 BoogieIcfgContainer [2018-11-19 00:07:04,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-19 00:07:04,294 INFO L168 Benchmark]: Toolchain (without parser) took 23360.63 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -455.9 MB). Peak memory consumption was 563.3 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:04,295 INFO L168 Benchmark]: CDTParser took 0.19 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-19 00:07:04,296 INFO L168 Benchmark]: CACSL2BoogieTranslator took 442.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:04,297 INFO L168 Benchmark]: Boogie Preprocessor took 69.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-19 00:07:04,297 INFO L168 Benchmark]: RCFGBuilder took 1306.80 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.8 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:04,298 INFO L168 Benchmark]: TraceAbstraction took 21535.72 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 264.2 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 309.3 MB). Peak memory consumption was 573.5 MB. Max. memory is 7.1 GB. [2018-11-19 00:07:04,302 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.19 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 442.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.89 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1306.80 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -775.8 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21535.72 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 264.2 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 309.3 MB). Peak memory consumption was 573.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__t - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((1 == __VERIFIER_assert__cond && main__t + 1 <= main__tagbuf_len) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__t - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((!(0 == __VERIFIER_assert__cond) && main__t + 1 <= main__tagbuf_len) && __VERIFIER_assert__cond == 1) && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 17 error locations. SAFE Result, 21.4s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 14.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 827 SDtfs, 2052 SDslu, 1390 SDs, 0 SdLazy, 1543 SolverSat, 226 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred 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.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 318 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 64 HoareAnnotationTreeSize, 9 FomulaSimplifications, 282676 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 222 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 11607 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...