java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-935f392 [2018-07-23 13:49:41,403 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 13:49:41,405 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 13:49:41,417 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 13:49:41,417 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 13:49:41,418 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 13:49:41,420 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 13:49:41,421 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 13:49:41,423 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 13:49:41,424 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 13:49:41,425 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 13:49:41,425 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 13:49:41,426 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 13:49:41,427 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 13:49:41,428 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 13:49:41,429 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 13:49:41,429 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 13:49:41,431 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 13:49:41,433 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 13:49:41,435 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 13:49:41,436 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 13:49:41,437 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 13:49:41,439 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 13:49:41,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 13:49:41,440 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 13:49:41,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 13:49:41,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 13:49:41,442 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 13:49:41,443 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 13:49:41,444 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 13:49:41,444 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 13:49:41,445 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 13:49:41,445 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 13:49:41,445 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 13:49:41,446 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 13:49:41,447 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 13:49:41,447 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 13:49:41,461 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 13:49:41,461 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 13:49:41,462 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 13:49:41,463 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 13:49:41,463 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 13:49:41,463 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 13:49:41,463 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 13:49:41,464 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 13:49:41,507 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 13:49:41,524 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 13:49:41,529 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 13:49:41,530 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 13:49:41,531 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 13:49:41,531 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl [2018-07-23 13:49:41,532 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_1.cil.c_16.bpl' [2018-07-23 13:49:41,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 13:49:41,613 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 13:49:41,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 13:49:41,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 13:49:41,614 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 13:49:41,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/1) ... [2018-07-23 13:49:41,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/1) ... [2018-07-23 13:49:41,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/1) ... [2018-07-23 13:49:41,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/1) ... [2018-07-23 13:49:41,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/1) ... [2018-07-23 13:49:41,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/1) ... [2018-07-23 13:49:41,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/1) ... [2018-07-23 13:49:41,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 13:49:41,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 13:49:41,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 13:49:41,680 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 13:49:41,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/1) ... [2018-07-23 13:49:41,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 13:49:41,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 13:49:42,450 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 13:49:42,451 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:42 BoogieIcfgContainer [2018-07-23 13:49:42,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 13:49:42,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 13:49:42,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 13:49:42,456 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 13:49:42,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 01:49:41" (1/2) ... [2018-07-23 13:49:42,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5666d72a and model type s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:49:42, skipping insertion in model container [2018-07-23 13:49:42,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:49:42" (2/2) ... [2018-07-23 13:49:42,461 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil.c_16.bpl [2018-07-23 13:49:42,471 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 13:49:42,481 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 13:49:42,524 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 13:49:42,524 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 13:49:42,524 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 13:49:42,525 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 13:49:42,525 INFO L376 AbstractCegarLoop]: Backedges is CANONICAL [2018-07-23 13:49:42,525 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 13:49:42,525 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 13:49:42,526 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 13:49:42,526 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 13:49:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-07-23 13:49:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 13:49:42,554 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:42,555 INFO L357 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:42,555 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:42,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1912595551, now seen corresponding path program 1 times [2018-07-23 13:49:42,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:42,677 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:42,677 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 13:49:42,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:42,680 INFO L185 omatonBuilderFactory]: Interpolants [17#true, 18#false, 19#(= ULTIMATE.start_ssl3_connect_~s__state~4 12292)] [2018-07-23 13:49:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:42,681 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:42,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:42,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:42,698 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-07-23 13:49:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:42,782 INFO L93 Difference]: Finished difference Result 29 states and 46 transitions. [2018-07-23 13:49:42,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:42,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-07-23 13:49:42,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:42,799 INFO L225 Difference]: With dead ends: 29 [2018-07-23 13:49:42,799 INFO L226 Difference]: Without dead ends: 16 [2018-07-23 13:49:42,802 INFO L575 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-07-23 13:49:42,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-23 13:49:42,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-23 13:49:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-23 13:49:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2018-07-23 13:49:42,842 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 10 [2018-07-23 13:49:42,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:42,843 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2018-07-23 13:49:42,843 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2018-07-23 13:49:42,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-23 13:49:42,844 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:42,844 INFO L357 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:42,844 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:42,845 INFO L82 PathProgramCache]: Analyzing trace with hash -694754889, now seen corresponding path program 1 times [2018-07-23 13:49:42,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:42,874 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:42,874 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:42,874 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:42,875 INFO L185 omatonBuilderFactory]: Interpolants [112#(= ULTIMATE.start_ssl3_connect_~s__state~4 4368), 110#true, 111#false] [2018-07-23 13:49:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:42,877 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:42,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:42,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:42,878 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 3 states. [2018-07-23 13:49:42,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:42,938 INFO L93 Difference]: Finished difference Result 33 states and 49 transitions. [2018-07-23 13:49:42,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:42,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-07-23 13:49:42,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:42,943 INFO L225 Difference]: With dead ends: 33 [2018-07-23 13:49:42,943 INFO L226 Difference]: Without dead ends: 20 [2018-07-23 13:49:42,944 INFO L575 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-07-23 13:49:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-23 13:49:42,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-23 13:49:42,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-23 13:49:42,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-07-23 13:49:42,958 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 13 [2018-07-23 13:49:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:42,959 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-07-23 13:49:42,959 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2018-07-23 13:49:42,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-23 13:49:42,960 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:42,960 INFO L357 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:42,961 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:42,961 INFO L82 PathProgramCache]: Analyzing trace with hash 479368949, now seen corresponding path program 1 times [2018-07-23 13:49:42,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:49:43,016 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:43,016 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:43,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,018 INFO L185 omatonBuilderFactory]: Interpolants [219#true, 220#false, 221#(= ULTIMATE.start_ssl3_connect_~s__state~4 4384)] [2018-07-23 13:49:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-23 13:49:43,018 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:43,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:43,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:43,019 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2018-07-23 13:49:43,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:43,084 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2018-07-23 13:49:43,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:43,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-07-23 13:49:43,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:43,091 INFO L225 Difference]: With dead ends: 42 [2018-07-23 13:49:43,091 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 13:49:43,093 INFO L575 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-07-23 13:49:43,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 13:49:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 13:49:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 13:49:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-07-23 13:49:43,099 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2018-07-23 13:49:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:43,100 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-07-23 13:49:43,100 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2018-07-23 13:49:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 13:49:43,101 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:43,101 INFO L357 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:43,102 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:43,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2107312679, now seen corresponding path program 1 times [2018-07-23 13:49:43,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-07-23 13:49:43,131 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:43,131 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:43,131 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:43,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,132 INFO L185 omatonBuilderFactory]: Interpolants [356#true, 357#false, 358#(= ULTIMATE.start_ssl3_connect_~s__state~4 4400)] [2018-07-23 13:49:43,132 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-07-23 13:49:43,133 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:43,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:43,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:43,134 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2018-07-23 13:49:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:43,197 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2018-07-23 13:49:43,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:43,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-07-23 13:49:43,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:43,203 INFO L225 Difference]: With dead ends: 53 [2018-07-23 13:49:43,203 INFO L226 Difference]: Without dead ends: 31 [2018-07-23 13:49:43,207 INFO L575 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-07-23 13:49:43,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-23 13:49:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-23 13:49:43,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 13:49:43,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-07-23 13:49:43,222 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 22 [2018-07-23 13:49:43,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:43,222 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-07-23 13:49:43,222 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:43,223 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-07-23 13:49:43,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 13:49:43,224 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:43,224 INFO L357 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:43,224 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:43,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1908478443, now seen corresponding path program 1 times [2018-07-23 13:49:43,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:43,257 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-07-23 13:49:43,258 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:43,258 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:43,258 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,259 INFO L185 omatonBuilderFactory]: Interpolants [528#false, 529#(= ULTIMATE.start_ssl3_connect_~s__state~4 4416), 527#true] [2018-07-23 13:49:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-07-23 13:49:43,260 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:43,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:43,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:43,261 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 3 states. [2018-07-23 13:49:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:43,294 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-07-23 13:49:43,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:43,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-07-23 13:49:43,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:43,297 INFO L225 Difference]: With dead ends: 66 [2018-07-23 13:49:43,297 INFO L226 Difference]: Without dead ends: 38 [2018-07-23 13:49:43,298 INFO L575 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-07-23 13:49:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-23 13:49:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-23 13:49:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-23 13:49:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-07-23 13:49:43,305 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 28 [2018-07-23 13:49:43,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:43,306 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-07-23 13:49:43,306 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-07-23 13:49:43,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-23 13:49:43,308 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:43,308 INFO L357 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:43,308 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:43,308 INFO L82 PathProgramCache]: Analyzing trace with hash 685039927, now seen corresponding path program 1 times [2018-07-23 13:49:43,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-23 13:49:43,346 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:43,346 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:43,347 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,347 INFO L185 omatonBuilderFactory]: Interpolants [738#true, 739#false, 740#(<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4)] [2018-07-23 13:49:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-23 13:49:43,348 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:43,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:43,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:43,349 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 3 states. [2018-07-23 13:49:43,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:43,372 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2018-07-23 13:49:43,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:43,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-07-23 13:49:43,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:43,375 INFO L225 Difference]: With dead ends: 55 [2018-07-23 13:49:43,375 INFO L226 Difference]: Without dead ends: 53 [2018-07-23 13:49:43,376 INFO L575 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-07-23 13:49:43,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-23 13:49:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-07-23 13:49:43,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-23 13:49:43,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2018-07-23 13:49:43,386 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 35 [2018-07-23 13:49:43,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:43,387 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2018-07-23 13:49:43,387 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:43,387 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2018-07-23 13:49:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 13:49:43,389 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:43,389 INFO L357 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:43,389 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:43,389 INFO L82 PathProgramCache]: Analyzing trace with hash -82130889, now seen corresponding path program 1 times [2018-07-23 13:49:43,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-23 13:49:43,436 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:43,436 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:43,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,438 INFO L185 omatonBuilderFactory]: Interpolants [949#true, 950#false, 951#(= ULTIMATE.start_ssl3_connect_~s__state~4 4432)] [2018-07-23 13:49:43,438 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-07-23 13:49:43,438 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:43,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:43,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:43,440 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand 3 states. [2018-07-23 13:49:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:43,484 INFO L93 Difference]: Finished difference Result 103 states and 137 transitions. [2018-07-23 13:49:43,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:43,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-07-23 13:49:43,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:43,493 INFO L225 Difference]: With dead ends: 103 [2018-07-23 13:49:43,493 INFO L226 Difference]: Without dead ends: 57 [2018-07-23 13:49:43,494 INFO L575 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-07-23 13:49:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-23 13:49:43,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-23 13:49:43,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-23 13:49:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2018-07-23 13:49:43,513 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 71 transitions. Word has length 44 [2018-07-23 13:49:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:43,514 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 71 transitions. [2018-07-23 13:49:43,514 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 71 transitions. [2018-07-23 13:49:43,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-23 13:49:43,519 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:43,519 INFO L357 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:43,519 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1942977721, now seen corresponding path program 1 times [2018-07-23 13:49:43,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:43,578 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 13:49:43,579 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 13:49:43,579 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-23 13:49:43,579 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,582 INFO L185 omatonBuilderFactory]: Interpolants [1272#true, 1273#false, 1274#(<= 4480 ULTIMATE.start_ssl3_connect_~s__state~4)] [2018-07-23 13:49:43,582 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 13:49:43,583 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 13:49:43,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 13:49:43,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 13:49:43,584 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. Second operand 3 states. [2018-07-23 13:49:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:43,670 INFO L93 Difference]: Finished difference Result 121 states and 156 transitions. [2018-07-23 13:49:43,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 13:49:43,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-07-23 13:49:43,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:43,673 INFO L225 Difference]: With dead ends: 121 [2018-07-23 13:49:43,673 INFO L226 Difference]: Without dead ends: 67 [2018-07-23 13:49:43,676 INFO L575 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-07-23 13:49:43,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-23 13:49:43,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-07-23 13:49:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-23 13:49:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2018-07-23 13:49:43,688 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 53 [2018-07-23 13:49:43,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:43,688 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2018-07-23 13:49:43,688 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 13:49:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2018-07-23 13:49:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-23 13:49:43,690 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:43,690 INFO L357 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:43,690 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:43,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1051764193, now seen corresponding path program 1 times [2018-07-23 13:49:43,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 82 proven. 8 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 13:49:43,750 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:43,751 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 13:49:43,751 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,752 INFO L185 omatonBuilderFactory]: Interpolants [1649#true, 1650#false, 1651#(= ULTIMATE.start_ssl3_connect_~s__state~4 4480), 1652#(<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4)] [2018-07-23 13:49:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 82 proven. 8 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 13:49:43,752 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 13:49:43,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 13:49:43,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:43,753 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand 4 states. [2018-07-23 13:49:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:43,846 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2018-07-23 13:49:43,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 13:49:43,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-07-23 13:49:43,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:43,848 INFO L225 Difference]: With dead ends: 140 [2018-07-23 13:49:43,848 INFO L226 Difference]: Without dead ends: 77 [2018-07-23 13:49:43,849 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 13:49:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-23 13:49:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-07-23 13:49:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-23 13:49:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2018-07-23 13:49:43,867 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 63 [2018-07-23 13:49:43,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:43,869 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2018-07-23 13:49:43,869 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 13:49:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2018-07-23 13:49:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-23 13:49:43,871 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:43,871 INFO L357 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:43,871 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:43,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2001830647, now seen corresponding path program 2 times [2018-07-23 13:49:43,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:43,968 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 123 proven. 26 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 13:49:43,968 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:43,968 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 13:49:43,969 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:43,969 INFO L185 omatonBuilderFactory]: Interpolants [2085#true, 2086#false, 2087#(= ULTIMATE.start_ssl3_connect_~s__state~4 4480), 2088#(= ULTIMATE.start_ssl3_connect_~s__state~4 4512), 2089#(<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4)] [2018-07-23 13:49:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 123 proven. 26 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 13:49:43,970 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 13:49:43,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 13:49:43,971 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:43,971 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 5 states. [2018-07-23 13:49:44,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:44,092 INFO L93 Difference]: Finished difference Result 160 states and 197 transitions. [2018-07-23 13:49:44,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 13:49:44,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-07-23 13:49:44,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:44,096 INFO L225 Difference]: With dead ends: 160 [2018-07-23 13:49:44,097 INFO L226 Difference]: Without dead ends: 87 [2018-07-23 13:49:44,098 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-23 13:49:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-23 13:49:44,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-07-23 13:49:44,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-23 13:49:44,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2018-07-23 13:49:44,117 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 73 [2018-07-23 13:49:44,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:44,118 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2018-07-23 13:49:44,118 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 13:49:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2018-07-23 13:49:44,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-23 13:49:44,122 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:44,124 INFO L357 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:44,125 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:44,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1874361807, now seen corresponding path program 3 times [2018-07-23 13:49:44,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 164 proven. 54 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 13:49:44,236 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:44,237 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 13:49:44,237 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:44,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:44,238 INFO L185 omatonBuilderFactory]: Interpolants [2582#true, 2583#false, 2584#(= ULTIMATE.start_ssl3_connect_~s__state~4 4480), 2585#(= ULTIMATE.start_ssl3_connect_~s__state~4 4512), 2586#(= ULTIMATE.start_ssl3_connect_~s__state~4 4528), 2587#(or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))] [2018-07-23 13:49:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 164 proven. 54 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 13:49:44,239 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 13:49:44,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 13:49:44,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:49:44,240 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand 6 states. [2018-07-23 13:49:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:44,350 INFO L93 Difference]: Finished difference Result 180 states and 217 transitions. [2018-07-23 13:49:44,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 13:49:44,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-07-23 13:49:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:44,352 INFO L225 Difference]: With dead ends: 180 [2018-07-23 13:49:44,352 INFO L226 Difference]: Without dead ends: 97 [2018-07-23 13:49:44,354 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-23 13:49:44,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-23 13:49:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-07-23 13:49:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-23 13:49:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2018-07-23 13:49:44,376 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 83 [2018-07-23 13:49:44,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:44,377 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2018-07-23 13:49:44,377 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 13:49:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2018-07-23 13:49:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-23 13:49:44,381 INFO L349 BasicCegarLoop]: Found error trace [2018-07-23 13:49:44,381 INFO L357 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-23 13:49:44,381 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 13:49:44,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1742353753, now seen corresponding path program 4 times [2018-07-23 13:49:44,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 13:49:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 13:49:44,552 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 205 proven. 92 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 13:49:44,553 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 13:49:44,553 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 13:49:44,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-07-23 13:49:44,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-23 13:49:44,555 INFO L185 omatonBuilderFactory]: Interpolants [3140#true, 3141#false, 3142#(= ULTIMATE.start_ssl3_connect_~s__state~4 4480), 3143#(= ULTIMATE.start_ssl3_connect_~s__state~4 4512), 3144#(= ULTIMATE.start_ssl3_connect_~s__state~4 4528), 3145#(or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)), 3146#(or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))] [2018-07-23 13:49:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 205 proven. 92 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-07-23 13:49:44,556 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 13:49:44,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 13:49:44,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-23 13:49:44,557 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand 7 states. [2018-07-23 13:49:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 13:49:44,709 INFO L93 Difference]: Finished difference Result 217 states and 247 transitions. [2018-07-23 13:49:44,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 13:49:44,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-07-23 13:49:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 13:49:44,710 INFO L225 Difference]: With dead ends: 217 [2018-07-23 13:49:44,710 INFO L226 Difference]: Without dead ends: 0 [2018-07-23 13:49:44,711 INFO L575 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-07-23 13:49:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-23 13:49:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-23 13:49:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-23 13:49:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-23 13:49:44,713 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2018-07-23 13:49:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 13:49:44,714 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-23 13:49:44,714 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 13:49:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-23 13:49:44,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-23 13:49:44,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-23 13:49:44,896 INFO L417 ceAbstractionStarter]: At program point L383(lines 383 410) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-07-23 13:49:44,897 INFO L417 ceAbstractionStarter]: At program point L420(lines 417 434) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-07-23 13:49:44,899 INFO L417 ceAbstractionStarter]: At program point L264(lines 264 288) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-07-23 13:49:44,900 INFO L417 ceAbstractionStarter]: At program point L389(lines 389 418) the Hoare annotation is: false [2018-07-23 13:49:44,900 INFO L417 ceAbstractionStarter]: At program point L294(lines 294 314) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-07-23 13:49:44,903 INFO L417 ceAbstractionStarter]: At program point L371(lines 371 380) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)))) [2018-07-23 13:49:44,904 INFO L417 ceAbstractionStarter]: At program point L298(lines 259 298) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-07-23 13:49:44,904 INFO L417 ceAbstractionStarter]: At program point L335(lines 335 350) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-07-23 13:49:44,905 INFO L417 ceAbstractionStarter]: At program point L379(lines 379 390) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4432)) [2018-07-23 13:49:44,905 INFO L421 ceAbstractionStarter]: For program point L459(lines 459 476) no Hoare annotation was computed. [2018-07-23 13:49:44,905 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 486) no Hoare annotation was computed. [2018-07-23 13:49:44,909 INFO L417 ceAbstractionStarter]: At program point L485(lines 287 485) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-07-23 13:49:44,909 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 486) the Hoare annotation is: true [2018-07-23 13:49:44,909 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 486) no Hoare annotation was computed. [2018-07-23 13:49:44,910 INFO L417 ceAbstractionStarter]: At program point L353(lines 353 368) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-07-23 13:49:44,910 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.startErr0AssertViolationASSERT(line 419) the Hoare annotation is: false [2018-07-23 13:49:44,910 INFO L421 ceAbstractionStarter]: For program point L439(lines 439 456) no Hoare annotation was computed. [2018-07-23 13:49:44,911 INFO L417 ceAbstractionStarter]: At program point L317(lines 317 332) the Hoare annotation is: (or (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (and (or (= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (or (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~4) (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352))) (= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) [2018-07-23 13:49:44,935 INFO L202 PluginConnector]: Adding new model s3_clnt_1.cil.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:49:44 BoogieIcfgContainer [2018-07-23 13:49:44,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 13:49:44,938 INFO L168 Benchmark]: Toolchain (without parser) took 3325.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 306.5 MB). Peak memory consumption was 306.5 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:44,940 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 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-07-23 13:49:44,941 INFO L168 Benchmark]: Boogie Preprocessor took 65.24 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-07-23 13:49:44,942 INFO L168 Benchmark]: RCFGBuilder took 772.52 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:44,943 INFO L168 Benchmark]: TraceAbstraction took 2482.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 285.4 MB). Peak memory consumption was 285.4 MB. Max. memory is 7.1 GB. [2018-07-23 13:49:44,949 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.16 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 65.24 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 772.52 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: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2482.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 285.4 MB). Peak memory consumption was 285.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 419]: 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: 259]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 || ssl3_connect_~s__state~4 == 4368) || (((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 || ssl3_connect_~s__state~4 == 4368) || (((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 417]: Loop Invariant Derived loop invariant: (((ssl3_connect_~blastFlag~4 <= 4 || (4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 || ssl3_connect_~s__state~4 == 4368) || (((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || ssl3_connect_~s__state~4 == 4480) || (((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352)) - InvariantResult [Line: 383]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((ssl3_connect_~blastFlag~4 <= 4 || ssl3_connect_~s__state~4 == 4368) || (((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 335]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 4 || (((4560 == ssl3_connect_~s__s3__tmp__next_state___0~4 || ssl3_connect_~s__state~4 == 4528) || ssl3_connect_~s__state~4 == 4512) && (4512 <= ssl3_connect_~s__state~4 || ssl3_connect_~s__state~4 <= 4352))) || ssl3_connect_~s__state~4 == 4480 - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4432 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 2.3s OverallTime, 12 OverallIterations, 12 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 238 SDtfs, 29 SDslu, 86 SDs, 0 SdLazy, 734 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 1292/1472 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 8 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 128 NumberOfFragments, 271 HoareAnnotationTreeSize, 14 FomulaSimplifications, 931 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 36 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 534 NumberOfCodeBlocks, 534 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 522 ConstructedInterpolants, 0 QuantifiedInterpolants, 67966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 1292/1472 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_1.cil.c_16.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_13-49-44-969.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_1.cil.c_16.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_13-49-44-969.csv Received shutdown request...