java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/real-life/s3_clnt_1_Safe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:11:13,199 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:11:13,202 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:11:13,219 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:11:13,219 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:11:13,221 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:11:13,226 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:11:13,228 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:11:13,231 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:11:13,232 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:11:13,232 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:11:13,234 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:11:13,235 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:11:13,237 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:11:13,244 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:11:13,245 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:11:13,249 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:11:13,251 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:11:13,256 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:11:13,261 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:11:13,262 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:11:13,265 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:11:13,272 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:11:13,272 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:11:13,274 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:11:13,276 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:11:13,277 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:11:13,277 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:11:13,281 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:11:13,286 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:11:13,286 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:11:13,287 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:11:13,287 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:11:13,287 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:11:13,290 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:11:13,291 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:11:13,291 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:11:13,311 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:11:13,311 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:11:13,312 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:11:13,312 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:11:13,312 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:11:13,313 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:11:13,313 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:11:13,313 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:11:13,313 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:11:13,313 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:11:13,314 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:11:13,314 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:11:13,314 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:11:13,314 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:11:13,315 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:11:13,315 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:11:13,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:11:13,316 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:11:13,316 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:11:13,316 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:11:13,316 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:11:13,317 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:11:13,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:11:13,317 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:11:13,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:11:13,317 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:11:13,318 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:11:13,318 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:11:13,318 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:11:13,318 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:11:13,319 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:11:13,319 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:11:13,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:11:13,319 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:11:13,319 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:11:13,320 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:11:13,320 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:11:13,320 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:11:13,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:11:13,320 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:11:13,321 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:11:13,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:11:13,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:11:13,376 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:11:13,377 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:11:13,378 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:11:13,378 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/s3_clnt_1_Safe.bpl [2018-12-03 16:11:13,379 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/s3_clnt_1_Safe.bpl' [2018-12-03 16:11:13,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:11:13,470 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:11:13,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:13,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:11:13,471 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:11:13,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:13" (1/1) ... [2018-12-03 16:11:13,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:13" (1/1) ... [2018-12-03 16:11:13,516 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:11:13,516 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:11:13,516 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:11:13,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:11:13,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:11:13,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:11:13,520 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:11:13,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:13" (1/1) ... [2018-12-03 16:11:13,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:13" (1/1) ... [2018-12-03 16:11:13,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:13" (1/1) ... [2018-12-03 16:11:13,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:13" (1/1) ... [2018-12-03 16:11:13,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:13" (1/1) ... [2018-12-03 16:11:13,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:13" (1/1) ... [2018-12-03 16:11:13,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:13" (1/1) ... [2018-12-03 16:11:13,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:11:13,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:11:13,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:11:13,605 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:11:13,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:13" (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-12-03 16:11:13,691 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-12-03 16:11:13,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-12-03 16:11:13,878 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-03 16:11:13,878 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 16:11:14,764 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:11:14,764 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:11:14,765 INFO L202 PluginConnector]: Adding new model s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:11:14 BoogieIcfgContainer [2018-12-03 16:11:14,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:11:14,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:11:14,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:11:14,770 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:11:14,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:11:13" (1/2) ... [2018-12-03 16:11:14,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26e1cd00 and model type s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:11:14, skipping insertion in model container [2018-12-03 16:11:14,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:11:14" (2/2) ... [2018-12-03 16:11:14,774 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1_Safe.bpl [2018-12-03 16:11:14,783 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:11:14,791 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:11:14,809 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:11:14,850 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:11:14,850 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:11:14,850 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:11:14,850 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:11:14,851 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:11:14,851 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:11:14,851 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:11:14,851 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:11:14,872 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2018-12-03 16:11:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:11:14,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:14,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:14,885 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:14,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:14,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2145417534, now seen corresponding path program 1 times [2018-12-03 16:11:14,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:14,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:14,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:14,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:14,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:15,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:15,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:11:15,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:15,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:15,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:15,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:15,128 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2018-12-03 16:11:15,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:15,307 INFO L93 Difference]: Finished difference Result 360 states and 618 transitions. [2018-12-03 16:11:15,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:15,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-03 16:11:15,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:15,328 INFO L225 Difference]: With dead ends: 360 [2018-12-03 16:11:15,328 INFO L226 Difference]: Without dead ends: 212 [2018-12-03 16:11:15,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-03 16:11:15,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-12-03 16:11:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-03 16:11:15,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 318 transitions. [2018-12-03 16:11:15,403 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 318 transitions. Word has length 23 [2018-12-03 16:11:15,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:15,407 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 318 transitions. [2018-12-03 16:11:15,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 318 transitions. [2018-12-03 16:11:15,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 16:11:15,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:15,414 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:15,417 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:15,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:15,417 INFO L82 PathProgramCache]: Analyzing trace with hash 274004071, now seen corresponding path program 1 times [2018-12-03 16:11:15,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:15,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:15,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:15,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:15,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:11:15,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:15,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:15,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:15,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:15,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:15,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:15,495 INFO L87 Difference]: Start difference. First operand 212 states and 318 transitions. Second operand 3 states. [2018-12-03 16:11:16,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:16,018 INFO L93 Difference]: Finished difference Result 460 states and 697 transitions. [2018-12-03 16:11:16,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:16,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-03 16:11:16,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:16,026 INFO L225 Difference]: With dead ends: 460 [2018-12-03 16:11:16,026 INFO L226 Difference]: Without dead ends: 254 [2018-12-03 16:11:16,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:16,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-03 16:11:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 246. [2018-12-03 16:11:16,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-12-03 16:11:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 362 transitions. [2018-12-03 16:11:16,062 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 362 transitions. Word has length 37 [2018-12-03 16:11:16,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:16,065 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 362 transitions. [2018-12-03 16:11:16,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 362 transitions. [2018-12-03 16:11:16,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:11:16,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:16,068 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:16,069 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:16,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:16,069 INFO L82 PathProgramCache]: Analyzing trace with hash -692738413, now seen corresponding path program 1 times [2018-12-03 16:11:16,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:16,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:16,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:16,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:16,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 16:11:16,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:16,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:16,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:16,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:16,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:16,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:16,189 INFO L87 Difference]: Start difference. First operand 246 states and 362 transitions. Second operand 3 states. [2018-12-03 16:11:16,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:16,914 INFO L93 Difference]: Finished difference Result 588 states and 892 transitions. [2018-12-03 16:11:16,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:16,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 16:11:16,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:16,918 INFO L225 Difference]: With dead ends: 588 [2018-12-03 16:11:16,919 INFO L226 Difference]: Without dead ends: 346 [2018-12-03 16:11:16,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:16,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-12-03 16:11:16,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 328. [2018-12-03 16:11:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-12-03 16:11:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 462 transitions. [2018-12-03 16:11:16,941 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 462 transitions. Word has length 54 [2018-12-03 16:11:16,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:16,941 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 462 transitions. [2018-12-03 16:11:16,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:16,942 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 462 transitions. [2018-12-03 16:11:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:11:16,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:16,945 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:16,945 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:16,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:16,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1796790549, now seen corresponding path program 1 times [2018-12-03 16:11:16,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:16,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:16,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:16,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:16,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:17,012 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 16:11:17,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:17,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:17,013 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:17,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:17,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:17,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:17,014 INFO L87 Difference]: Start difference. First operand 328 states and 462 transitions. Second operand 3 states. [2018-12-03 16:11:17,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:17,314 INFO L93 Difference]: Finished difference Result 696 states and 993 transitions. [2018-12-03 16:11:17,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:17,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 16:11:17,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:17,318 INFO L225 Difference]: With dead ends: 696 [2018-12-03 16:11:17,318 INFO L226 Difference]: Without dead ends: 374 [2018-12-03 16:11:17,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-12-03 16:11:17,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 366. [2018-12-03 16:11:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-12-03 16:11:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 510 transitions. [2018-12-03 16:11:17,335 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 510 transitions. Word has length 54 [2018-12-03 16:11:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:17,336 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 510 transitions. [2018-12-03 16:11:17,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 510 transitions. [2018-12-03 16:11:17,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 16:11:17,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:17,339 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:17,340 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:17,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:17,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2132111413, now seen corresponding path program 1 times [2018-12-03 16:11:17,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:17,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:17,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:17,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:17,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 16:11:17,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:17,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:17,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:17,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:17,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:17,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:17,424 INFO L87 Difference]: Start difference. First operand 366 states and 510 transitions. Second operand 3 states. [2018-12-03 16:11:17,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:17,998 INFO L93 Difference]: Finished difference Result 832 states and 1194 transitions. [2018-12-03 16:11:18,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:18,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-03 16:11:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:18,005 INFO L225 Difference]: With dead ends: 832 [2018-12-03 16:11:18,006 INFO L226 Difference]: Without dead ends: 470 [2018-12-03 16:11:18,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:18,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-12-03 16:11:18,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 444. [2018-12-03 16:11:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-12-03 16:11:18,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 644 transitions. [2018-12-03 16:11:18,024 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 644 transitions. Word has length 67 [2018-12-03 16:11:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:18,024 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 644 transitions. [2018-12-03 16:11:18,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:18,025 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 644 transitions. [2018-12-03 16:11:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 16:11:18,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:18,027 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:18,027 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:18,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:18,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1973488661, now seen corresponding path program 1 times [2018-12-03 16:11:18,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:18,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:18,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:18,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:18,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 16:11:18,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:18,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:18,128 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:18,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:18,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:18,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:18,129 INFO L87 Difference]: Start difference. First operand 444 states and 644 transitions. Second operand 3 states. [2018-12-03 16:11:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:18,320 INFO L93 Difference]: Finished difference Result 930 states and 1355 transitions. [2018-12-03 16:11:18,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:18,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-03 16:11:18,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:18,332 INFO L225 Difference]: With dead ends: 930 [2018-12-03 16:11:18,332 INFO L226 Difference]: Without dead ends: 492 [2018-12-03 16:11:18,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-12-03 16:11:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 486. [2018-12-03 16:11:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-12-03 16:11:18,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 696 transitions. [2018-12-03 16:11:18,355 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 696 transitions. Word has length 70 [2018-12-03 16:11:18,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:18,355 INFO L480 AbstractCegarLoop]: Abstraction has 486 states and 696 transitions. [2018-12-03 16:11:18,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:18,356 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 696 transitions. [2018-12-03 16:11:18,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 16:11:18,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:18,359 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:18,359 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:18,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:18,360 INFO L82 PathProgramCache]: Analyzing trace with hash -158451037, now seen corresponding path program 1 times [2018-12-03 16:11:18,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:18,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:18,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:18,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:18,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 16:11:18,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:18,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:18,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:18,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:18,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:18,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:18,494 INFO L87 Difference]: Start difference. First operand 486 states and 696 transitions. Second operand 3 states. [2018-12-03 16:11:18,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:18,820 INFO L93 Difference]: Finished difference Result 966 states and 1387 transitions. [2018-12-03 16:11:18,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:18,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-12-03 16:11:18,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:18,835 INFO L225 Difference]: With dead ends: 966 [2018-12-03 16:11:18,835 INFO L226 Difference]: Without dead ends: 725 [2018-12-03 16:11:18,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-12-03 16:11:18,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2018-12-03 16:11:18,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-12-03 16:11:18,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1038 transitions. [2018-12-03 16:11:18,863 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1038 transitions. Word has length 90 [2018-12-03 16:11:18,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:18,863 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 1038 transitions. [2018-12-03 16:11:18,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:18,863 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1038 transitions. [2018-12-03 16:11:18,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 16:11:18,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:18,866 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:18,866 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:18,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:18,867 INFO L82 PathProgramCache]: Analyzing trace with hash 2082554637, now seen corresponding path program 1 times [2018-12-03 16:11:18,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:18,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:18,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:18,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:18,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-03 16:11:18,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:18,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:18,967 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:18,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:18,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:18,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:18,969 INFO L87 Difference]: Start difference. First operand 725 states and 1038 transitions. Second operand 3 states. [2018-12-03 16:11:19,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:19,330 INFO L93 Difference]: Finished difference Result 966 states and 1384 transitions. [2018-12-03 16:11:19,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:19,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2018-12-03 16:11:19,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:19,336 INFO L225 Difference]: With dead ends: 966 [2018-12-03 16:11:19,336 INFO L226 Difference]: Without dead ends: 964 [2018-12-03 16:11:19,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2018-12-03 16:11:19,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2018-12-03 16:11:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2018-12-03 16:11:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1382 transitions. [2018-12-03 16:11:19,367 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1382 transitions. Word has length 92 [2018-12-03 16:11:19,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:19,368 INFO L480 AbstractCegarLoop]: Abstraction has 964 states and 1382 transitions. [2018-12-03 16:11:19,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:19,368 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1382 transitions. [2018-12-03 16:11:19,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 16:11:19,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:19,371 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:19,371 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:19,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:19,371 INFO L82 PathProgramCache]: Analyzing trace with hash 132799196, now seen corresponding path program 1 times [2018-12-03 16:11:19,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:19,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:19,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:19,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:19,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-12-03 16:11:19,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:19,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:19,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:19,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:19,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:19,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:19,477 INFO L87 Difference]: Start difference. First operand 964 states and 1382 transitions. Second operand 3 states. [2018-12-03 16:11:19,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:19,982 INFO L93 Difference]: Finished difference Result 2028 states and 2924 transitions. [2018-12-03 16:11:19,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:19,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-12-03 16:11:19,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:19,994 INFO L225 Difference]: With dead ends: 2028 [2018-12-03 16:11:19,994 INFO L226 Difference]: Without dead ends: 1070 [2018-12-03 16:11:19,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:19,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2018-12-03 16:11:20,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1056. [2018-12-03 16:11:20,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2018-12-03 16:11:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1494 transitions. [2018-12-03 16:11:20,031 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1494 transitions. Word has length 117 [2018-12-03 16:11:20,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:20,032 INFO L480 AbstractCegarLoop]: Abstraction has 1056 states and 1494 transitions. [2018-12-03 16:11:20,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1494 transitions. [2018-12-03 16:11:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 16:11:20,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:20,036 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:20,036 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:20,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:20,037 INFO L82 PathProgramCache]: Analyzing trace with hash 572416543, now seen corresponding path program 1 times [2018-12-03 16:11:20,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:20,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:20,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:20,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:20,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:20,169 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-03 16:11:20,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:20,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:20,170 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:20,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:20,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:20,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:20,171 INFO L87 Difference]: Start difference. First operand 1056 states and 1494 transitions. Second operand 3 states. [2018-12-03 16:11:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:22,051 INFO L93 Difference]: Finished difference Result 2310 states and 3318 transitions. [2018-12-03 16:11:22,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:22,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-12-03 16:11:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:22,059 INFO L225 Difference]: With dead ends: 2310 [2018-12-03 16:11:22,059 INFO L226 Difference]: Without dead ends: 1252 [2018-12-03 16:11:22,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-12-03 16:11:22,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1212. [2018-12-03 16:11:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1212 states. [2018-12-03 16:11:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1718 transitions. [2018-12-03 16:11:22,100 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1718 transitions. Word has length 138 [2018-12-03 16:11:22,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:22,101 INFO L480 AbstractCegarLoop]: Abstraction has 1212 states and 1718 transitions. [2018-12-03 16:11:22,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1718 transitions. [2018-12-03 16:11:22,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 16:11:22,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:22,107 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:22,107 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:22,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:22,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1049212336, now seen corresponding path program 1 times [2018-12-03 16:11:22,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:22,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:22,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:22,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:22,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-03 16:11:22,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:22,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:22,304 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:22,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:22,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:22,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:22,306 INFO L87 Difference]: Start difference. First operand 1212 states and 1718 transitions. Second operand 3 states. [2018-12-03 16:11:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:22,950 INFO L93 Difference]: Finished difference Result 2538 states and 3570 transitions. [2018-12-03 16:11:22,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:22,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-12-03 16:11:22,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:22,957 INFO L225 Difference]: With dead ends: 2538 [2018-12-03 16:11:22,957 INFO L226 Difference]: Without dead ends: 1332 [2018-12-03 16:11:22,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:22,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2018-12-03 16:11:22,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1324. [2018-12-03 16:11:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2018-12-03 16:11:22,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1850 transitions. [2018-12-03 16:11:22,997 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1850 transitions. Word has length 174 [2018-12-03 16:11:22,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:22,997 INFO L480 AbstractCegarLoop]: Abstraction has 1324 states and 1850 transitions. [2018-12-03 16:11:22,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:22,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1850 transitions. [2018-12-03 16:11:23,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 16:11:23,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:23,002 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:23,002 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:23,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:23,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1609912114, now seen corresponding path program 1 times [2018-12-03 16:11:23,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:23,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:23,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:23,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:23,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-03 16:11:23,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:23,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:23,134 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:23,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:23,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:23,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:23,135 INFO L87 Difference]: Start difference. First operand 1324 states and 1850 transitions. Second operand 3 states. [2018-12-03 16:11:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:24,406 INFO L93 Difference]: Finished difference Result 2778 states and 3870 transitions. [2018-12-03 16:11:24,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:24,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2018-12-03 16:11:24,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:24,415 INFO L225 Difference]: With dead ends: 2778 [2018-12-03 16:11:24,415 INFO L226 Difference]: Without dead ends: 1460 [2018-12-03 16:11:24,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:24,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2018-12-03 16:11:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1448. [2018-12-03 16:11:24,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2018-12-03 16:11:24,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1994 transitions. [2018-12-03 16:11:24,450 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1994 transitions. Word has length 174 [2018-12-03 16:11:24,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:24,450 INFO L480 AbstractCegarLoop]: Abstraction has 1448 states and 1994 transitions. [2018-12-03 16:11:24,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1994 transitions. [2018-12-03 16:11:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-03 16:11:24,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:24,455 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:24,455 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:24,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:24,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1003197838, now seen corresponding path program 1 times [2018-12-03 16:11:24,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:24,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:24,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:24,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:24,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:24,552 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2018-12-03 16:11:24,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:24,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:24,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:24,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:24,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:24,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:24,554 INFO L87 Difference]: Start difference. First operand 1448 states and 1994 transitions. Second operand 3 states. [2018-12-03 16:11:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:24,767 INFO L93 Difference]: Finished difference Result 3042 states and 4186 transitions. [2018-12-03 16:11:24,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:24,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-12-03 16:11:24,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:24,777 INFO L225 Difference]: With dead ends: 3042 [2018-12-03 16:11:24,777 INFO L226 Difference]: Without dead ends: 1600 [2018-12-03 16:11:24,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:24,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2018-12-03 16:11:24,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1592. [2018-12-03 16:11:24,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1592 states. [2018-12-03 16:11:24,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2158 transitions. [2018-12-03 16:11:24,817 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2158 transitions. Word has length 204 [2018-12-03 16:11:24,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:24,817 INFO L480 AbstractCegarLoop]: Abstraction has 1592 states and 2158 transitions. [2018-12-03 16:11:24,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:24,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2158 transitions. [2018-12-03 16:11:24,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-03 16:11:24,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:24,822 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:24,823 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:24,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:24,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1563897616, now seen corresponding path program 1 times [2018-12-03 16:11:24,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:24,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:24,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:24,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:24,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2018-12-03 16:11:24,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:24,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:24,943 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:24,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:24,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:24,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:24,944 INFO L87 Difference]: Start difference. First operand 1592 states and 2158 transitions. Second operand 3 states. [2018-12-03 16:11:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:25,063 INFO L93 Difference]: Finished difference Result 4644 states and 6314 transitions. [2018-12-03 16:11:25,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:25,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2018-12-03 16:11:25,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:25,077 INFO L225 Difference]: With dead ends: 4644 [2018-12-03 16:11:25,077 INFO L226 Difference]: Without dead ends: 3058 [2018-12-03 16:11:25,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2018-12-03 16:11:25,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 3056. [2018-12-03 16:11:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3056 states. [2018-12-03 16:11:25,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3056 states to 3056 states and 4157 transitions. [2018-12-03 16:11:25,151 INFO L78 Accepts]: Start accepts. Automaton has 3056 states and 4157 transitions. Word has length 204 [2018-12-03 16:11:25,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:25,152 INFO L480 AbstractCegarLoop]: Abstraction has 3056 states and 4157 transitions. [2018-12-03 16:11:25,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:25,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3056 states and 4157 transitions. [2018-12-03 16:11:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-12-03 16:11:25,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:25,159 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:25,160 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:25,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:25,160 INFO L82 PathProgramCache]: Analyzing trace with hash -645309798, now seen corresponding path program 1 times [2018-12-03 16:11:25,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:25,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:25,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:25,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:25,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-03 16:11:25,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:25,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:25,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:25,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:25,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:25,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:25,284 INFO L87 Difference]: Start difference. First operand 3056 states and 4157 transitions. Second operand 3 states. [2018-12-03 16:11:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:26,235 INFO L93 Difference]: Finished difference Result 6254 states and 8500 transitions. [2018-12-03 16:11:26,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:26,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2018-12-03 16:11:26,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:26,250 INFO L225 Difference]: With dead ends: 6254 [2018-12-03 16:11:26,251 INFO L226 Difference]: Without dead ends: 3204 [2018-12-03 16:11:26,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2018-12-03 16:11:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 3188. [2018-12-03 16:11:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2018-12-03 16:11:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 4309 transitions. [2018-12-03 16:11:26,334 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 4309 transitions. Word has length 228 [2018-12-03 16:11:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:26,335 INFO L480 AbstractCegarLoop]: Abstraction has 3188 states and 4309 transitions. [2018-12-03 16:11:26,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 4309 transitions. [2018-12-03 16:11:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-12-03 16:11:26,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:26,343 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:26,343 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:26,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:26,343 INFO L82 PathProgramCache]: Analyzing trace with hash 354451398, now seen corresponding path program 1 times [2018-12-03 16:11:26,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:26,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:26,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:26,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:26,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:26,539 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-12-03 16:11:26,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:26,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:26,540 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:26,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:26,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:26,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:26,544 INFO L87 Difference]: Start difference. First operand 3188 states and 4309 transitions. Second operand 3 states. [2018-12-03 16:11:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:27,441 INFO L93 Difference]: Finished difference Result 6770 states and 9280 transitions. [2018-12-03 16:11:27,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:27,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2018-12-03 16:11:27,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:27,461 INFO L225 Difference]: With dead ends: 6770 [2018-12-03 16:11:27,461 INFO L226 Difference]: Without dead ends: 3588 [2018-12-03 16:11:27,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3588 states. [2018-12-03 16:11:27,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3588 to 3500. [2018-12-03 16:11:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3500 states. [2018-12-03 16:11:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 3500 states and 4677 transitions. [2018-12-03 16:11:27,539 INFO L78 Accepts]: Start accepts. Automaton has 3500 states and 4677 transitions. Word has length 239 [2018-12-03 16:11:27,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:27,540 INFO L480 AbstractCegarLoop]: Abstraction has 3500 states and 4677 transitions. [2018-12-03 16:11:27,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:27,540 INFO L276 IsEmpty]: Start isEmpty. Operand 3500 states and 4677 transitions. [2018-12-03 16:11:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-12-03 16:11:27,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:27,549 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:27,549 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:27,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:27,550 INFO L82 PathProgramCache]: Analyzing trace with hash -230629078, now seen corresponding path program 1 times [2018-12-03 16:11:27,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:27,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:27,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:27,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:27,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-12-03 16:11:27,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:27,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:27,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:27,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:27,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:27,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:27,692 INFO L87 Difference]: Start difference. First operand 3500 states and 4677 transitions. Second operand 3 states. [2018-12-03 16:11:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:28,080 INFO L93 Difference]: Finished difference Result 7402 states and 9824 transitions. [2018-12-03 16:11:28,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:28,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2018-12-03 16:11:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:28,103 INFO L225 Difference]: With dead ends: 7402 [2018-12-03 16:11:28,103 INFO L226 Difference]: Without dead ends: 3908 [2018-12-03 16:11:28,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:28,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3908 states. [2018-12-03 16:11:28,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3908 to 3620. [2018-12-03 16:11:28,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3620 states. [2018-12-03 16:11:28,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 3620 states and 4821 transitions. [2018-12-03 16:11:28,181 INFO L78 Accepts]: Start accepts. Automaton has 3620 states and 4821 transitions. Word has length 253 [2018-12-03 16:11:28,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:28,182 INFO L480 AbstractCegarLoop]: Abstraction has 3620 states and 4821 transitions. [2018-12-03 16:11:28,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 4821 transitions. [2018-12-03 16:11:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-12-03 16:11:28,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:28,190 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:28,191 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:28,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:28,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1047762319, now seen corresponding path program 1 times [2018-12-03 16:11:28,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:28,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:28,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:28,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:28,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:28,331 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2018-12-03 16:11:28,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:28,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:28,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:28,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:28,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:28,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:28,333 INFO L87 Difference]: Start difference. First operand 3620 states and 4821 transitions. Second operand 3 states. [2018-12-03 16:11:28,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:28,508 INFO L93 Difference]: Finished difference Result 10344 states and 13851 transitions. [2018-12-03 16:11:28,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:28,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2018-12-03 16:11:28,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:28,560 INFO L225 Difference]: With dead ends: 10344 [2018-12-03 16:11:28,560 INFO L226 Difference]: Without dead ends: 6730 [2018-12-03 16:11:28,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6730 states. [2018-12-03 16:11:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6730 to 6728. [2018-12-03 16:11:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6728 states. [2018-12-03 16:11:28,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6728 states to 6728 states and 9015 transitions. [2018-12-03 16:11:28,683 INFO L78 Accepts]: Start accepts. Automaton has 6728 states and 9015 transitions. Word has length 254 [2018-12-03 16:11:28,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:28,684 INFO L480 AbstractCegarLoop]: Abstraction has 6728 states and 9015 transitions. [2018-12-03 16:11:28,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:28,684 INFO L276 IsEmpty]: Start isEmpty. Operand 6728 states and 9015 transitions. [2018-12-03 16:11:28,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-03 16:11:28,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:28,695 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:28,696 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:28,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:28,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1879637243, now seen corresponding path program 1 times [2018-12-03 16:11:28,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:28,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:28,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:28,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:28,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2018-12-03 16:11:28,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:28,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:28,803 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:28,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:28,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:28,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:28,804 INFO L87 Difference]: Start difference. First operand 6728 states and 9015 transitions. Second operand 3 states. [2018-12-03 16:11:29,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:29,111 INFO L93 Difference]: Finished difference Result 13458 states and 18012 transitions. [2018-12-03 16:11:29,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:29,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2018-12-03 16:11:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:29,125 INFO L225 Difference]: With dead ends: 13458 [2018-12-03 16:11:29,126 INFO L226 Difference]: Without dead ends: 6736 [2018-12-03 16:11:29,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:29,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6736 states. [2018-12-03 16:11:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6736 to 6704. [2018-12-03 16:11:29,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6704 states. [2018-12-03 16:11:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6704 states to 6704 states and 8799 transitions. [2018-12-03 16:11:29,241 INFO L78 Accepts]: Start accepts. Automaton has 6704 states and 8799 transitions. Word has length 255 [2018-12-03 16:11:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:29,241 INFO L480 AbstractCegarLoop]: Abstraction has 6704 states and 8799 transitions. [2018-12-03 16:11:29,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 6704 states and 8799 transitions. [2018-12-03 16:11:29,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-12-03 16:11:29,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:29,255 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:29,255 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:29,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:29,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1049834548, now seen corresponding path program 1 times [2018-12-03 16:11:29,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:29,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:29,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:29,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:29,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 318 proven. 18 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-12-03 16:11:29,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:29,547 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:29,548 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 279 with the following transitions: [2018-12-03 16:11:29,551 INFO L205 CegarAbsIntRunner]: [0], [3], [12], [23], [31], [33], [38], [43], [48], [53], [58], [61], [63], [68], [71], [73], [78], [81], [83], [88], [91], [93], [98], [101], [103], [108], [111], [113], [118], [123], [128], [133], [138], [141], [143], [148], [153], [158], [161], [163], [168], [171], [173], [178], [183], [188], [191], [243], [246], [254], [257], [262], [265], [273], [278], [280], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [347], [349], [358], [363], [368], [370], [379], [384], [387], [395], [400], [402], [407], [418], [420], [436], [446], [448], [515], [517], [531] [2018-12-03 16:11:29,620 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:11:29,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:11:30,581 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:11:30,583 INFO L272 AbstractInterpreter]: Visited 92 different actions 192 times. Merged at 72 different actions 88 times. Widened at 1 different actions 1 times. Found 17 fixpoints after 13 different actions. Largest state had 0 variables. [2018-12-03 16:11:30,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:30,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:11:30,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:30,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:11:30,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:30,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:30,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 318 proven. 18 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-12-03 16:11:30,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 318 proven. 18 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-12-03 16:11:31,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:31,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 16:11:31,171 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:31,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:11:31,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:11:31,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:11:31,173 INFO L87 Difference]: Start difference. First operand 6704 states and 8799 transitions. Second operand 4 states. [2018-12-03 16:11:33,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:33,748 INFO L93 Difference]: Finished difference Result 13332 states and 17493 transitions. [2018-12-03 16:11:33,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:11:33,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2018-12-03 16:11:33,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:33,767 INFO L225 Difference]: With dead ends: 13332 [2018-12-03 16:11:33,767 INFO L226 Difference]: Without dead ends: 10062 [2018-12-03 16:11:33,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:11:33,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10062 states. [2018-12-03 16:11:33,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10062 to 8608. [2018-12-03 16:11:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8608 states. [2018-12-03 16:11:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8608 states to 8608 states and 11297 transitions. [2018-12-03 16:11:33,975 INFO L78 Accepts]: Start accepts. Automaton has 8608 states and 11297 transitions. Word has length 278 [2018-12-03 16:11:33,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:33,976 INFO L480 AbstractCegarLoop]: Abstraction has 8608 states and 11297 transitions. [2018-12-03 16:11:33,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:11:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 8608 states and 11297 transitions. [2018-12-03 16:11:33,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-12-03 16:11:33,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:33,993 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:33,993 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:33,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:33,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1343844146, now seen corresponding path program 1 times [2018-12-03 16:11:33,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:33,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:33,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:33,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:33,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 384 proven. 5 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-12-03 16:11:34,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:34,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:34,221 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 292 with the following transitions: [2018-12-03 16:11:34,221 INFO L205 CegarAbsIntRunner]: [0], [3], [12], [23], [31], [33], [36], [38], [43], [48], [53], [58], [61], [63], [68], [71], [73], [78], [81], [83], [88], [91], [93], [98], [101], [103], [108], [111], [113], [118], [123], [128], [133], [138], [141], [143], [148], [153], [158], [161], [163], [168], [171], [173], [178], [183], [188], [191], [201], [203], [208], [210], [215], [230], [236], [241], [243], [246], [254], [257], [262], [265], [273], [278], [280], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [347], [349], [358], [363], [368], [370], [379], [384], [387], [395], [400], [402], [407], [418], [420], [436], [446], [448], [515], [517], [531] [2018-12-03 16:11:34,229 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:11:34,229 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:11:35,648 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:11:35,649 INFO L272 AbstractInterpreter]: Visited 96 different actions 415 times. Merged at 84 different actions 275 times. Widened at 1 different actions 1 times. Found 47 fixpoints after 26 different actions. Largest state had 0 variables. [2018-12-03 16:11:35,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:35,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:11:35,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:35,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:11:35,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:35,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:35,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:35,950 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-12-03 16:11:35,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-12-03 16:11:36,045 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:11:36,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-03 16:11:36,046 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:36,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:36,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:36,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:36,047 INFO L87 Difference]: Start difference. First operand 8608 states and 11297 transitions. Second operand 3 states. [2018-12-03 16:11:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:37,338 INFO L93 Difference]: Finished difference Result 17642 states and 23184 transitions. [2018-12-03 16:11:37,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:37,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 291 [2018-12-03 16:11:37,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:37,357 INFO L225 Difference]: With dead ends: 17642 [2018-12-03 16:11:37,357 INFO L226 Difference]: Without dead ends: 9040 [2018-12-03 16:11:37,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 581 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:37,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9040 states. [2018-12-03 16:11:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9040 to 8968. [2018-12-03 16:11:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8968 states. [2018-12-03 16:11:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8968 states to 8968 states and 11777 transitions. [2018-12-03 16:11:37,530 INFO L78 Accepts]: Start accepts. Automaton has 8968 states and 11777 transitions. Word has length 291 [2018-12-03 16:11:37,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:37,531 INFO L480 AbstractCegarLoop]: Abstraction has 8968 states and 11777 transitions. [2018-12-03 16:11:37,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 8968 states and 11777 transitions. [2018-12-03 16:11:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-12-03 16:11:37,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:37,552 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:37,552 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:37,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:37,553 INFO L82 PathProgramCache]: Analyzing trace with hash 624757745, now seen corresponding path program 1 times [2018-12-03 16:11:37,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:37,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:37,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:37,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:37,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:37,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 911 proven. 5 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2018-12-03 16:11:37,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:37,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:37,821 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 359 with the following transitions: [2018-12-03 16:11:37,822 INFO L205 CegarAbsIntRunner]: [0], [3], [12], [23], [31], [33], [36], [38], [43], [48], [53], [58], [61], [63], [68], [71], [73], [78], [81], [83], [88], [91], [93], [98], [101], [103], [108], [111], [113], [118], [123], [128], [133], [138], [141], [143], [148], [153], [158], [161], [163], [168], [171], [173], [178], [183], [188], [191], [201], [203], [208], [210], [215], [230], [236], [241], [243], [246], [248], [254], [257], [262], [265], [267], [273], [278], [280], [284], [286], [289], [297], [299], [301], [304], [306], [312], [317], [319], [322], [324], [329], [331], [334], [342], [347], [349], [358], [363], [368], [370], [379], [384], [387], [395], [400], [402], [407], [418], [420], [436], [446], [448], [515], [517], [531] [2018-12-03 16:11:37,832 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:11:37,833 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:11:38,816 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:11:38,816 INFO L272 AbstractInterpreter]: Visited 100 different actions 399 times. Merged at 88 different actions 253 times. Widened at 2 different actions 2 times. Found 52 fixpoints after 21 different actions. Largest state had 0 variables. [2018-12-03 16:11:38,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:38,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:11:38,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:38,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:11:38,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:38,869 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:38,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-12-03 16:11:39,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:39,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 748 proven. 0 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-12-03 16:11:39,302 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:11:39,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-03 16:11:39,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:39,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:39,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:39,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:39,304 INFO L87 Difference]: Start difference. First operand 8968 states and 11777 transitions. Second operand 3 states. [2018-12-03 16:11:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:39,521 INFO L93 Difference]: Finished difference Result 22386 states and 29378 transitions. [2018-12-03 16:11:39,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:39,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 358 [2018-12-03 16:11:39,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:39,551 INFO L225 Difference]: With dead ends: 22386 [2018-12-03 16:11:39,551 INFO L226 Difference]: Without dead ends: 13424 [2018-12-03 16:11:39,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:11:39,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13424 states. [2018-12-03 16:11:39,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13424 to 13424. [2018-12-03 16:11:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13424 states. [2018-12-03 16:11:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13424 states to 13424 states and 17587 transitions. [2018-12-03 16:11:39,799 INFO L78 Accepts]: Start accepts. Automaton has 13424 states and 17587 transitions. Word has length 358 [2018-12-03 16:11:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:39,799 INFO L480 AbstractCegarLoop]: Abstraction has 13424 states and 17587 transitions. [2018-12-03 16:11:39,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 13424 states and 17587 transitions. [2018-12-03 16:11:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-12-03 16:11:39,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:39,827 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:39,827 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:39,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:39,828 INFO L82 PathProgramCache]: Analyzing trace with hash 881476377, now seen corresponding path program 1 times [2018-12-03 16:11:39,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:39,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:39,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:39,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:39,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 913 proven. 5 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2018-12-03 16:11:40,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:40,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:40,072 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 361 with the following transitions: [2018-12-03 16:11:40,073 INFO L205 CegarAbsIntRunner]: [0], [3], [12], [23], [31], [33], [36], [38], [43], [48], [53], [58], [61], [63], [68], [71], [73], [78], [81], [83], [88], [91], [93], [98], [101], [103], [108], [111], [113], [118], [123], [128], [133], [138], [141], [143], [148], [153], [158], [161], [163], [168], [171], [173], [178], [183], [188], [191], [201], [203], [208], [210], [215], [230], [236], [241], [243], [246], [248], [254], [257], [262], [265], [267], [273], [278], [280], [286], [289], [291], [297], [299], [301], [304], [306], [312], [317], [319], [322], [324], [329], [331], [334], [342], [347], [349], [358], [363], [368], [370], [379], [384], [387], [395], [400], [402], [407], [418], [420], [436], [446], [448], [515], [517], [531] [2018-12-03 16:11:40,076 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:11:40,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:11:40,320 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:11:40,321 INFO L272 AbstractInterpreter]: Visited 100 different actions 226 times. Merged at 83 different actions 107 times. Widened at 1 different actions 1 times. Found 26 fixpoints after 15 different actions. Largest state had 0 variables. [2018-12-03 16:11:40,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:40,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:11:40,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:40,360 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:11:40,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:40,379 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:40,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 913 proven. 5 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2018-12-03 16:11:40,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:40,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 913 proven. 5 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2018-12-03 16:11:41,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:41,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 16:11:41,027 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:41,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:11:41,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:11:41,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:11:41,028 INFO L87 Difference]: Start difference. First operand 13424 states and 17587 transitions. Second operand 4 states. [2018-12-03 16:11:42,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:42,049 INFO L93 Difference]: Finished difference Result 31324 states and 40791 transitions. [2018-12-03 16:11:42,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:11:42,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 360 [2018-12-03 16:11:42,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:42,082 INFO L225 Difference]: With dead ends: 31324 [2018-12-03 16:11:42,082 INFO L226 Difference]: Without dead ends: 17894 [2018-12-03 16:11:42,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:11:42,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17894 states. [2018-12-03 16:11:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17894 to 14609. [2018-12-03 16:11:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14609 states. [2018-12-03 16:11:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14609 states to 14609 states and 18776 transitions. [2018-12-03 16:11:42,375 INFO L78 Accepts]: Start accepts. Automaton has 14609 states and 18776 transitions. Word has length 360 [2018-12-03 16:11:42,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:42,376 INFO L480 AbstractCegarLoop]: Abstraction has 14609 states and 18776 transitions. [2018-12-03 16:11:42,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:11:42,376 INFO L276 IsEmpty]: Start isEmpty. Operand 14609 states and 18776 transitions. [2018-12-03 16:11:42,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-12-03 16:11:42,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:42,402 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:42,402 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:42,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:42,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2735505, now seen corresponding path program 1 times [2018-12-03 16:11:42,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:42,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:42,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:42,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:42,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1881 backedges. 849 proven. 0 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2018-12-03 16:11:42,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:11:42,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:11:42,602 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:11:42,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:11:42,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:11:42,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:42,604 INFO L87 Difference]: Start difference. First operand 14609 states and 18776 transitions. Second operand 3 states. [2018-12-03 16:11:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:43,644 INFO L93 Difference]: Finished difference Result 27350 states and 34723 transitions. [2018-12-03 16:11:43,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:11:43,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 399 [2018-12-03 16:11:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:43,654 INFO L225 Difference]: With dead ends: 27350 [2018-12-03 16:11:43,654 INFO L226 Difference]: Without dead ends: 5792 [2018-12-03 16:11:43,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:11:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5792 states. [2018-12-03 16:11:43,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5792 to 5293. [2018-12-03 16:11:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5293 states. [2018-12-03 16:11:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 6661 transitions. [2018-12-03 16:11:43,753 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 6661 transitions. Word has length 399 [2018-12-03 16:11:43,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:43,754 INFO L480 AbstractCegarLoop]: Abstraction has 5293 states and 6661 transitions. [2018-12-03 16:11:43,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:11:43,754 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 6661 transitions. [2018-12-03 16:11:43,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-12-03 16:11:43,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:11:43,766 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:11:43,766 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:11:43,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:43,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1467189711, now seen corresponding path program 1 times [2018-12-03 16:11:43,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:11:43,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:43,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:43,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:11:43,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:11:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 1233 proven. 14 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-12-03 16:11:44,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:44,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:11:44,030 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 429 with the following transitions: [2018-12-03 16:11:44,030 INFO L205 CegarAbsIntRunner]: [0], [3], [12], [23], [31], [33], [38], [43], [48], [53], [58], [61], [63], [68], [71], [73], [78], [81], [83], [88], [91], [93], [98], [101], [103], [108], [111], [113], [118], [123], [128], [133], [138], [141], [143], [148], [153], [158], [161], [163], [168], [171], [173], [178], [181], [183], [188], [191], [243], [246], [254], [257], [262], [265], [273], [276], [280], [286], [289], [297], [299], [301], [304], [312], [317], [319], [322], [324], [329], [331], [334], [342], [347], [349], [358], [363], [368], [370], [379], [384], [387], [395], [400], [402], [407], [410], [415], [420], [422], [427], [430], [434], [436], [446], [448], [515], [517], [531] [2018-12-03 16:11:44,034 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:11:44,034 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:11:44,248 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:11:44,248 INFO L272 AbstractInterpreter]: Visited 98 different actions 204 times. Merged at 77 different actions 93 times. Widened at 1 different actions 1 times. Found 19 fixpoints after 14 different actions. Largest state had 0 variables. [2018-12-03 16:11:44,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:11:44,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:11:44,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:11:44,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:11:44,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:11:44,303 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:11:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:11:44,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:11:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 1233 proven. 14 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-12-03 16:11:44,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:11:44,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 1233 proven. 14 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-12-03 16:11:45,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:11:45,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 16:11:45,015 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:11:45,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:11:45,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:11:45,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:11:45,017 INFO L87 Difference]: Start difference. First operand 5293 states and 6661 transitions. Second operand 4 states. [2018-12-03 16:11:45,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:11:45,771 INFO L93 Difference]: Finished difference Result 6903 states and 8671 transitions. [2018-12-03 16:11:45,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:11:45,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 428 [2018-12-03 16:11:45,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:11:45,772 INFO L225 Difference]: With dead ends: 6903 [2018-12-03 16:11:45,772 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:11:45,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 860 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:11:45,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:11:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:11:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:11:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:11:45,776 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 428 [2018-12-03 16:11:45,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:11:45,776 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:11:45,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:11:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:11:45,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:11:45,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:11:45,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:45,942 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 63 [2018-12-03 16:11:45,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:45,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:45,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:45,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:45,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:45,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,643 WARN L180 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 491 DAG size of output: 71 [2018-12-03 16:11:46,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:46,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 16:11:49,033 WARN L180 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 58 DAG size of output: 15 [2018-12-03 16:11:49,882 WARN L180 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2018-12-03 16:11:50,981 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2018-12-03 16:11:51,132 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 16:11:51,403 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 17 [2018-12-03 16:11:51,857 WARN L180 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-12-03 16:11:52,469 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2018-12-03 16:11:52,470 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-12-03 16:11:52,470 INFO L448 ceAbstractionStarter]: For program point L300(lines 300 603) no Hoare annotation was computed. [2018-12-03 16:11:52,470 INFO L448 ceAbstractionStarter]: For program point L366-2(lines 366 371) no Hoare annotation was computed. [2018-12-03 16:11:52,470 INFO L444 ceAbstractionStarter]: At program point L267(lines 265 407) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4352 ssl3_connect_~s__state~7)) (.cse2 (= ssl3_connect_~s__hit~7 0))) (or (and (<= ssl3_connect_~blastFlag~7 2) .cse0 .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~7 0) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~7 4) .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~7) .cse2))) [2018-12-03 16:11:52,471 INFO L448 ceAbstractionStarter]: For program point L532(lines 532 544) no Hoare annotation was computed. [2018-12-03 16:11:52,471 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 532 544) no Hoare annotation was computed. [2018-12-03 16:11:52,471 INFO L444 ceAbstractionStarter]: At program point L433(lines 433 636) the Hoare annotation is: false [2018-12-03 16:11:52,471 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 346) no Hoare annotation was computed. [2018-12-03 16:11:52,471 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 603) no Hoare annotation was computed. [2018-12-03 16:11:52,472 INFO L448 ceAbstractionStarter]: For program point L334-2(lines 334 350) no Hoare annotation was computed. [2018-12-03 16:11:52,472 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 238) no Hoare annotation was computed. [2018-12-03 16:11:52,472 INFO L448 ceAbstractionStarter]: For program point L401(lines 401 403) no Hoare annotation was computed. [2018-12-03 16:11:52,472 INFO L448 ceAbstractionStarter]: For program point L401-2(lines 401 406) no Hoare annotation was computed. [2018-12-03 16:11:52,472 INFO L448 ceAbstractionStarter]: For program point L302(lines 302 603) no Hoare annotation was computed. [2018-12-03 16:11:52,472 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 237) no Hoare annotation was computed. [2018-12-03 16:11:52,472 INFO L448 ceAbstractionStarter]: For program point L567(lines 567 570) no Hoare annotation was computed. [2018-12-03 16:11:52,472 INFO L448 ceAbstractionStarter]: For program point L501(lines 501 503) no Hoare annotation was computed. [2018-12-03 16:11:52,472 INFO L448 ceAbstractionStarter]: For program point L435(lines 435 437) no Hoare annotation was computed. [2018-12-03 16:11:52,473 INFO L444 ceAbstractionStarter]: At program point L303(lines 301 521) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~7))) (or (and (<= ssl3_connect_~blastFlag~7 2) .cse0 .cse1) (and .cse0 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~7) (= ssl3_connect_~s__hit~7 0)))) [2018-12-03 16:11:52,473 INFO L448 ceAbstractionStarter]: For program point L270(lines 270 603) no Hoare annotation was computed. [2018-12-03 16:11:52,473 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 636) no Hoare annotation was computed. [2018-12-03 16:11:52,473 INFO L444 ceAbstractionStarter]: At program point L601(lines 360 621) the Hoare annotation is: (let ((.cse8 (<= ssl3_connect_~s__state~7 4352)) (.cse9 (<= 4352 ssl3_connect_~s__state~7)) (.cse1 (<= 4560 ssl3_connect_~s__state~7)) (.cse2 (<= ssl3_connect_~s__state~7 4560)) (.cse11 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~7)) (.cse5 (= ssl3_connect_~s__state~7 4512)) (.cse6 (<= ssl3_connect_~s__state~7 3)) (.cse0 (<= ssl3_connect_~blastFlag~7 2)) (.cse7 (<= ssl3_connect_~s__s3__tmp__next_state___0~7 4560)) (.cse10 (= ssl3_connect_~s__state~7 4528)) (.cse3 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~7)) (.cse4 (= ssl3_connect_~s__hit~7 0))) (or (and .cse0 .cse1 .cse2) (and (= ssl3_connect_~s__state~7 4480) .cse3 .cse4) (and .cse5 .cse3 .cse4) (and .cse6 .cse7 .cse3) (<= ssl3_connect_~blastFlag~7 0) (and .cse0 .cse4) (and .cse8 .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~7 3) .cse9) (and .cse0 (= ssl3_connect_~s__state~7 4384)) (and .cse0 .cse10) (and .cse8 .cse7 .cse11 .cse9 .cse3 .cse4) (and (<= ssl3_connect_~blastFlag~7 4) .cse3 .cse4) (and .cse1 .cse2 .cse7 .cse11 .cse3 .cse4) (and .cse0 .cse5) (and .cse6 .cse0 .cse7) (and (= ssl3_connect_~s__state~7 4464) .cse3 .cse4) (and .cse10 .cse3 .cse4) (and (= ssl3_connect_~s__state~7 4496) .cse3 .cse4))) [2018-12-03 16:11:52,473 INFO L448 ceAbstractionStarter]: For program point L535(lines 535 541) no Hoare annotation was computed. [2018-12-03 16:11:52,473 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 340) no Hoare annotation was computed. [2018-12-03 16:11:52,473 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 603) no Hoare annotation was computed. [2018-12-03 16:11:52,473 INFO L444 ceAbstractionStarter]: At program point L271(lines 269 411) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4352 ssl3_connect_~s__state~7)) (.cse2 (= ssl3_connect_~s__hit~7 0))) (or (and (<= ssl3_connect_~blastFlag~7 2) .cse0 .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~7 0) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~7 4) .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~7) .cse2))) [2018-12-03 16:11:52,474 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 603) no Hoare annotation was computed. [2018-12-03 16:11:52,474 INFO L448 ceAbstractionStarter]: For program point L239(lines 235 623) no Hoare annotation was computed. [2018-12-03 16:11:52,474 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 603) no Hoare annotation was computed. [2018-12-03 16:11:52,474 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 621) no Hoare annotation was computed. [2018-12-03 16:11:52,474 INFO L444 ceAbstractionStarter]: At program point L307(lines 305 547) the Hoare annotation is: (let ((.cse4 (<= ssl3_connect_~blastFlag~7 2)) (.cse1 (<= ssl3_connect_~s__state~7 4560)) (.cse0 (<= 4560 ssl3_connect_~s__state~7)) (.cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~7)) (.cse3 (= ssl3_connect_~s__hit~7 0))) (or (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~7 4560) .cse2 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~7 0)) (and .cse4 .cse0 .cse3) (and .cse4 .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~7 4) .cse2 .cse3))) [2018-12-03 16:11:52,474 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 603) no Hoare annotation was computed. [2018-12-03 16:11:52,474 INFO L448 ceAbstractionStarter]: For program point L605(lines 605 620) no Hoare annotation was computed. [2018-12-03 16:11:52,474 INFO L448 ceAbstractionStarter]: For program point L374(lines 374 375) no Hoare annotation was computed. [2018-12-03 16:11:52,474 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 344) no Hoare annotation was computed. [2018-12-03 16:11:52,474 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 603) no Hoare annotation was computed. [2018-12-03 16:11:52,474 INFO L444 ceAbstractionStarter]: At program point L275(lines 273 428) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4352 ssl3_connect_~s__state~7)) (.cse2 (= ssl3_connect_~s__hit~7 0))) (or (and (<= ssl3_connect_~blastFlag~7 2) .cse0 .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~7 0) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~7 4) .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~7) .cse2))) [2018-12-03 16:11:52,474 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 612) no Hoare annotation was computed. [2018-12-03 16:11:52,474 INFO L448 ceAbstractionStarter]: For program point L606-2(lines 606 619) no Hoare annotation was computed. [2018-12-03 16:11:52,474 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 511) no Hoare annotation was computed. [2018-12-03 16:11:52,475 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 476) no Hoare annotation was computed. [2018-12-03 16:11:52,475 INFO L448 ceAbstractionStarter]: For program point L507-2(lines 507 515) no Hoare annotation was computed. [2018-12-03 16:11:52,475 INFO L444 ceAbstractionStarter]: At program point L309(lines 309 561) the Hoare annotation is: (let ((.cse1 (<= ssl3_connect_~blastFlag~7 2)) (.cse0 (<= ssl3_connect_~s__state~7 4352)) (.cse2 (<= 4352 ssl3_connect_~s__state~7)) (.cse4 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~7)) (.cse3 (= ssl3_connect_~s__hit~7 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= ssl3_connect_~s__s3__tmp__next_state___0~7 3) .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~7 0) .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~7 4) .cse2 .cse4 .cse3) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~7 4560) (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~7) .cse2 .cse4 .cse3))) [2018-12-03 16:11:52,475 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 603) no Hoare annotation was computed. [2018-12-03 16:11:52,475 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 603) no Hoare annotation was computed. [2018-12-03 16:11:52,475 INFO L448 ceAbstractionStarter]: For program point L244(line 244) no Hoare annotation was computed. [2018-12-03 16:11:52,475 INFO L451 ceAbstractionStarter]: At program point L311(lines 311 578) the Hoare annotation is: true [2018-12-03 16:11:52,475 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 603) no Hoare annotation was computed. [2018-12-03 16:11:52,475 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 611) no Hoare annotation was computed. [2018-12-03 16:11:52,475 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2018-12-03 16:11:52,475 INFO L444 ceAbstractionStarter]: At program point L279(lines 277 441) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4352 ssl3_connect_~s__state~7)) (.cse2 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~7)) (.cse3 (= ssl3_connect_~s__hit~7 0))) (or (and (<= ssl3_connect_~s__s3__tmp__next_state___0~7 4560) .cse0 .cse1 .cse2 .cse3) (and (<= ssl3_connect_~blastFlag~7 2) .cse0 .cse1 .cse3) (and .cse0 (<= ssl3_connect_~blastFlag~7 0) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~7 4) .cse1 .cse2 .cse3))) [2018-12-03 16:11:52,475 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 603) no Hoare annotation was computed. [2018-12-03 16:11:52,475 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 483) no Hoare annotation was computed. [2018-12-03 16:11:52,476 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 447) no Hoare annotation was computed. [2018-12-03 16:11:52,476 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 483) no Hoare annotation was computed. [2018-12-03 16:11:52,476 INFO L448 ceAbstractionStarter]: For program point L445-2(lines 445 450) no Hoare annotation was computed. [2018-12-03 16:11:52,476 INFO L451 ceAbstractionStarter]: At program point L313(lines 313 597) the Hoare annotation is: true [2018-12-03 16:11:52,476 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 603) no Hoare annotation was computed. [2018-12-03 16:11:52,476 INFO L444 ceAbstractionStarter]: At program point L247(lines 247 315) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~7)) (.cse1 (= ssl3_connect_~s__hit~7 0))) (or (and .cse0 (<= ssl3_connect_~blastFlag~7 0)) (and (<= ssl3_connect_~blastFlag~7 2) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~7 4) (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~7) .cse1))) [2018-12-03 16:11:52,476 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 603) no Hoare annotation was computed. [2018-12-03 16:11:52,476 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 383) no Hoare annotation was computed. [2018-12-03 16:11:52,476 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 386) no Hoare annotation was computed. [2018-12-03 16:11:52,476 INFO L448 ceAbstractionStarter]: For program point L282(lines 282 603) no Hoare annotation was computed. [2018-12-03 16:11:52,476 INFO L448 ceAbstractionStarter]: For program point ssl3_connectENTRY(lines 15 640) no Hoare annotation was computed. [2018-12-03 16:11:52,476 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 417) no Hoare annotation was computed. [2018-12-03 16:11:52,476 INFO L448 ceAbstractionStarter]: For program point L415-2(lines 415 420) no Hoare annotation was computed. [2018-12-03 16:11:52,476 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 603) no Hoare annotation was computed. [2018-12-03 16:11:52,476 INFO L448 ceAbstractionStarter]: For program point L614(lines 614 618) no Hoare annotation was computed. [2018-12-03 16:11:52,476 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 582) no Hoare annotation was computed. [2018-12-03 16:11:52,477 INFO L448 ceAbstractionStarter]: For program point L581-2(lines 581 582) no Hoare annotation was computed. [2018-12-03 16:11:52,477 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 603) no Hoare annotation was computed. [2018-12-03 16:11:52,477 INFO L448 ceAbstractionStarter]: For program point L516(lines 516 519) no Hoare annotation was computed. [2018-12-03 16:11:52,477 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 354) no Hoare annotation was computed. [2018-12-03 16:11:52,477 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 603) no Hoare annotation was computed. [2018-12-03 16:11:52,477 INFO L448 ceAbstractionStarter]: For program point L451(lines 451 455) no Hoare annotation was computed. [2018-12-03 16:11:52,477 INFO L448 ceAbstractionStarter]: For program point L451-2(lines 451 455) no Hoare annotation was computed. [2018-12-03 16:11:52,477 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 603) no Hoare annotation was computed. [2018-12-03 16:11:52,477 INFO L448 ceAbstractionStarter]: For program point L551(lines 551 553) no Hoare annotation was computed. [2018-12-03 16:11:52,477 INFO L448 ceAbstractionStarter]: For program point $Ultimate##85(lines 314 602) no Hoare annotation was computed. [2018-12-03 16:11:52,477 INFO L448 ceAbstractionStarter]: For program point $Ultimate##84(lines 314 602) no Hoare annotation was computed. [2018-12-03 16:11:52,478 INFO L444 ceAbstractionStarter]: At program point L287(lines 281 458) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~7)) (.cse2 (= ssl3_connect_~s__hit~7 0))) (or (and (<= ssl3_connect_~blastFlag~7 2) .cse0 .cse1 .cse2) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~7 0)) (and .cse0 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~7) .cse2))) [2018-12-03 16:11:52,478 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 603) no Hoare annotation was computed. [2018-12-03 16:11:52,478 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 589) no Hoare annotation was computed. [2018-12-03 16:11:52,478 INFO L448 ceAbstractionStarter]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2018-12-03 16:11:52,478 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 391) no Hoare annotation was computed. [2018-12-03 16:11:52,478 INFO L444 ceAbstractionStarter]: At program point L321(lines 249 321) the Hoare annotation is: (let ((.cse0 (= ssl3_connect_~s__hit~7 0))) (or (and (<= ssl3_connect_~blastFlag~7 4) (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~7) .cse0) (and (<= ssl3_connect_~blastFlag~7 2) .cse0) (<= ssl3_connect_~blastFlag~7 0))) [2018-12-03 16:11:52,478 INFO L448 ceAbstractionStarter]: For program point L387-2(lines 387 391) no Hoare annotation was computed. [2018-12-03 16:11:52,478 INFO L448 ceAbstractionStarter]: For program point L288(lines 288 603) no Hoare annotation was computed. [2018-12-03 16:11:52,478 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 603) no Hoare annotation was computed. [2018-12-03 16:11:52,478 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-12-03 16:11:52,479 INFO L448 ceAbstractionStarter]: For program point L554-2(lines 554 558) no Hoare annotation was computed. [2018-12-03 16:11:52,479 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 603) no Hoare annotation was computed. [2018-12-03 16:11:52,479 INFO L448 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 15 640) no Hoare annotation was computed. [2018-12-03 16:11:52,479 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 426) no Hoare annotation was computed. [2018-12-03 16:11:52,479 INFO L444 ceAbstractionStarter]: At program point L291(lines 289 470) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~7 0)) (.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~7))) (or (and .cse0 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~7) .cse2) (and (<= ssl3_connect_~blastFlag~7 2) .cse0 .cse1 .cse2) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~7 0)))) [2018-12-03 16:11:52,479 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 603) no Hoare annotation was computed. [2018-12-03 16:11:52,479 INFO L448 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 15 640) no Hoare annotation was computed. [2018-12-03 16:11:52,479 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 492) no Hoare annotation was computed. [2018-12-03 16:11:52,479 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 603) no Hoare annotation was computed. [2018-12-03 16:11:52,479 INFO L444 ceAbstractionStarter]: At program point L259(lines 257 361) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4352 ssl3_connect_~s__state~7)) (.cse2 (= ssl3_connect_~s__hit~7 0))) (or (and (<= ssl3_connect_~blastFlag~7 2) .cse0 .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~7 0) .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~7 4) .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~7) .cse2))) [2018-12-03 16:11:52,480 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 327) no Hoare annotation was computed. [2018-12-03 16:11:52,480 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 603) no Hoare annotation was computed. [2018-12-03 16:11:52,480 INFO L448 ceAbstractionStarter]: For program point L326-2(lines 326 327) no Hoare annotation was computed. [2018-12-03 16:11:52,480 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 231) no Hoare annotation was computed. [2018-12-03 16:11:52,480 INFO L451 ceAbstractionStarter]: At program point L624(lines 242 624) the Hoare annotation is: true [2018-12-03 16:11:52,480 INFO L448 ceAbstractionStarter]: For program point L525(lines 525 527) no Hoare annotation was computed. [2018-12-03 16:11:52,480 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 603) no Hoare annotation was computed. [2018-12-03 16:11:52,480 INFO L444 ceAbstractionStarter]: At program point L295(lines 293 486) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~7 0)) (.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~7))) (or (and .cse0 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~7) .cse2) (and (<= ssl3_connect_~blastFlag~7 2) .cse0 .cse1 .cse2) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~7 0)))) [2018-12-03 16:11:52,480 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 603) no Hoare annotation was computed. [2018-12-03 16:11:52,480 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 231) no Hoare annotation was computed. [2018-12-03 16:11:52,481 INFO L448 ceAbstractionStarter]: For program point L229-2(lines 227 231) no Hoare annotation was computed. [2018-12-03 16:11:52,481 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 332) no Hoare annotation was computed. [2018-12-03 16:11:52,481 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 603) no Hoare annotation was computed. [2018-12-03 16:11:52,481 INFO L444 ceAbstractionStarter]: At program point L263(lines 261 377) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4352 ssl3_connect_~s__state~7))) (or (and (<= ssl3_connect_~blastFlag~7 2) .cse0 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~7 4) .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~7) (= ssl3_connect_~s__hit~7 0)))) [2018-12-03 16:11:52,481 INFO L448 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONASSERT(line 635) no Hoare annotation was computed. [2018-12-03 16:11:52,481 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 595) no Hoare annotation was computed. [2018-12-03 16:11:52,481 INFO L448 ceAbstractionStarter]: For program point L396-1(lines 396 407) no Hoare annotation was computed. [2018-12-03 16:11:52,481 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 603) no Hoare annotation was computed. [2018-12-03 16:11:52,481 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 603) no Hoare annotation was computed. [2018-12-03 16:11:52,482 INFO L448 ceAbstractionStarter]: For program point L629(lines 629 630) no Hoare annotation was computed. [2018-12-03 16:11:52,482 INFO L448 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-12-03 16:11:52,482 INFO L448 ceAbstractionStarter]: For program point L629-2(lines 629 630) no Hoare annotation was computed. [2018-12-03 16:11:52,482 INFO L448 ceAbstractionStarter]: For program point L563-2(lines 563 572) no Hoare annotation was computed. [2018-12-03 16:11:52,482 INFO L448 ceAbstractionStarter]: For program point L464(lines 464 466) no Hoare annotation was computed. [2018-12-03 16:11:52,482 INFO L444 ceAbstractionStarter]: At program point L299(lines 297 497) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~7 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~7))) (or (and .cse0 .cse1 (= 256 ssl3_connect_~s__s3__tmp__new_cipher__algorithms~7) (= ssl3_connect_~s__hit~7 0)) (and (<= ssl3_connect_~blastFlag~7 2) .cse0 .cse1))) [2018-12-03 16:11:52,482 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 603) no Hoare annotation was computed. [2018-12-03 16:11:52,499 INFO L202 PluginConnector]: Adding new model s3_clnt_1_Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:11:52 BoogieIcfgContainer [2018-12-03 16:11:52,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:11:52,500 INFO L168 Benchmark]: Toolchain (without parser) took 39031.91 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -998.7 MB). Peak memory consumption was 909.7 MB. Max. memory is 7.1 GB. [2018-12-03 16:11:52,501 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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-12-03 16:11:52,502 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.04 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-12-03 16:11:52,502 INFO L168 Benchmark]: Boogie Preprocessor took 84.06 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-12-03 16:11:52,503 INFO L168 Benchmark]: RCFGBuilder took 1161.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-12-03 16:11:52,503 INFO L168 Benchmark]: TraceAbstraction took 37732.46 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 856.8 MB. Max. memory is 7.1 GB. [2018-12-03 16:11:52,507 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 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. * Boogie Procedure Inliner took 49.04 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. * Boogie Preprocessor took 84.06 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. * RCFGBuilder took 1161.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37732.46 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 856.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 635]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 249]: Loop Invariant Derived loop invariant: (((~blastFlag~7 <= 4 && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) || (~blastFlag~7 <= 2 && ~s__hit~7 == 0)) || ~blastFlag~7 <= 0 - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((4560 <= ~s__state~7 && ~blastFlag~7 <= 0) || ((~blastFlag~7 <= 2 && 4560 <= ~s__state~7) && ~s__hit~7 == 0)) || (((4560 <= ~s__state~7 && ~blastFlag~7 <= 4) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((((((~s__s3__tmp__next_state___0~7 <= 4560 && ~s__state~7 <= 4560) && 4352 <= ~s__state~7) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) || (((~blastFlag~7 <= 2 && ~s__state~7 <= 4560) && 4352 <= ~s__state~7) && ~s__hit~7 == 0)) || ((~s__state~7 <= 4560 && ~blastFlag~7 <= 0) && 4352 <= ~s__state~7)) || ((((~s__state~7 <= 4560 && ~blastFlag~7 <= 4) && 4352 <= ~s__state~7) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((~s__state~7 <= 4352 && ~blastFlag~7 <= 2) && 4352 <= ~s__state~7) && ~s__hit~7 == 0) || (((~s__state~7 <= 4352 && ~blastFlag~7 <= 2) && ~s__s3__tmp__next_state___0~7 <= 3) && 4352 <= ~s__state~7)) || ((~s__state~7 <= 4352 && ~blastFlag~7 <= 0) && 4352 <= ~s__state~7)) || ((((~s__state~7 <= 4352 && ~blastFlag~7 <= 4) && 4352 <= ~s__state~7) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0)) || (((((~s__state~7 <= 4352 && ~s__s3__tmp__next_state___0~7 <= 4560) && 4560 <= ~s__s3__tmp__next_state___0~7) && 4352 <= ~s__state~7) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((((~blastFlag~7 <= 2 && ~s__state~7 <= 4560) && 4352 <= ~s__state~7) && ~s__hit~7 == 0) || ((~s__state~7 <= 4560 && ~blastFlag~7 <= 0) && 4352 <= ~s__state~7)) || ((((~s__state~7 <= 4560 && ~blastFlag~7 <= 4) && 4352 <= ~s__state~7) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (((~s__state~7 <= 4560 && 4464 <= ~s__state~7) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) || ((~blastFlag~7 <= 2 && ~s__state~7 <= 4560) && 4464 <= ~s__state~7) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: (((((((((((((((((~blastFlag~7 <= 2 && 4560 <= ~s__state~7) && ~s__state~7 <= 4560) || ((~s__state~7 == 4480 && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0)) || ((~s__state~7 == 4512 && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0)) || ((~s__state~7 <= 3 && ~s__s3__tmp__next_state___0~7 <= 4560) && 256 == ~s__s3__tmp__new_cipher__algorithms~7)) || ~blastFlag~7 <= 0) || (~blastFlag~7 <= 2 && ~s__hit~7 == 0)) || (((~s__state~7 <= 4352 && ~blastFlag~7 <= 2) && ~s__s3__tmp__next_state___0~7 <= 3) && 4352 <= ~s__state~7)) || (~blastFlag~7 <= 2 && ~s__state~7 == 4384)) || (~blastFlag~7 <= 2 && ~s__state~7 == 4528)) || (((((~s__state~7 <= 4352 && ~s__s3__tmp__next_state___0~7 <= 4560) && 4560 <= ~s__s3__tmp__next_state___0~7) && 4352 <= ~s__state~7) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0)) || ((~blastFlag~7 <= 4 && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0)) || (((((4560 <= ~s__state~7 && ~s__state~7 <= 4560) && ~s__s3__tmp__next_state___0~7 <= 4560) && 4560 <= ~s__s3__tmp__next_state___0~7) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0)) || (~blastFlag~7 <= 2 && ~s__state~7 == 4512)) || ((~s__state~7 <= 3 && ~blastFlag~7 <= 2) && ~s__s3__tmp__next_state___0~7 <= 4560)) || ((~s__state~7 == 4464 && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0)) || ((~s__state~7 == 4528 && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0)) || ((~s__state~7 == 4496 && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: ((((~blastFlag~7 <= 2 && ~s__state~7 <= 4560) && 4352 <= ~s__state~7) && ~s__hit~7 == 0) || ((~s__state~7 <= 4560 && ~blastFlag~7 <= 0) && 4352 <= ~s__state~7)) || ((((~s__state~7 <= 4560 && ~blastFlag~7 <= 4) && 4352 <= ~s__state~7) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) - InvariantResult [Line: 301]: Loop Invariant Derived loop invariant: ((~blastFlag~7 <= 2 && ~s__state~7 <= 4560) && 4464 <= ~s__state~7) || (((~s__state~7 <= 4560 && 4464 <= ~s__state~7) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: ((((~blastFlag~7 <= 2 && ~s__state~7 <= 4560) && 4352 <= ~s__state~7) && ~s__hit~7 == 0) || ((~s__state~7 <= 4560 && ~blastFlag~7 <= 0) && 4352 <= ~s__state~7)) || ((((~s__state~7 <= 4560 && ~blastFlag~7 <= 4) && 4352 <= ~s__state~7) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((((~s__state~7 <= 4560 && 4464 <= ~s__state~7) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) || (((~blastFlag~7 <= 2 && ~s__state~7 <= 4560) && 4464 <= ~s__state~7) && ~s__hit~7 == 0)) || ((~s__state~7 <= 4560 && 4464 <= ~s__state~7) && ~blastFlag~7 <= 0) - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((~blastFlag~7 <= 2 && ~s__state~7 <= 4560) && 4352 <= ~s__state~7) || ((((~s__state~7 <= 4560 && ~blastFlag~7 <= 4) && 4352 <= ~s__state~7) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) - InvariantResult [Line: 293]: Loop Invariant Derived loop invariant: ((((~s__state~7 <= 4560 && 4464 <= ~s__state~7) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) || (((~blastFlag~7 <= 2 && ~s__state~7 <= 4560) && 4464 <= ~s__state~7) && ~s__hit~7 == 0)) || ((~s__state~7 <= 4560 && 4464 <= ~s__state~7) && ~blastFlag~7 <= 0) - InvariantResult [Line: 242]: Loop Invariant Derived loop invariant: true - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((~blastFlag~7 <= 2 && ~s__state~7 <= 4560) && 4464 <= ~s__state~7) && ~s__hit~7 == 0) || ((~s__state~7 <= 4560 && 4464 <= ~s__state~7) && ~blastFlag~7 <= 0)) || (((~s__state~7 <= 4560 && 4464 <= ~s__state~7) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: ((((~blastFlag~7 <= 2 && ~s__state~7 <= 4560) && 4352 <= ~s__state~7) && ~s__hit~7 == 0) || ((~s__state~7 <= 4560 && ~blastFlag~7 <= 0) && 4352 <= ~s__state~7)) || ((((~s__state~7 <= 4560 && ~blastFlag~7 <= 4) && 4352 <= ~s__state~7) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) - InvariantResult [Line: 305]: Loop Invariant Derived loop invariant: (((((((4560 <= ~s__state~7 && ~s__state~7 <= 4560) && ~s__s3__tmp__next_state___0~7 <= 4560) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) || (4560 <= ~s__state~7 && ~blastFlag~7 <= 0)) || ((~blastFlag~7 <= 2 && 4560 <= ~s__state~7) && ~s__hit~7 == 0)) || ((~blastFlag~7 <= 2 && 4560 <= ~s__state~7) && ~s__state~7 <= 4560)) || (((4560 <= ~s__state~7 && ~blastFlag~7 <= 4) && 256 == ~s__s3__tmp__new_cipher__algorithms~7) && ~s__hit~7 == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. SAFE Result, 37.6s OverallTime, 25 OverallIterations, 17 TraceHistogramMax, 17.9s AutomataDifference, 0.0s DeadEndRemovalTime, 6.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 5140 SDtfs, 1617 SDslu, 2868 SDs, 0 SdLazy, 2441 SolverSat, 431 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3505 GetRequests, 3464 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14609occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.1s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 5886 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 567 NumberOfFragments, 760 HoareAnnotationTreeSize, 20 FomulaSimplifications, 34683 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 20 FomulaSimplificationsInter, 3121 FormulaSimplificationTreeSizeReductionInter, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 6556 NumberOfCodeBlocks, 6556 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 8236 ConstructedInterpolants, 0 QuantifiedInterpolants, 3466772 SizeOfPredicates, 8 NumberOfNonLiveVariables, 2838 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 35 InterpolantComputations, 24 PerfectInterpolantSequences, 28507/28628 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...