java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 16:15:15,759 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 16:15:15,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 16:15:15,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 16:15:15,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 16:15:15,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 16:15:15,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 16:15:15,777 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 16:15:15,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 16:15:15,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 16:15:15,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 16:15:15,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 16:15:15,782 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 16:15:15,783 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 16:15:15,784 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 16:15:15,785 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 16:15:15,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 16:15:15,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 16:15:15,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 16:15:15,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 16:15:15,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 16:15:15,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 16:15:15,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 16:15:15,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 16:15:15,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 16:15:15,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 16:15:15,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 16:15:15,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 16:15:15,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 16:15:15,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 16:15:15,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 16:15:15,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 16:15:15,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 16:15:15,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 16:15:15,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 16:15:15,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 16:15:15,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 16:15:15,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 16:15:15,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 16:15:15,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 16:15:15,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 16:15:15,822 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 16:15:15,843 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 16:15:15,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 16:15:15,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 16:15:15,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 16:15:15,845 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 16:15:15,845 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 16:15:15,845 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 16:15:15,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 16:15:15,846 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 16:15:15,846 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 16:15:15,846 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 16:15:15,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 16:15:15,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 16:15:15,846 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 16:15:15,847 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 16:15:15,847 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 16:15:15,847 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 16:15:15,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 16:15:15,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 16:15:15,848 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 16:15:15,848 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 16:15:15,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 16:15:15,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 16:15:15,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 16:15:15,849 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 16:15:15,849 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 16:15:15,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 16:15:15,849 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 16:15:15,849 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 16:15:15,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 16:15:15,893 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 16:15:15,897 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 16:15:15,898 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 16:15:15,898 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 16:15:15,899 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c [2019-10-02 16:15:15,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9cf491f2/1ea3461397934cb591623e7a49db2d3e/FLAG78402c822 [2019-10-02 16:15:16,420 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 16:15:16,421 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c [2019-10-02 16:15:16,437 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9cf491f2/1ea3461397934cb591623e7a49db2d3e/FLAG78402c822 [2019-10-02 16:15:16,765 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9cf491f2/1ea3461397934cb591623e7a49db2d3e [2019-10-02 16:15:16,775 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 16:15:16,777 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 16:15:16,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 16:15:16,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 16:15:16,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 16:15:16,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:15:16" (1/1) ... [2019-10-02 16:15:16,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb48428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:16, skipping insertion in model container [2019-10-02 16:15:16,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:15:16" (1/1) ... [2019-10-02 16:15:16,794 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 16:15:16,861 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 16:15:17,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:15:17,177 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 16:15:17,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:15:17,346 INFO L192 MainTranslator]: Completed translation [2019-10-02 16:15:17,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:17 WrapperNode [2019-10-02 16:15:17,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 16:15:17,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 16:15:17,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 16:15:17,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 16:15:17,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:17" (1/1) ... [2019-10-02 16:15:17,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:17" (1/1) ... [2019-10-02 16:15:17,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:17" (1/1) ... [2019-10-02 16:15:17,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:17" (1/1) ... [2019-10-02 16:15:17,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:17" (1/1) ... [2019-10-02 16:15:17,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:17" (1/1) ... [2019-10-02 16:15:17,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:17" (1/1) ... [2019-10-02 16:15:17,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 16:15:17,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 16:15:17,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 16:15:17,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 16:15:17,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:17" (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 [2019-10-02 16:15:17,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 16:15:17,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 16:15:17,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-02 16:15:17,471 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 16:15:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 16:15:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 16:15:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 16:15:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-02 16:15:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 16:15:17,473 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-02 16:15:17,473 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 16:15:17,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 16:15:17,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 16:15:17,606 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 16:15:18,158 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-02 16:15:18,159 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-02 16:15:18,173 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 16:15:18,173 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 16:15:18,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:15:18 BoogieIcfgContainer [2019-10-02 16:15:18,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 16:15:18,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 16:15:18,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 16:15:18,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 16:15:18,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 04:15:16" (1/3) ... [2019-10-02 16:15:18,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d93ff6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:15:18, skipping insertion in model container [2019-10-02 16:15:18,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:15:17" (2/3) ... [2019-10-02 16:15:18,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d93ff6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:15:18, skipping insertion in model container [2019-10-02 16:15:18,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:15:18" (3/3) ... [2019-10-02 16:15:18,187 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.c [2019-10-02 16:15:18,197 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 16:15:18,205 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 16:15:18,222 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 16:15:18,250 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 16:15:18,251 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 16:15:18,251 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 16:15:18,251 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 16:15:18,251 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 16:15:18,251 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 16:15:18,252 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 16:15:18,252 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 16:15:18,252 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 16:15:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2019-10-02 16:15:18,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 16:15:18,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:18,282 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:18,284 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:18,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:18,290 INFO L82 PathProgramCache]: Analyzing trace with hash 173381458, now seen corresponding path program 1 times [2019-10-02 16:15:18,292 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:18,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:18,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:18,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:18,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:15:18,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:18,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:18,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:18,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:18,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:18,549 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2019-10-02 16:15:18,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:18,676 INFO L93 Difference]: Finished difference Result 374 states and 631 transitions. [2019-10-02 16:15:18,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:18,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-02 16:15:18,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:18,692 INFO L225 Difference]: With dead ends: 374 [2019-10-02 16:15:18,692 INFO L226 Difference]: Without dead ends: 218 [2019-10-02 16:15:18,696 INFO L640 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 [2019-10-02 16:15:18,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-02 16:15:18,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-10-02 16:15:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-10-02 16:15:18,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 324 transitions. [2019-10-02 16:15:18,758 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 324 transitions. Word has length 29 [2019-10-02 16:15:18,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:18,758 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 324 transitions. [2019-10-02 16:15:18,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 324 transitions. [2019-10-02 16:15:18,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 16:15:18,762 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:18,762 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:18,762 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:18,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1098410427, now seen corresponding path program 1 times [2019-10-02 16:15:18,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:18,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:18,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:18,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:18,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:18,859 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:15:18,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:18,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:18,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:18,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:18,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:18,862 INFO L87 Difference]: Start difference. First operand 218 states and 324 transitions. Second operand 3 states. [2019-10-02 16:15:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:19,035 INFO L93 Difference]: Finished difference Result 466 states and 703 transitions. [2019-10-02 16:15:19,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:19,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-02 16:15:19,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:19,039 INFO L225 Difference]: With dead ends: 466 [2019-10-02 16:15:19,039 INFO L226 Difference]: Without dead ends: 260 [2019-10-02 16:15:19,042 INFO L640 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 [2019-10-02 16:15:19,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-02 16:15:19,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 252. [2019-10-02 16:15:19,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-02 16:15:19,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 368 transitions. [2019-10-02 16:15:19,063 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 368 transitions. Word has length 43 [2019-10-02 16:15:19,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:19,063 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 368 transitions. [2019-10-02 16:15:19,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:19,063 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 368 transitions. [2019-10-02 16:15:19,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 16:15:19,066 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:19,067 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:19,067 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:19,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:19,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1578256893, now seen corresponding path program 1 times [2019-10-02 16:15:19,068 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:19,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:19,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:19,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:19,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:19,190 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 16:15:19,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:19,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:19,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:19,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:19,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:19,193 INFO L87 Difference]: Start difference. First operand 252 states and 368 transitions. Second operand 3 states. [2019-10-02 16:15:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:19,411 INFO L93 Difference]: Finished difference Result 594 states and 898 transitions. [2019-10-02 16:15:19,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:19,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-02 16:15:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:19,415 INFO L225 Difference]: With dead ends: 594 [2019-10-02 16:15:19,415 INFO L226 Difference]: Without dead ends: 352 [2019-10-02 16:15:19,420 INFO L640 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 [2019-10-02 16:15:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-10-02 16:15:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 334. [2019-10-02 16:15:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-02 16:15:19,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 468 transitions. [2019-10-02 16:15:19,463 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 468 transitions. Word has length 60 [2019-10-02 16:15:19,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:19,464 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 468 transitions. [2019-10-02 16:15:19,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 468 transitions. [2019-10-02 16:15:19,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 16:15:19,476 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:19,476 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:19,477 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:19,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash -227181441, now seen corresponding path program 1 times [2019-10-02 16:15:19,477 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:19,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:19,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:19,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:19,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 16:15:19,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:19,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:19,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:19,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:19,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:19,557 INFO L87 Difference]: Start difference. First operand 334 states and 468 transitions. Second operand 3 states. [2019-10-02 16:15:19,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:19,710 INFO L93 Difference]: Finished difference Result 702 states and 999 transitions. [2019-10-02 16:15:19,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:19,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-02 16:15:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:19,717 INFO L225 Difference]: With dead ends: 702 [2019-10-02 16:15:19,717 INFO L226 Difference]: Without dead ends: 380 [2019-10-02 16:15:19,718 INFO L640 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 [2019-10-02 16:15:19,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-10-02 16:15:19,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 372. [2019-10-02 16:15:19,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-02 16:15:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 516 transitions. [2019-10-02 16:15:19,734 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 516 transitions. Word has length 60 [2019-10-02 16:15:19,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:19,734 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 516 transitions. [2019-10-02 16:15:19,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:19,735 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 516 transitions. [2019-10-02 16:15:19,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-02 16:15:19,738 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:19,738 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:19,738 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:19,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:19,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1103223005, now seen corresponding path program 1 times [2019-10-02 16:15:19,739 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:19,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:19,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:19,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:19,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 16:15:19,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:19,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:19,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:19,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:19,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:19,817 INFO L87 Difference]: Start difference. First operand 372 states and 516 transitions. Second operand 3 states. [2019-10-02 16:15:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:20,020 INFO L93 Difference]: Finished difference Result 838 states and 1200 transitions. [2019-10-02 16:15:20,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:20,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-02 16:15:20,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:20,024 INFO L225 Difference]: With dead ends: 838 [2019-10-02 16:15:20,024 INFO L226 Difference]: Without dead ends: 476 [2019-10-02 16:15:20,025 INFO L640 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 [2019-10-02 16:15:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-10-02 16:15:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 450. [2019-10-02 16:15:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-02 16:15:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 650 transitions. [2019-10-02 16:15:20,041 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 650 transitions. Word has length 73 [2019-10-02 16:15:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:20,041 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 650 transitions. [2019-10-02 16:15:20,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:20,042 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 650 transitions. [2019-10-02 16:15:20,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-02 16:15:20,043 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:20,043 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:20,044 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:20,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:20,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1464237739, now seen corresponding path program 1 times [2019-10-02 16:15:20,044 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:20,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:20,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:20,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:20,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 16:15:20,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:20,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:20,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:20,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:20,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:20,087 INFO L87 Difference]: Start difference. First operand 450 states and 650 transitions. Second operand 3 states. [2019-10-02 16:15:20,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:20,214 INFO L93 Difference]: Finished difference Result 936 states and 1361 transitions. [2019-10-02 16:15:20,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:20,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-02 16:15:20,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:20,217 INFO L225 Difference]: With dead ends: 936 [2019-10-02 16:15:20,217 INFO L226 Difference]: Without dead ends: 498 [2019-10-02 16:15:20,219 INFO L640 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 [2019-10-02 16:15:20,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-02 16:15:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 492. [2019-10-02 16:15:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-10-02 16:15:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 702 transitions. [2019-10-02 16:15:20,235 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 702 transitions. Word has length 76 [2019-10-02 16:15:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:20,235 INFO L475 AbstractCegarLoop]: Abstraction has 492 states and 702 transitions. [2019-10-02 16:15:20,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 702 transitions. [2019-10-02 16:15:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 16:15:20,238 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:20,238 INFO L411 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, 1, 1, 1, 1] [2019-10-02 16:15:20,238 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:20,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:20,239 INFO L82 PathProgramCache]: Analyzing trace with hash 665980045, now seen corresponding path program 1 times [2019-10-02 16:15:20,239 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:20,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:20,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:20,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:20,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 16:15:20,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:20,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:20,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:20,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:20,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:20,291 INFO L87 Difference]: Start difference. First operand 492 states and 702 transitions. Second operand 3 states. [2019-10-02 16:15:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:20,334 INFO L93 Difference]: Finished difference Result 972 states and 1393 transitions. [2019-10-02 16:15:20,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:20,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-02 16:15:20,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:20,339 INFO L225 Difference]: With dead ends: 972 [2019-10-02 16:15:20,339 INFO L226 Difference]: Without dead ends: 731 [2019-10-02 16:15:20,340 INFO L640 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 [2019-10-02 16:15:20,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-10-02 16:15:20,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-10-02 16:15:20,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-10-02 16:15:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1044 transitions. [2019-10-02 16:15:20,363 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1044 transitions. Word has length 96 [2019-10-02 16:15:20,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:20,364 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 1044 transitions. [2019-10-02 16:15:20,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:20,364 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1044 transitions. [2019-10-02 16:15:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 16:15:20,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:20,366 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:20,367 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:20,368 INFO L82 PathProgramCache]: Analyzing trace with hash -208123337, now seen corresponding path program 1 times [2019-10-02 16:15:20,368 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:20,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:20,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:20,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:20,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-02 16:15:20,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:20,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:20,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:20,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:20,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:20,444 INFO L87 Difference]: Start difference. First operand 731 states and 1044 transitions. Second operand 3 states. [2019-10-02 16:15:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:20,483 INFO L93 Difference]: Finished difference Result 972 states and 1390 transitions. [2019-10-02 16:15:20,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:20,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-02 16:15:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:20,490 INFO L225 Difference]: With dead ends: 972 [2019-10-02 16:15:20,491 INFO L226 Difference]: Without dead ends: 970 [2019-10-02 16:15:20,491 INFO L640 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 [2019-10-02 16:15:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-10-02 16:15:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2019-10-02 16:15:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-10-02 16:15:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1388 transitions. [2019-10-02 16:15:20,523 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1388 transitions. Word has length 98 [2019-10-02 16:15:20,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:20,523 INFO L475 AbstractCegarLoop]: Abstraction has 970 states and 1388 transitions. [2019-10-02 16:15:20,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1388 transitions. [2019-10-02 16:15:20,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 16:15:20,527 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:20,527 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:20,528 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:20,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:20,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1174534704, now seen corresponding path program 1 times [2019-10-02 16:15:20,529 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:20,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:20,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:20,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:20,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-02 16:15:20,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:20,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:20,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:20,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:20,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:20,600 INFO L87 Difference]: Start difference. First operand 970 states and 1388 transitions. Second operand 3 states. [2019-10-02 16:15:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:20,764 INFO L93 Difference]: Finished difference Result 2034 states and 2930 transitions. [2019-10-02 16:15:20,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:20,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-10-02 16:15:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:20,770 INFO L225 Difference]: With dead ends: 2034 [2019-10-02 16:15:20,770 INFO L226 Difference]: Without dead ends: 1076 [2019-10-02 16:15:20,772 INFO L640 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 [2019-10-02 16:15:20,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-10-02 16:15:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1062. [2019-10-02 16:15:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-10-02 16:15:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1500 transitions. [2019-10-02 16:15:20,805 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1500 transitions. Word has length 123 [2019-10-02 16:15:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:20,805 INFO L475 AbstractCegarLoop]: Abstraction has 1062 states and 1500 transitions. [2019-10-02 16:15:20,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1500 transitions. [2019-10-02 16:15:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 16:15:20,810 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:20,810 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:20,811 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:20,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:20,811 INFO L82 PathProgramCache]: Analyzing trace with hash -176623095, now seen corresponding path program 1 times [2019-10-02 16:15:20,811 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:20,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:20,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:20,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:20,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 16:15:20,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:20,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:20,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:20,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:20,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:20,868 INFO L87 Difference]: Start difference. First operand 1062 states and 1500 transitions. Second operand 3 states. [2019-10-02 16:15:21,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:21,036 INFO L93 Difference]: Finished difference Result 2316 states and 3324 transitions. [2019-10-02 16:15:21,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:21,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-10-02 16:15:21,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:21,043 INFO L225 Difference]: With dead ends: 2316 [2019-10-02 16:15:21,043 INFO L226 Difference]: Without dead ends: 1258 [2019-10-02 16:15:21,046 INFO L640 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 [2019-10-02 16:15:21,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-10-02 16:15:21,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1218. [2019-10-02 16:15:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 16:15:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1724 transitions. [2019-10-02 16:15:21,082 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1724 transitions. Word has length 144 [2019-10-02 16:15:21,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:21,082 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1724 transitions. [2019-10-02 16:15:21,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:21,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1724 transitions. [2019-10-02 16:15:21,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 16:15:21,088 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:21,088 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:21,089 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:21,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:21,090 INFO L82 PathProgramCache]: Analyzing trace with hash -871418854, now seen corresponding path program 1 times [2019-10-02 16:15:21,090 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:21,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:21,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:21,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:21,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 16:15:21,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:21,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:21,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:21,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:21,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:21,186 INFO L87 Difference]: Start difference. First operand 1218 states and 1724 transitions. Second operand 3 states. [2019-10-02 16:15:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:21,315 INFO L93 Difference]: Finished difference Result 2544 states and 3576 transitions. [2019-10-02 16:15:21,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:21,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-02 16:15:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:21,323 INFO L225 Difference]: With dead ends: 2544 [2019-10-02 16:15:21,323 INFO L226 Difference]: Without dead ends: 1338 [2019-10-02 16:15:21,325 INFO L640 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 [2019-10-02 16:15:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2019-10-02 16:15:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1330. [2019-10-02 16:15:21,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2019-10-02 16:15:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1856 transitions. [2019-10-02 16:15:21,360 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1856 transitions. Word has length 180 [2019-10-02 16:15:21,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:21,361 INFO L475 AbstractCegarLoop]: Abstraction has 1330 states and 1856 transitions. [2019-10-02 16:15:21,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:21,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1856 transitions. [2019-10-02 16:15:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 16:15:21,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:21,365 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:21,365 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:21,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:21,366 INFO L82 PathProgramCache]: Analyzing trace with hash -310719076, now seen corresponding path program 1 times [2019-10-02 16:15:21,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:21,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:21,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:21,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:21,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 16:15:21,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:21,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:21,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:21,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:21,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:21,428 INFO L87 Difference]: Start difference. First operand 1330 states and 1856 transitions. Second operand 3 states. [2019-10-02 16:15:21,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:21,571 INFO L93 Difference]: Finished difference Result 2784 states and 3876 transitions. [2019-10-02 16:15:21,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:21,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-02 16:15:21,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:21,579 INFO L225 Difference]: With dead ends: 2784 [2019-10-02 16:15:21,579 INFO L226 Difference]: Without dead ends: 1466 [2019-10-02 16:15:21,582 INFO L640 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 [2019-10-02 16:15:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-10-02 16:15:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1454. [2019-10-02 16:15:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2019-10-02 16:15:21,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2000 transitions. [2019-10-02 16:15:21,624 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2000 transitions. Word has length 180 [2019-10-02 16:15:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:21,625 INFO L475 AbstractCegarLoop]: Abstraction has 1454 states and 2000 transitions. [2019-10-02 16:15:21,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2000 transitions. [2019-10-02 16:15:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 16:15:21,631 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:21,631 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:21,632 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:21,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:21,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2035334682, now seen corresponding path program 1 times [2019-10-02 16:15:21,632 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:21,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:21,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:21,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:21,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-10-02 16:15:21,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:21,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:21,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:21,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:21,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:21,757 INFO L87 Difference]: Start difference. First operand 1454 states and 2000 transitions. Second operand 3 states. [2019-10-02 16:15:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:21,809 INFO L93 Difference]: Finished difference Result 4334 states and 5964 transitions. [2019-10-02 16:15:21,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:21,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-10-02 16:15:21,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:21,823 INFO L225 Difference]: With dead ends: 4334 [2019-10-02 16:15:21,824 INFO L226 Difference]: Without dead ends: 2892 [2019-10-02 16:15:21,827 INFO L640 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 [2019-10-02 16:15:21,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2019-10-02 16:15:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2890. [2019-10-02 16:15:21,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2019-10-02 16:15:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 3975 transitions. [2019-10-02 16:15:21,898 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 3975 transitions. Word has length 210 [2019-10-02 16:15:21,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:21,898 INFO L475 AbstractCegarLoop]: Abstraction has 2890 states and 3975 transitions. [2019-10-02 16:15:21,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 3975 transitions. [2019-10-02 16:15:21,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 16:15:21,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:21,906 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:21,906 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:21,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:21,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1698932836, now seen corresponding path program 1 times [2019-10-02 16:15:21,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:21,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:21,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:21,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:21,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-02 16:15:21,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:21,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:21,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:21,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:21,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:21,987 INFO L87 Difference]: Start difference. First operand 2890 states and 3975 transitions. Second operand 3 states. [2019-10-02 16:15:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:22,198 INFO L93 Difference]: Finished difference Result 6068 states and 8346 transitions. [2019-10-02 16:15:22,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:22,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-10-02 16:15:22,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:22,220 INFO L225 Difference]: With dead ends: 6068 [2019-10-02 16:15:22,220 INFO L226 Difference]: Without dead ends: 3190 [2019-10-02 16:15:22,228 INFO L640 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 [2019-10-02 16:15:22,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2019-10-02 16:15:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3174. [2019-10-02 16:15:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2019-10-02 16:15:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4299 transitions. [2019-10-02 16:15:22,383 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4299 transitions. Word has length 210 [2019-10-02 16:15:22,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:22,384 INFO L475 AbstractCegarLoop]: Abstraction has 3174 states and 4299 transitions. [2019-10-02 16:15:22,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:22,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4299 transitions. [2019-10-02 16:15:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-02 16:15:22,392 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:22,392 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:22,393 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:22,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:22,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1588238652, now seen corresponding path program 1 times [2019-10-02 16:15:22,393 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:22,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:22,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:22,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:22,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-10-02 16:15:22,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:22,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:22,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:22,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:22,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:22,516 INFO L87 Difference]: Start difference. First operand 3174 states and 4299 transitions. Second operand 3 states. [2019-10-02 16:15:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:22,740 INFO L93 Difference]: Finished difference Result 6484 states and 8778 transitions. [2019-10-02 16:15:22,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:22,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-10-02 16:15:22,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:22,758 INFO L225 Difference]: With dead ends: 6484 [2019-10-02 16:15:22,758 INFO L226 Difference]: Without dead ends: 3322 [2019-10-02 16:15:22,764 INFO L640 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 [2019-10-02 16:15:22,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2019-10-02 16:15:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3306. [2019-10-02 16:15:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2019-10-02 16:15:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4451 transitions. [2019-10-02 16:15:22,850 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4451 transitions. Word has length 234 [2019-10-02 16:15:22,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:22,850 INFO L475 AbstractCegarLoop]: Abstraction has 3306 states and 4451 transitions. [2019-10-02 16:15:22,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4451 transitions. [2019-10-02 16:15:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-02 16:15:22,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:22,859 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:22,859 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:22,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:22,860 INFO L82 PathProgramCache]: Analyzing trace with hash -736614694, now seen corresponding path program 1 times [2019-10-02 16:15:22,860 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:22,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:22,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:22,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:22,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-10-02 16:15:22,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:22,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:22,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:22,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:22,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:22,958 INFO L87 Difference]: Start difference. First operand 3306 states and 4451 transitions. Second operand 3 states. [2019-10-02 16:15:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:23,209 INFO L93 Difference]: Finished difference Result 7000 states and 9558 transitions. [2019-10-02 16:15:23,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:23,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-10-02 16:15:23,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:23,233 INFO L225 Difference]: With dead ends: 7000 [2019-10-02 16:15:23,234 INFO L226 Difference]: Without dead ends: 3706 [2019-10-02 16:15:23,243 INFO L640 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 [2019-10-02 16:15:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2019-10-02 16:15:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3618. [2019-10-02 16:15:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3618 states. [2019-10-02 16:15:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 4819 transitions. [2019-10-02 16:15:23,375 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 4819 transitions. Word has length 245 [2019-10-02 16:15:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:23,376 INFO L475 AbstractCegarLoop]: Abstraction has 3618 states and 4819 transitions. [2019-10-02 16:15:23,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 4819 transitions. [2019-10-02 16:15:23,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-02 16:15:23,392 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:23,392 INFO L411 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, 1, 1, 1, 1] [2019-10-02 16:15:23,393 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:23,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:23,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1168177660, now seen corresponding path program 1 times [2019-10-02 16:15:23,394 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:23,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:23,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:23,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:23,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:23,534 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-10-02 16:15:23,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:23,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:23,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:23,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:23,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:23,537 INFO L87 Difference]: Start difference. First operand 3618 states and 4819 transitions. Second operand 3 states. [2019-10-02 16:15:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:23,811 INFO L93 Difference]: Finished difference Result 7632 states and 10102 transitions. [2019-10-02 16:15:23,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:23,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-10-02 16:15:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:23,862 INFO L225 Difference]: With dead ends: 7632 [2019-10-02 16:15:23,862 INFO L226 Difference]: Without dead ends: 4026 [2019-10-02 16:15:23,881 INFO L640 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 [2019-10-02 16:15:23,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2019-10-02 16:15:24,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 3738. [2019-10-02 16:15:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3738 states. [2019-10-02 16:15:24,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 4963 transitions. [2019-10-02 16:15:24,033 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 4963 transitions. Word has length 259 [2019-10-02 16:15:24,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:24,034 INFO L475 AbstractCegarLoop]: Abstraction has 3738 states and 4963 transitions. [2019-10-02 16:15:24,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:24,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 4963 transitions. [2019-10-02 16:15:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-02 16:15:24,049 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:24,049 INFO L411 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, 1, 1, 1, 1, 1] [2019-10-02 16:15:24,050 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:24,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:24,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1227839833, now seen corresponding path program 1 times [2019-10-02 16:15:24,051 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:24,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:24,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:24,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:24,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:24,351 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-10-02 16:15:24,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:24,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:24,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:24,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:24,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:24,354 INFO L87 Difference]: Start difference. First operand 3738 states and 4963 transitions. Second operand 3 states. [2019-10-02 16:15:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:24,481 INFO L93 Difference]: Finished difference Result 10686 states and 14265 transitions. [2019-10-02 16:15:24,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:24,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-10-02 16:15:24,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:24,507 INFO L225 Difference]: With dead ends: 10686 [2019-10-02 16:15:24,508 INFO L226 Difference]: Without dead ends: 6960 [2019-10-02 16:15:24,519 INFO L640 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 [2019-10-02 16:15:24,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6960 states. [2019-10-02 16:15:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6960 to 6958. [2019-10-02 16:15:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6958 states. [2019-10-02 16:15:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6958 states to 6958 states and 9293 transitions. [2019-10-02 16:15:24,752 INFO L78 Accepts]: Start accepts. Automaton has 6958 states and 9293 transitions. Word has length 260 [2019-10-02 16:15:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:24,753 INFO L475 AbstractCegarLoop]: Abstraction has 6958 states and 9293 transitions. [2019-10-02 16:15:24,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 6958 states and 9293 transitions. [2019-10-02 16:15:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-02 16:15:24,771 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:24,772 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:24,772 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:24,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:24,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818967, now seen corresponding path program 1 times [2019-10-02 16:15:24,773 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:24,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:24,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:24,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:24,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:24,876 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2019-10-02 16:15:24,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:24,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:24,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:24,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:24,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:24,879 INFO L87 Difference]: Start difference. First operand 6958 states and 9293 transitions. Second operand 3 states. [2019-10-02 16:15:25,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:25,173 INFO L93 Difference]: Finished difference Result 13912 states and 18562 transitions. [2019-10-02 16:15:25,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:25,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-02 16:15:25,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:25,188 INFO L225 Difference]: With dead ends: 13912 [2019-10-02 16:15:25,189 INFO L226 Difference]: Without dead ends: 6966 [2019-10-02 16:15:25,200 INFO L640 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 [2019-10-02 16:15:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6966 states. [2019-10-02 16:15:25,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6966 to 6934. [2019-10-02 16:15:25,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6934 states. [2019-10-02 16:15:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6934 states to 6934 states and 9077 transitions. [2019-10-02 16:15:25,351 INFO L78 Accepts]: Start accepts. Automaton has 6934 states and 9077 transitions. Word has length 261 [2019-10-02 16:15:25,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:25,352 INFO L475 AbstractCegarLoop]: Abstraction has 6934 states and 9077 transitions. [2019-10-02 16:15:25,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:25,352 INFO L276 IsEmpty]: Start isEmpty. Operand 6934 states and 9077 transitions. [2019-10-02 16:15:25,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 16:15:25,367 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:25,368 INFO L411 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, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:25,368 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:25,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:25,369 INFO L82 PathProgramCache]: Analyzing trace with hash 747649846, now seen corresponding path program 1 times [2019-10-02 16:15:25,369 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:25,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:25,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:25,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:25,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 318 proven. 18 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-10-02 16:15:25,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:15:25,474 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 16:15:25,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:15:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:25,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 16:15:25,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:15:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2019-10-02 16:15:25,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:15:25,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 16:15:25,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 16:15:25,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 16:15:25,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:15:25,744 INFO L87 Difference]: Start difference. First operand 6934 states and 9077 transitions. Second operand 6 states. [2019-10-02 16:15:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:26,773 INFO L93 Difference]: Finished difference Result 17368 states and 22742 transitions. [2019-10-02 16:15:26,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 16:15:26,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 284 [2019-10-02 16:15:26,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:26,804 INFO L225 Difference]: With dead ends: 17368 [2019-10-02 16:15:26,804 INFO L226 Difference]: Without dead ends: 10410 [2019-10-02 16:15:26,826 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 16:15:26,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10410 states. [2019-10-02 16:15:27,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10410 to 8844. [2019-10-02 16:15:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8844 states. [2019-10-02 16:15:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8844 states to 8844 states and 11583 transitions. [2019-10-02 16:15:27,215 INFO L78 Accepts]: Start accepts. Automaton has 8844 states and 11583 transitions. Word has length 284 [2019-10-02 16:15:27,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:27,215 INFO L475 AbstractCegarLoop]: Abstraction has 8844 states and 11583 transitions. [2019-10-02 16:15:27,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 16:15:27,216 INFO L276 IsEmpty]: Start isEmpty. Operand 8844 states and 11583 transitions. [2019-10-02 16:15:27,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-02 16:15:27,242 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:27,243 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:27,243 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:27,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:27,245 INFO L82 PathProgramCache]: Analyzing trace with hash 280748442, now seen corresponding path program 1 times [2019-10-02 16:15:27,245 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:27,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:27,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:27,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:27,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 407 proven. 5 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-10-02 16:15:27,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:15:27,440 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:15:27,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:27,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:15:27,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:15:27,794 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 16:15:27,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:15:27,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-02 16:15:27,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 16:15:27,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 16:15:27,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:15:27,800 INFO L87 Difference]: Start difference. First operand 8844 states and 11583 transitions. Second operand 5 states. [2019-10-02 16:15:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:28,378 INFO L93 Difference]: Finished difference Result 20417 states and 26625 transitions. [2019-10-02 16:15:28,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:15:28,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 310 [2019-10-02 16:15:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:28,400 INFO L225 Difference]: With dead ends: 20417 [2019-10-02 16:15:28,401 INFO L226 Difference]: Without dead ends: 11583 [2019-10-02 16:15:28,419 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:15:28,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11583 states. [2019-10-02 16:15:28,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11583 to 9674. [2019-10-02 16:15:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9674 states. [2019-10-02 16:15:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9674 states to 9674 states and 12389 transitions. [2019-10-02 16:15:28,680 INFO L78 Accepts]: Start accepts. Automaton has 9674 states and 12389 transitions. Word has length 310 [2019-10-02 16:15:28,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:28,681 INFO L475 AbstractCegarLoop]: Abstraction has 9674 states and 12389 transitions. [2019-10-02 16:15:28,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 16:15:28,681 INFO L276 IsEmpty]: Start isEmpty. Operand 9674 states and 12389 transitions. [2019-10-02 16:15:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-10-02 16:15:28,702 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:28,703 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 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, 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] [2019-10-02 16:15:28,703 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:28,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:28,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1592916915, now seen corresponding path program 1 times [2019-10-02 16:15:28,704 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:28,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:28,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:28,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:28,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 884 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-02 16:15:28,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:15:28,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:15:28,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:15:28,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:15:28,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:15:28,965 INFO L87 Difference]: Start difference. First operand 9674 states and 12389 transitions. Second operand 3 states. [2019-10-02 16:15:29,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:29,203 INFO L93 Difference]: Finished difference Result 18321 states and 23212 transitions. [2019-10-02 16:15:29,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:15:29,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 416 [2019-10-02 16:15:29,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:29,213 INFO L225 Difference]: With dead ends: 18321 [2019-10-02 16:15:29,213 INFO L226 Difference]: Without dead ends: 3877 [2019-10-02 16:15:29,236 INFO L640 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 [2019-10-02 16:15:29,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3877 states. [2019-10-02 16:15:29,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3877 to 3536. [2019-10-02 16:15:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3536 states. [2019-10-02 16:15:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 4402 transitions. [2019-10-02 16:15:29,309 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 4402 transitions. Word has length 416 [2019-10-02 16:15:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:29,309 INFO L475 AbstractCegarLoop]: Abstraction has 3536 states and 4402 transitions. [2019-10-02 16:15:29,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:15:29,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 4402 transitions. [2019-10-02 16:15:29,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-10-02 16:15:29,321 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:15:29,322 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:15:29,322 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:15:29,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:15:29,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1911375163, now seen corresponding path program 1 times [2019-10-02 16:15:29,323 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:15:29,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:15:29,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:29,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:15:29,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:15:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:29,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-10-02 16:15:29,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:15:29,523 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 16:15:29,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:15:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:15:29,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 16:15:29,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:15:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-10-02 16:15:29,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 16:15:29,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-02 16:15:29,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 16:15:29,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 16:15:29,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:15:29,871 INFO L87 Difference]: Start difference. First operand 3536 states and 4402 transitions. Second operand 4 states. [2019-10-02 16:15:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:15:30,085 INFO L93 Difference]: Finished difference Result 4032 states and 5027 transitions. [2019-10-02 16:15:30,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:15:30,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 447 [2019-10-02 16:15:30,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:15:30,087 INFO L225 Difference]: With dead ends: 4032 [2019-10-02 16:15:30,087 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 16:15:30,094 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:15:30,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 16:15:30,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 16:15:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 16:15:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 16:15:30,095 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 447 [2019-10-02 16:15:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:15:30,096 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 16:15:30,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 16:15:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 16:15:30,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 16:15:30,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 16:15:30,426 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 30 [2019-10-02 16:15:30,869 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 353 DAG size of output: 66 [2019-10-02 16:15:31,703 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-10-02 16:15:31,856 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 16:15:31,856 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:15:31,857 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-10-02 16:15:31,857 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-10-02 16:15:31,857 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 491) no Hoare annotation was computed. [2019-10-02 16:15:31,857 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 502) no Hoare annotation was computed. [2019-10-02 16:15:31,857 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 513) no Hoare annotation was computed. [2019-10-02 16:15:31,857 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 469) no Hoare annotation was computed. [2019-10-02 16:15:31,857 INFO L443 ceAbstractionStarter]: For program point L467-2(lines 467 469) no Hoare annotation was computed. [2019-10-02 16:15:31,858 INFO L439 ceAbstractionStarter]: At program point L137(lines 133 503) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2019-10-02 16:15:31,858 INFO L446 ceAbstractionStarter]: At program point L534(lines 96 535) the Hoare annotation is: true [2019-10-02 16:15:31,858 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-10-02 16:15:31,858 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 240) no Hoare annotation was computed. [2019-10-02 16:15:31,858 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 270 274) no Hoare annotation was computed. [2019-10-02 16:15:31,858 INFO L443 ceAbstractionStarter]: For program point L304(lines 304 307) no Hoare annotation was computed. [2019-10-02 16:15:31,858 INFO L439 ceAbstractionStarter]: At program point L205(lines 103 513) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (<= ssl3_connect_~blastFlag~0 0) (and (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0))) [2019-10-02 16:15:31,858 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 490) no Hoare annotation was computed. [2019-10-02 16:15:31,858 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 501) no Hoare annotation was computed. [2019-10-02 16:15:31,859 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 512) no Hoare annotation was computed. [2019-10-02 16:15:31,859 INFO L439 ceAbstractionStarter]: At program point L173(lines 169 491) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560) (<= 4464 ssl3_connect_~s__state~0))) [2019-10-02 16:15:31,859 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 474) no Hoare annotation was computed. [2019-10-02 16:15:31,859 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 450) no Hoare annotation was computed. [2019-10-02 16:15:31,859 INFO L443 ceAbstractionStarter]: For program point L406(lines 406 420) no Hoare annotation was computed. [2019-10-02 16:15:31,859 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 406 420) no Hoare annotation was computed. [2019-10-02 16:15:31,859 INFO L443 ceAbstractionStarter]: For program point L439-2(lines 439 450) no Hoare annotation was computed. [2019-10-02 16:15:31,860 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 489) no Hoare annotation was computed. [2019-10-02 16:15:31,860 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 500) no Hoare annotation was computed. [2019-10-02 16:15:31,860 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 511) no Hoare annotation was computed. [2019-10-02 16:15:31,860 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 541) no Hoare annotation was computed. [2019-10-02 16:15:31,860 INFO L443 ceAbstractionStarter]: For program point L539-2(lines 539 541) no Hoare annotation was computed. [2019-10-02 16:15:31,860 INFO L439 ceAbstractionStarter]: At program point L143(lines 139 501) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2019-10-02 16:15:31,860 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 344) no Hoare annotation was computed. [2019-10-02 16:15:31,860 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 212) no Hoare annotation was computed. [2019-10-02 16:15:31,861 INFO L443 ceAbstractionStarter]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2019-10-02 16:15:31,861 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 378) no Hoare annotation was computed. [2019-10-02 16:15:31,861 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 488) no Hoare annotation was computed. [2019-10-02 16:15:31,861 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 499) no Hoare annotation was computed. [2019-10-02 16:15:31,861 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 510) no Hoare annotation was computed. [2019-10-02 16:15:31,861 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 416) no Hoare annotation was computed. [2019-10-02 16:15:31,861 INFO L439 ceAbstractionStarter]: At program point L179(lines 175 489) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= ssl3_connect_~s__hit~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2019-10-02 16:15:31,861 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2019-10-02 16:15:31,862 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 314) no Hoare annotation was computed. [2019-10-02 16:15:31,862 INFO L443 ceAbstractionStarter]: For program point L279-1(lines 279 289) no Hoare annotation was computed. [2019-10-02 16:15:31,862 INFO L439 ceAbstractionStarter]: At program point L313(lines 75 545) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-10-02 16:15:31,862 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 487) no Hoare annotation was computed. [2019-10-02 16:15:31,862 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 498) no Hoare annotation was computed. [2019-10-02 16:15:31,862 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 509) no Hoare annotation was computed. [2019-10-02 16:15:31,863 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-10-02 16:15:31,863 INFO L439 ceAbstractionStarter]: At program point L149(lines 145 499) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2))) [2019-10-02 16:15:31,863 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-10-02 16:15:31,863 INFO L439 ceAbstractionStarter]: At program point L480(lines 97 533) the Hoare annotation is: (let ((.cse3 (<= ssl3_connect_~s__state~0 4352)) (.cse4 (<= 4352 ssl3_connect_~s__state~0)) (.cse7 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse8 (<= 4560 ssl3_connect_~s__state~0)) (.cse9 (<= ssl3_connect_~s__state~0 4560)) (.cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse1 (= ssl3_connect_~s__state~0 4528)) (.cse0 (<= ssl3_connect_~blastFlag~0 2)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (and .cse0 .cse1) (and .cse2 (= ssl3_connect_~s__state~0 4480)) (and (= ssl3_connect_~s__state~0 4496) .cse2) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse3 .cse4) (and .cse5 .cse2) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse6 .cse3 .cse4 .cse2 .cse7) (and .cse6 .cse8 .cse2 .cse9 .cse7) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and (= 4464 ssl3_connect_~s__state~0) .cse2) (and .cse0 .cse8 .cse9) (and (<= ssl3_connect_~s__state~0 3) .cse6) (and .cse0 .cse5) (and .cse1 .cse2) (and .cse0 (= 4384 ssl3_connect_~s__state~0)) (and (<= ssl3_connect_~blastFlag~0 4) .cse2))) [2019-10-02 16:15:31,864 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2019-10-02 16:15:31,864 INFO L443 ceAbstractionStarter]: For program point L249(lines 249 251) no Hoare annotation was computed. [2019-10-02 16:15:31,864 INFO L443 ceAbstractionStarter]: For program point L249-2(lines 200 479) no Hoare annotation was computed. [2019-10-02 16:15:31,864 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 546) the Hoare annotation is: true [2019-10-02 16:15:31,864 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 386) no Hoare annotation was computed. [2019-10-02 16:15:31,864 INFO L443 ceAbstractionStarter]: For program point L382-2(lines 200 479) no Hoare annotation was computed. [2019-10-02 16:15:31,864 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2019-10-02 16:15:31,864 INFO L443 ceAbstractionStarter]: For program point L283-2(lines 281 289) no Hoare annotation was computed. [2019-10-02 16:15:31,865 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 486) no Hoare annotation was computed. [2019-10-02 16:15:31,865 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 497) no Hoare annotation was computed. [2019-10-02 16:15:31,865 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 508) no Hoare annotation was computed. [2019-10-02 16:15:31,865 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 531) no Hoare annotation was computed. [2019-10-02 16:15:31,865 INFO L439 ceAbstractionStarter]: At program point L185(lines 181 487) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (<= 4464 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= ssl3_connect_~s__hit~0 0) .cse0 .cse1) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2019-10-02 16:15:31,865 INFO L439 ceAbstractionStarter]: At program point L119(lines 115 509) the Hoare annotation is: (let ((.cse2 (<= ssl3_connect_~blastFlag~0 0)) (.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse2 (= ssl3_connect_~s__state~0 4368)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse0 .cse1))) [2019-10-02 16:15:31,865 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-10-02 16:15:31,865 INFO L443 ceAbstractionStarter]: For program point L86-2(lines 83 89) no Hoare annotation was computed. [2019-10-02 16:15:31,866 INFO L443 ceAbstractionStarter]: For program point L516(lines 516 530) no Hoare annotation was computed. [2019-10-02 16:15:31,866 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-10-02 16:15:31,866 INFO L443 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2019-10-02 16:15:31,866 INFO L443 ceAbstractionStarter]: For program point L517-2(lines 516 530) no Hoare annotation was computed. [2019-10-02 16:15:31,866 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 485) no Hoare annotation was computed. [2019-10-02 16:15:31,866 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 496) no Hoare annotation was computed. [2019-10-02 16:15:31,866 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 507) no Hoare annotation was computed. [2019-10-02 16:15:31,866 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 232) no Hoare annotation was computed. [2019-10-02 16:15:31,866 INFO L443 ceAbstractionStarter]: For program point L221-2(lines 200 479) no Hoare annotation was computed. [2019-10-02 16:15:31,867 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 521) no Hoare annotation was computed. [2019-10-02 16:15:31,867 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 360) no Hoare annotation was computed. [2019-10-02 16:15:31,867 INFO L443 ceAbstractionStarter]: For program point L355-2(lines 355 360) no Hoare annotation was computed. [2019-10-02 16:15:31,867 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 226) no Hoare annotation was computed. [2019-10-02 16:15:31,867 INFO L443 ceAbstractionStarter]: For program point L190(lines 190 484) no Hoare annotation was computed. [2019-10-02 16:15:31,867 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 495) no Hoare annotation was computed. [2019-10-02 16:15:31,867 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 506) no Hoare annotation was computed. [2019-10-02 16:15:31,867 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 95) no Hoare annotation was computed. [2019-10-02 16:15:31,867 INFO L443 ceAbstractionStarter]: For program point L455-1(lines 455 457) no Hoare annotation was computed. [2019-10-02 16:15:31,867 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 259) no Hoare annotation was computed. [2019-10-02 16:15:31,868 INFO L439 ceAbstractionStarter]: At program point L191(lines 187 485) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2))) [2019-10-02 16:15:31,868 INFO L439 ceAbstractionStarter]: At program point L125(lines 121 507) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1))) [2019-10-02 16:15:31,868 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2019-10-02 16:15:31,868 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 546) no Hoare annotation was computed. [2019-10-02 16:15:31,868 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-10-02 16:15:31,868 INFO L443 ceAbstractionStarter]: For program point L324-2(lines 200 479) no Hoare annotation was computed. [2019-10-02 16:15:31,869 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 546) no Hoare annotation was computed. [2019-10-02 16:15:31,869 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 394) no Hoare annotation was computed. [2019-10-02 16:15:31,869 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 483) no Hoare annotation was computed. [2019-10-02 16:15:31,869 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 494) no Hoare annotation was computed. [2019-10-02 16:15:31,869 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 505) no Hoare annotation was computed. [2019-10-02 16:15:31,869 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 528) no Hoare annotation was computed. [2019-10-02 16:15:31,869 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 230) no Hoare annotation was computed. [2019-10-02 16:15:31,869 INFO L439 ceAbstractionStarter]: At program point L194(lines 193 483) the Hoare annotation is: (let ((.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 .cse1 (<= ssl3_connect_~blastFlag~0 4) .cse2) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1))) [2019-10-02 16:15:31,869 INFO L439 ceAbstractionStarter]: At program point L161(lines 151 497) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560) (<= 4464 ssl3_connect_~s__state~0))) [2019-10-02 16:15:31,870 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 428) no Hoare annotation was computed. [2019-10-02 16:15:31,870 INFO L443 ceAbstractionStarter]: For program point L196(lines 196 482) no Hoare annotation was computed. [2019-10-02 16:15:31,870 INFO L443 ceAbstractionStarter]: For program point L163(lines 163 493) no Hoare annotation was computed. [2019-10-02 16:15:31,870 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 504) no Hoare annotation was computed. [2019-10-02 16:15:31,870 INFO L443 ceAbstractionStarter]: For program point L97-1(lines 75 545) no Hoare annotation was computed. [2019-10-02 16:15:31,870 INFO L443 ceAbstractionStarter]: For program point L461(lines 461 463) no Hoare annotation was computed. [2019-10-02 16:15:31,870 INFO L443 ceAbstractionStarter]: For program point L461-2(lines 461 463) no Hoare annotation was computed. [2019-10-02 16:15:31,870 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 298) no Hoare annotation was computed. [2019-10-02 16:15:31,870 INFO L443 ceAbstractionStarter]: For program point L296-2(lines 200 479) no Hoare annotation was computed. [2019-10-02 16:15:31,871 INFO L446 ceAbstractionStarter]: At program point L197(lines 196 482) the Hoare annotation is: true [2019-10-02 16:15:31,871 INFO L439 ceAbstractionStarter]: At program point L131(lines 127 505) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2019-10-02 16:15:31,871 INFO L443 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-10-02 16:15:31,871 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 433) no Hoare annotation was computed. [2019-10-02 16:15:31,871 INFO L443 ceAbstractionStarter]: For program point L429-2(lines 429 433) no Hoare annotation was computed. [2019-10-02 16:15:31,871 INFO L443 ceAbstractionStarter]: For program point L330(lines 330 334) no Hoare annotation was computed. [2019-10-02 16:15:31,871 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2019-10-02 16:15:31,871 INFO L443 ceAbstractionStarter]: For program point L330-2(lines 330 334) no Hoare annotation was computed. [2019-10-02 16:15:31,871 INFO L443 ceAbstractionStarter]: For program point L264-2(lines 200 479) no Hoare annotation was computed. [2019-10-02 16:15:31,872 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 543) no Hoare annotation was computed. [2019-10-02 16:15:31,872 INFO L446 ceAbstractionStarter]: At program point L199(lines 198 482) the Hoare annotation is: true [2019-10-02 16:15:31,872 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 492) no Hoare annotation was computed. [2019-10-02 16:15:31,872 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 503) no Hoare annotation was computed. [2019-10-02 16:15:31,872 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 514) no Hoare annotation was computed. [2019-10-02 16:15:31,872 INFO L439 ceAbstractionStarter]: At program point L167(lines 163 493) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560) (<= 4464 ssl3_connect_~s__state~0))) [2019-10-02 16:15:31,872 INFO L439 ceAbstractionStarter]: At program point L101(lines 100 514) the Hoare annotation is: (let ((.cse0 (<= 12292 ssl3_connect_~s__state~0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) .cse0) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0)))) [2019-10-02 16:15:31,873 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:15:31,873 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 16:15:31,873 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 16:15:31,873 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 16:15:31,873 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 547 557) the Hoare annotation is: true [2019-10-02 16:15:31,873 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 547 557) no Hoare annotation was computed. [2019-10-02 16:15:31,873 INFO L446 ceAbstractionStarter]: At program point L553(line 553) the Hoare annotation is: true [2019-10-02 16:15:31,873 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 547 557) no Hoare annotation was computed. [2019-10-02 16:15:31,873 INFO L443 ceAbstractionStarter]: For program point L553-1(line 553) no Hoare annotation was computed. [2019-10-02 16:15:31,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 04:15:31 BoogieIcfgContainer [2019-10-02 16:15:31,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 16:15:31,904 INFO L168 Benchmark]: Toolchain (without parser) took 15126.98 ms. Allocated memory was 141.0 MB in the beginning and 756.0 MB in the end (delta: 615.0 MB). Free memory was 87.9 MB in the beginning and 154.8 MB in the end (delta: -66.9 MB). Peak memory consumption was 548.1 MB. Max. memory is 7.1 GB. [2019-10-02 16:15:31,904 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 107.0 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 16:15:31,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 568.46 ms. Allocated memory was 141.0 MB in the beginning and 200.8 MB in the end (delta: 59.8 MB). Free memory was 87.7 MB in the beginning and 175.4 MB in the end (delta: -87.7 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2019-10-02 16:15:31,906 INFO L168 Benchmark]: Boogie Preprocessor took 66.25 ms. Allocated memory is still 200.8 MB. Free memory was 175.4 MB in the beginning and 172.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-10-02 16:15:31,907 INFO L168 Benchmark]: RCFGBuilder took 763.93 ms. Allocated memory is still 200.8 MB. Free memory was 172.5 MB in the beginning and 126.3 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-10-02 16:15:31,908 INFO L168 Benchmark]: TraceAbstraction took 13722.48 ms. Allocated memory was 200.8 MB in the beginning and 756.0 MB in the end (delta: 555.2 MB). Free memory was 125.7 MB in the beginning and 154.8 MB in the end (delta: -29.1 MB). Peak memory consumption was 526.1 MB. Max. memory is 7.1 GB. [2019-10-02 16:15:31,912 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 107.0 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 568.46 ms. Allocated memory was 141.0 MB in the beginning and 200.8 MB in the end (delta: 59.8 MB). Free memory was 87.7 MB in the beginning and 175.4 MB in the end (delta: -87.7 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.25 ms. Allocated memory is still 200.8 MB. Free memory was 175.4 MB in the beginning and 172.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 763.93 ms. Allocated memory is still 200.8 MB. Free memory was 172.5 MB in the beginning and 126.3 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13722.48 ms. Allocated memory was 200.8 MB in the beginning and 756.0 MB in the end (delta: 555.2 MB). Free memory was 125.7 MB in the beginning and 154.8 MB in the end (delta: -29.1 MB). Peak memory consumption was 526.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state))) || (blastFlag <= 0 && s__state == 4368)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 0) && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((((blastFlag <= 2 && s__state == 4528) || (s__hit == 0 && s__state == 4480)) || (s__state == 4496 && s__hit == 0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state)) || (s__state == 4512 && s__hit == 0)) || !(12292 <= \old(initial_state))) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || (4464 == s__state && s__hit == 0)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && s__state == 4512)) || (s__state == 4528 && s__hit == 0)) || (blastFlag <= 2 && 4384 == s__state)) || (blastFlag <= 4 && s__hit == 0) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state))) || (((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state)) || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || blastFlag <= 0) || (blastFlag <= 4 && s__hit == 0) - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || (((s__state <= 4352 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state)) || ((12292 <= s__state && blastFlag <= 4) && s__hit == 0) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((4560 <= s__state && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560)) || ((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((s__hit == 0 && s__state <= 4560) && 4464 <= s__state)) || ((blastFlag <= 2 && s__state <= 4560) && 4464 <= s__state) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: ((((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state))) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 135 locations, 1 error locations. SAFE Result, 13.6s OverallTime, 23 OverallIterations, 18 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 4657 SDtfs, 1854 SDslu, 2919 SDs, 0 SdLazy, 2715 SolverSat, 460 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1125 GetRequests, 1088 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9674occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 4400 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 341 NumberOfFragments, 518 HoareAnnotationTreeSize, 26 FomulaSimplifications, 21998 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 26 FomulaSimplificationsInter, 849 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 5339 NumberOfCodeBlocks, 5339 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 5313 ConstructedInterpolants, 0 QuantifiedInterpolants, 1856425 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1976 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 15819/15870 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...